{"$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":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"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":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D23","name":"Boundary Type-Coupling","shortDescription":{"text":"Boundary Type-Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D23"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D32","name":"Data Compliance (PII/GDPR)","shortDescription":{"text":"Data Compliance (PII/GDPR)"},"helpUri":"https://codehealth.canine.dev/dimensions/D32","relationships":[{"target":{"id":"CWE-359","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-312","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-200","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-359","CWE-312","CWE-200"],"owasp":"A01:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX2","name":"Stateful singletons","shortDescription":{"text":"Stateful singletons"},"helpUri":"https://codehealth.canine.dev/dimensions/AX2"},{"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":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"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":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"P8","name":"Schema migrations","shortDescription":{"text":"Schema migrations"},"helpUri":"https://codehealth.canine.dev/dimensions/P8"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R11","name":"Import Boundaries","shortDescription":{"text":"Import Boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/R11"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"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":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"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":"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":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"BexVm::run_compact (cyclomatic 344): BexVm::run_compact has cyclomatic complexity 344 (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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":9408}}}],"partialFingerprints":{"codehealthFindingId/v1":"03517adb4fc2cee6923a8f8cf76ec7d972bf47af327cacde6f906682c15e11d7"}},{"ruleId":"D1","level":"warning","message":{"text":"TirTypeError::render (cyclomatic 212): TirTypeError::render has cyclomatic complexity 212 (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":"baml_language/crates/baml_compiler2_hir_ty/src/diagnostics.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bacf8eb489678bf57ceb6d7412405c0cc6fb0dcd384b9d7dd1c3a483c03c3c3"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler::thir::typecheck::typecheck_expression (cyclomatic 210): baml_compiler::thir::typecheck::typecheck_expression has cyclomatic complexity 210 (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":"engine/baml-compiler/src/thir/typecheck.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ce14285a5d01b88bebe7c85b184b87ae3c1a46bf2937b0f46b86197963b5a0"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::finish (cyclomatic 203): InferenceContext::finish has cyclomatic complexity 203 (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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":12717}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c4ab9ef8275161d8f47f2fe7ba8368d2d7545801dafc5610b2600d51b5d6b4"}},{"ruleId":"D1","level":"warning","message":{"text":"Vm::exec (cyclomatic 149): Vm::exec has cyclomatic complexity 149 (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":"engine/baml-vm/src/vm.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d07871cea8cc6980f602cdb51cd6bb4704931f8ad7f97156528cd69de72514"}},{"ruleId":"D1","level":"warning","message":{"text":"Bytecode::instruction_to_opcode (cyclomatic 146): Bytecode::instruction_to_opcode has cyclomatic complexity 146 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: OpCode::try_from (cyclomatic 149) 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":"baml_language/crates/bex_vm_types/src/bytecode.rs"},"region":{"startLine":3099}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bcc9204221c889949dc6db2269549916ac7d47ebfdf0d252c8c9f0ca23201f"}},{"ruleId":"D1","level":"warning","message":{"text":"ReplArgs::run (cyclomatic 125): ReplArgs::run has cyclomatic complexity 125 (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":"engine/baml-runtime/src/cli/repl.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbc0216d859a651c8aed5a9fc150b231404e10c60cc2cc4e30be68bb20d66ee"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm::debug::display_instruction_textual (cyclomatic 118): bex_vm::debug::display_instruction_textual has cyclomatic complexity 118 (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":"baml_language/crates/bex_vm/src/debug.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"8813a876a0b07ac538fbda39f61dc2e701f179ad3d6c85f5657232d59faf9ee0"}},{"ruleId":"D1","level":"warning","message":{"text":"cargo_stow::generate_dependency_graph_svg (cyclomatic 110): cargo_stow::generate_dependency_graph_svg has cyclomatic complexity 110 (threshold 15). Of this number, 103 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. 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":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed24827b551cb3618eca44ed068f351fa7e5cd8d729b3cde27b801042c38622"}},{"ruleId":"D1","level":"warning","message":{"text":"comment-sidebar.CommentSidebar (cyclomatic 109): comment-sidebar.CommentSidebar has cyclomatic complexity 109 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 93 belong to 28 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-sidebar.tsx"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d87557d2f11a42f5d7dfbe3ebfcdb940141669f224b0af4b09714cd48245a7e"}},{"ruleId":"D1","level":"warning","message":{"text":"App.App (cyclomatic 109): App.App has cyclomatic complexity 109 (threshold 15). Of this number, 47 points are the body\u0027s own statements and 62 belong to 21 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/src/App.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2bb77c22c4c31766392d80aae88ba67b8183fe3f3d51121d1eeefc76ad8624"}},{"ruleId":"D1","level":"warning","message":{"text":"webview-media.WebviewMedia (cyclomatic 107): webview-media.WebviewMedia has cyclomatic complexity 107 (threshold 15). Of this number, 53 points are the body\u0027s own statements and 54 belong to 15 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b185ef043bf4ed0fed112312e8426a4bf8a04c210f90b7cac224883e03169f14"}},{"ruleId":"D1","level":"warning","message":{"text":"baml-lsp-worker.onmessage (cyclomatic 103): baml-lsp-worker.onmessage has cyclomatic complexity 103 (threshold 15). Of this number, 89 points are the body\u0027s own statements and 14 belong to 8 function literals inside it that branch. 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":"typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9579228f516dd3d88842898001b751152e7a94ae9b6cca9e07e497d8c84b305"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler::thir::interpret::evaluate_block_with_control_flow::handle_statement (cyclomatic 101): baml_compiler::thir::interpret::evaluate_block_with_control_flow::handle_statement has cyclomatic complexity 101 (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":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6eaa211176194e0801346e6ff2dfe6216e4254b6491ea60b4d83fdf642bd9c8"}},{"ruleId":"D1","level":"warning","message":{"text":"internal_baml_jinja_types::evaluate_type::expr::tracker_visit_expr (cyclomatic 97): internal_baml_jinja_types::evaluate_type::expr::tracker_visit_expr has cyclomatic complexity 97 (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":"engine/baml-lib/jinja/src/evaluate_type/expr.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"6669eb5e170f948ca1a2d725f73a8fb59cddc7b583996b39df81faa963a3644f"}},{"ruleId":"D1","level":"warning","message":{"text":"baml-worker.onmessage (cyclomatic 97): baml-worker.onmessage has cyclomatic complexity 97 (threshold 15). Of this number, 94 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. 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":"typescript2/app-website/playground/baml-worker.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"018cc94106f3935218cc1f08777474ab52ba9f541b681f546fcf45984441d587"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgCoercer::coerce_arg (cyclomatic 96): ArgCoercer::coerce_arg has cyclomatic complexity 96 (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":"engine/baml-lib/baml-core/src/ir/ir_helpers/to_baml_arg.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"825b092c6256ed655be193da442565138ef485d77657a8c6ea3d1ce43126b774"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_go.validateBAMLTypeAt (cyclomatic 94): baml_go.validateBAMLTypeAt has cyclomatic complexity 94 (threshold 15). Of this number, 92 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"baml_language/sdks/go/baml_go/value.go"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae52902334250c903bada330ed7bae480fc430f1c35936279550823d982d082"}},{"ruleId":"D1","level":"warning","message":{"text":"ExecutionPanel.ExecutionPanel (cyclomatic 88): ExecutionPanel.ExecutionPanel has cyclomatic complexity 88 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (ExecutionPanel.ExecutionPanel::handleCursorContext) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dffc3754544c8b289000da8215d23581a0f03ebfaf40668e7366df666683d8c"}},{"ruleId":"D1","level":"warning","message":{"text":"HirCompiler::compile_expression (cyclomatic 86): HirCompiler::compile_expression has cyclomatic complexity 86 (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":"engine/baml-compiler/src/codegen.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac427a3e9be875527b2510c7cfd73e69f45340670df03535d51514eeb81f562"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_mir::optimize::verify_definite_assignment (cyclomatic 84): baml_compiler2_mir::optimize::verify_definite_assignment has cyclomatic complexity 84 (threshold 15). Of this number, 82 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"baml_language/crates/baml_compiler2_mir/src/optimize.rs"},"region":{"startLine":1943}}}],"partialFingerprints":{"codehealthFindingId/v1":"475b656b8a7724aa4a9af8504875de04dcd57856f612529fc614807c2edf5668"}},{"ruleId":"D1","level":"warning","message":{"text":"bep-route-shell.BepRouteShell (cyclomatic 82): bep-route-shell.BepRouteShell has cyclomatic complexity 82 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (bep-route-shell.BepRouteShell::handleConfirmSubmit) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-route-shell.tsx"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c2722d9e0aaf9e6b9e00897d90ac402d9e56f6ddae4c924e80ee031d45cf52"}},{"ruleId":"D1","level":"warning","message":{"text":"MonacoEditor.MonacoEditor (cyclomatic 82): MonacoEditor.MonacoEditor has cyclomatic complexity 82 (threshold 15). Most of this is not in the body itself: 5 of the 82 points are its own statements and the rest belongs to 18 function literals inside it that branch (lines 354, 1083, 1151, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-editor/src/MonacoEditor.tsx"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eea4a19d53df5dd1505b328da4ac8ac374444f4aac7da21f0db0ec03030cd4b"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::infer_expr (cyclomatic 78): InferenceContext::infer_expr has cyclomatic complexity 78 (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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":2907}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5fc0217a5d2d0a4ac97b669ecc769d5bcc747dd7d0074eabfe83456625f2c4"}},{"ruleId":"D1","level":"warning","message":{"text":"BexEngine::run_thread_event_loop_inner (cyclomatic 76): BexEngine::run_thread_event_loop_inner has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":6074}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ac13565c390211e33a1f93added4537144872b95713f349679bac52df391b0"}},{"ruleId":"D1","level":"warning","message":{"text":"Message.child (cyclomatic 76): Message.child has cyclomatic complexity 76 (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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/WireDepth.java"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"4196c99b9ceda5a1304fd510213ea821e83ad822214c481670220f8a3236dcca"}},{"ruleId":"D1","level":"warning","message":{"text":"bep-import-dialog.BepImportDialog (cyclomatic 76): bep-import-dialog.BepImportDialog has cyclomatic complexity 76 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 38 belong to 9 function literals inside it that branch. 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":"typescript2/app-beps/src/components/bep/bep-import-dialog.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b90f9b1439b804b647507273f88b95c98743bceecc4e8e3e4b8246b44845cf0"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_call_with_callee (cyclomatic 71): LoweringContext::lower_call_with_callee has cyclomatic complexity 71 (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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":8326}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05199b2c8490a1c31a2c8c42fab5cdedbf790cc15c65cad6b8f209ada730c0a"}},{"ruleId":"D1","level":"warning","message":{"text":"DetailPanel.LLMNodeContent (cyclomatic 71): DetailPanel.LLMNodeContent has cyclomatic complexity 71 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 37 belong to 13 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c2a6b12a465f636a076dcd830d9e7bebd47d1ae6991f6520349ee5b2b8a911"}},{"ruleId":"D1","level":"warning","message":{"text":"DetailPanel.StandardNodeContent (cyclomatic 70): DetailPanel.StandardNodeContent has cyclomatic complexity 70 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 39 belong to 14 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fcfb4869f478e0e36c7a7138ef3f44c5e15d9af83120ba1b86fbc8d67adf90"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_cffi_macros::export_baml_fn (cyclomatic 69): baml_cffi_macros::export_baml_fn has cyclomatic complexity 69 (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":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3405f823077e3e41de173ac2ac71fc8087de9416086d1dbc42039c3bfd1cfb"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_hir_ty::infer::const_fold_binary (cyclomatic 68): baml_compiler2_hir_ty::infer::const_fold_binary has cyclomatic complexity 68 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"846f329f9aa3795ce20f479a8dbdfeaaeb049463472f98f64f1f67d9251bc47a"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_mir::optimize::verify_mir (cyclomatic 66): baml_compiler2_mir::optimize::verify_mir has cyclomatic complexity 66 (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":"baml_language/crates/baml_compiler2_mir/src/optimize.rs"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"848fb27030470da65f1bc9ef929afc0511dd9114cec5912e386885d4ef997bff"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf-viewer.PdfViewer (cyclomatic 65): pdf-viewer.PdfViewer has cyclomatic complexity 65 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 48 belong to 21 function items inside it that branch. 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":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/pdf-viewer.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"326e846d8500bfdae151392478df6d5989de27eec87463ac68810b624c6c3fd7"}},{"ruleId":"D1","level":"warning","message":{"text":"Program::validate (cyclomatic 64): Program::validate has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm_types/src/types.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd63250c5e42f718b7ae54c2c469ee62384e020d00fea036ef7925995e328fc5"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_go.decodeDynamicValue (cyclomatic 63): baml_go.decodeDynamicValue has cyclomatic complexity 63 (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":"baml_language/sdks/go/baml_go/dynamic.go"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2d8595f6b0ad8ff398d2a2212b9a8f71a475c22b98abf0fbd25d28c44933f4"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler::thir::typecheck::typecheck_returning_context (cyclomatic 62): baml_compiler::thir::typecheck::typecheck_returning_context has cyclomatic complexity 62 (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":"engine/baml-compiler/src/thir/typecheck.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"2002b800561bdefdfdad27224320a924c9dd865e626b7cb1c3198e8fe428223e"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::try_lower_as_switch (cyclomatic 61): LoweringContext::try_lower_as_switch has cyclomatic complexity 61 (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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":12735}}}],"partialFingerprints":{"codehealthFindingId/v1":"83fe0ffcd42047d520a9aa3faff9c68e081b3c58defdf75b70b22a21063d03cf"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobalState::dispatch_request (cyclomatic 61): GlobalState::dispatch_request has cyclomatic complexity 61 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp/src/dispatch/mod.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"733f3bb4a5bbdd632ed543e70fe4b863be04e66e3e7aa9fdbddbe3aa77854ad8"}},{"ruleId":"D1","level":"warning","message":{"text":"ProtoWriter.encodeInboundValue (cyclomatic 61): ProtoWriter.encodeInboundValue has cyclomatic complexity 61 (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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoWriter.java"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"172b906069baad76b0e7b7be0059cc3c8635dd67052471524f3ea62a6f7dc872"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_rust::translate_ty::translate_inner (cyclomatic 60): sdkgen_rust::translate_ty::translate_inner has cyclomatic complexity 60 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/rust/sdkgen_rust/src/translate_ty.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cd5ddad694493d053559b60bc5d730fd0376028756307fa383daacc0e34f89"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlAsyncVmRuntime::call_function (cyclomatic 60): BamlAsyncVmRuntime::call_function has cyclomatic complexity 60 (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":"engine/baml-runtime/src/async_vm_runtime.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"4befef50d8186c6e6bc23bd48efef45edf9279b14744d6257d9c0ce25567354f"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_lsp_server::playground_server::handle_ws_in_message (cyclomatic 59): baml_lsp_server::playground_server::handle_ws_in_message has cyclomatic complexity 59 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b6f35771d183591ec6506b244cb197af4ecc2125fc3cb57e8dac1a809785c1"}},{"ruleId":"D1","level":"warning","message":{"text":"HirCompiler::compile_statement (cyclomatic 58): HirCompiler::compile_statement has cyclomatic complexity 58 (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":"engine/baml-compiler/src/codegen.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"525c6d83c081c6a7b9ad68a2847c9fdd049230c54558979467aaa3be7d192c25"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler::thir::interpret::evaluate_expr_with_context (cyclomatic 58): baml_compiler::thir::interpret::evaluate_expr_with_context has cyclomatic complexity 58 (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":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":1639}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba5ceb31b8d374be8954d59669429e56ed3d2e8c2dcbee9d07cab9f1bc74a49"}},{"ruleId":"D1","level":"warning","message":{"text":"page.BcsProposal (cyclomatic 58): page.BcsProposal has cyclomatic complexity 58 (threshold 15). Of this number, 48 points are the body\u0027s own statements and 10 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/page.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9012b4bd73b803c56e085627f5104bda2fbd443fa2a5022f5e8f107390a7eaa"}},{"ruleId":"D1","level":"warning","message":{"text":"Diagnostic::fmt (cyclomatic 57): Diagnostic::fmt has cyclomatic complexity 57 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bcs_api/src/diagnostics.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bcdb45f743bf27081a745a025e70a8cb56635dfaf43eeade515b92447a00b3"}},{"ruleId":"D1","level":"warning","message":{"text":"ConversionBuffer::span (cyclomatic 57): ConversionBuffer::span has cyclomatic complexity 57 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_recorder/src/lib.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"2341379fc7b7816d697d0baa46dc58646696b74a212f182a62656b06bb5b67e4"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_hir_ty::interfaces::impl_rules::validate_impl_signatures (cyclomatic 56): baml_compiler2_hir_ty::interfaces::impl_rules::validate_impl_signatures has cyclomatic complexity 56 (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":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"8032d09b3c5038bc79651246588b76e44129439f37263de24d6475cd4cd809c0"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler::thir::interpret::evaluate_binary_op (cyclomatic 56): baml_compiler::thir::interpret::evaluate_binary_op has cyclomatic complexity 56 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":2341}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed244140a7e16eafe33fa47712d90cef5e9ed60d3afd455cb234e7e919e271b"}},{"ruleId":"D1","level":"warning","message":{"text":"BexHeap::fixup_object_references (cyclomatic 55): BexHeap::fixup_object_references has cyclomatic complexity 55 (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":"baml_language/crates/bex_heap/src/gc.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f47951553a9436c820a2a911ba84f6c690dc1906a8b91b6d34629a92ed143e"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_cpp::translate_ty (cyclomatic 54): sdkgen_cpp::translate_ty 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":"baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs"},"region":{"startLine":1662}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1284e3c95d003def953cf06f4f3a0ab1fd37f1c3618581a1b61b18422de1cfb"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_runtime::internal::prompt_renderer::render_output_format::relevant_data_models (cyclomatic 54): baml_runtime::internal::prompt_renderer::render_output_format::relevant_data_models has cyclomatic complexity 54 (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":"engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48572a7d7fac3c9bbe025ee4a1b9293986f09bb133e4d1356de50955ccf5ead"}},{"ruleId":"D1","level":"warning","message":{"text":"compare._render_md (cyclomatic 54): compare._render_md has cyclomatic complexity 54 (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":"baml_language/tools/speedtest/src/speedtest/compare.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"6616f166aca22032a91ac90ea0a5c2b187953aa32a07b03154f887b6e22bb582"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_python_pydantic2::leaf::render_leaf_body_pyi (cyclomatic 53): sdkgen_python_pydantic2::leaf::render_leaf_body_pyi has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":2653}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f4a0fa225e358841300c39e2a12512933d78d9e613e44fbde729bdbc65685f"}},{"ruleId":"D1","level":"warning","message":{"text":"OptimizeArgs::run (cyclomatic 53): OptimizeArgs::run has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/cli/optimize.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f274652a56090d92bfa2dc46658f5639548085e3532c02e4afcf93d8abfb7018"}},{"ruleId":"D1","level":"warning","message":{"text":"Hir2Diagnostic::to_diagnostic (cyclomatic 52): Hir2Diagnostic::to_diagnostic has cyclomatic complexity 52 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir/src/diagnostic.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ffefbe98f73413d85bbab53409abe090c38418546e7d276c53913fb38e351d"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::sub (cyclomatic 52): InferenceContext::sub has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":4559}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e7be52d376205d2936df366a56f945765f1a3493192b9b2576d4af2ae189b6"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_query_btel::ingest::reconcile (cyclomatic 52): baml_query_btel::ingest::reconcile has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"e722c99cef0fa7df652b86accda4ea29ba952c772db85d9eff6440f059e886b1"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlUnion8._bamlDecode (cyclomatic 52): BamlUnion8._bamlDecode has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (BamlUnion8._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"938e35a6942b4f9ae2b92e7f457c7a1c472d5f64c5141e9cb32589343324ff17"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlUnion8._bamlDecode (cyclomatic 52): BamlUnion8._bamlDecode has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (BamlUnion8._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74ac2b20e49e7efbe3d08bc434de71cfe1d91716d54c17a0e2ec26743cbc4ac"}},{"ruleId":"D1","level":"warning","message":{"text":"tracker.Tracker (cyclomatic 52): tracker.Tracker has cyclomatic complexity 52 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 16 belong to 6 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/tracker.tsx"},"region":{"startLine":2254}}}],"partialFingerprints":{"codehealthFindingId/v1":"080e116715c8ff2f4ffd15f91480c7f67d08fe977557edda928c0fd34e1634fc"}},{"ruleId":"D1","level":"warning","message":{"text":"TelemetryView.OverviewTab (cyclomatic 52): TelemetryView.OverviewTab has cyclomatic complexity 52 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 9 belong to 6 function literals inside it that branch. 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":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"2668d699f4072f10e3b332bec295d89b080a15b8bd6ee621bff0e1c786ad1368"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_db::check::check_file (cyclomatic 51): baml_db::check::check_file has cyclomatic complexity 51 (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. This is NOT this file\u0027s highest cyclomatic complexity: baml_db::check::tir_type_error_to_diagnostic_id (cyclomatic 127) 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":"baml_language/crates/baml_db/src/check.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27ee3d6bacd227b5b7086778c9ef755940558d3083831c4939b48ce05e105fe"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_sap::deserializer::coercer::array_helper::pick_best (cyclomatic 50): bex_sap::deserializer::coercer::array_helper::pick_best has cyclomatic complexity 50 (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":"baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd96420b4377a116ebb83b81df54fe221e54d63948455f547bdec43d3276454c"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphView.GraphViewInner (cyclomatic 50): GraphView.GraphViewInner has cyclomatic complexity 50 (threshold 15). Most of this is not in the body itself: 11 of the 50 points are its own statements and the rest belongs to 14 function literals inside it that branch (lines 483, 283, 397, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/graph/GraphView.tsx"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"67598cff404bcc2a8801640cd817350e00c0bb6fe4012a6bbf6645c060adc5d8"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_hir_ty::package_interface::validate_row_identities (cyclomatic 49): baml_compiler2_hir_ty::package_interface::validate_row_identities has cyclomatic complexity 49 (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":"baml_language/crates/baml_compiler2_hir_ty/src/package_interface.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cb075e68dc6be2c7f8dafe1a0f34caf7b79ebbe26337a06dde0678a850b835"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_cpp::to_source_code_with_optional_metadata (cyclomatic 49): sdkgen_cpp::to_source_code_with_optional_metadata has cyclomatic complexity 49 (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":"baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"1509a13e1eb7f76f360b575337b2b04a1f09ab15491834c8ad53ce4339fc976c"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler::thir::interpret::evaluate_method_call (cyclomatic 49): baml_compiler::thir::interpret::evaluate_method_call has cyclomatic complexity 49 (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":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":2797}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5843dc7359575e00d5896b222535585844cd7075d421ae8eceb92cd821ab1b2"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::temporary_same_state (cyclomatic 49): Expr::temporary_same_state has cyclomatic complexity 49 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-types/src/expr.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c921c6f2a07e4dc1d736cd75662efa8368b71128be7c328d7300e330e20b64f"}},{"ruleId":"D1","level":"warning","message":{"text":"ai-assistant-panel.AIAssistantPanel (cyclomatic 49): ai-assistant-panel.AIAssistantPanel has cyclomatic complexity 49 (threshold 15). Most of this is not in the body itself: 15 of the 49 points are its own statements and the rest belongs to 11 function items inside it that branch (a function literal at line 93, handleQuickAction, a function literal at line 382, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ai-assistant/ai-assistant-panel.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aff85c11005462ddb2cb7ad5242f2a3be2c012925590ec03893e3fbc29f16e0"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_ast::lower_tree::body::expression_in_chain (cyclomatic 48): baml_compiler2_ast::lower_tree::body::expression_in_chain has cyclomatic complexity 48 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f0d83344b9997066180283ea75922e10c9efa3c0d7101b5b31365a6bbad9b9"}},{"ruleId":"D1","level":"warning","message":{"text":"EqualsDriver::compare_objects (cyclomatic 48): EqualsDriver::compare_objects has cyclomatic complexity 48 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/ops.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5666166a38cb27942f55b8eb4a1b1c64d33b30c72fa08dcd4b21601a84c46f4"}},{"ruleId":"D1","level":"warning","message":{"text":"GoTypeProjection::project_inner (cyclomatic 48): GoTypeProjection::project_inner has cyclomatic complexity 48 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/sdkgen_go/src/types.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"c113e1d0f308202322505604385a10fa206af167edb6634945bebaa854935a8d"}},{"ruleId":"D1","level":"warning","message":{"text":"compare.cmd_compare (cyclomatic 48): compare.cmd_compare has cyclomatic complexity 48 (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":"baml_language/tools/speedtest/src/speedtest/compare.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"235a80aac1693c0ab104a6590f075402535e0a3140a0251e61e476724eee8291"}},{"ruleId":"D1","level":"warning","message":{"text":"index.testKitchenSink (cyclomatic 48): index.testKitchenSink has cyclomatic complexity 48 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/mixed_complex_types/typescript/index.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d10dd6f2a3f5a42d578a453da483e2ae50ea3b0dd5e3a5231e98fa926e13eb"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::check_call_args (cyclomatic 47): InferenceContext::check_call_args has cyclomatic complexity 47 (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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":6349}}}],"partialFingerprints":{"codehealthFindingId/v1":"93aea2f0e13db11540239fa48938bf5f6c4b6be4e6b8e9c8980c115073a5b6af"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_emit::stack_carry::simulate_terminator_stack (cyclomatic 46): baml_compiler2_emit::stack_carry::simulate_terminator_stack has cyclomatic complexity 46 (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":"baml_language/crates/baml_compiler2_emit/src/stack_carry.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ab8297926e52ac11bc0d298ffb0b22430ed2eacb5f5c507432a0e4f13c1595"}},{"ruleId":"D1","level":"warning","message":{"text":"Bulk::apply (cyclomatic 46): Bulk::apply has cyclomatic complexity 46 (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":"baml_language/crates/baml_query_btel/src/ingest/bulk.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe3aa1f1eaa75365fb60cb1b56be95decf0d8585907922bf24feef30d0bcafe"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_go::render_functions (cyclomatic 46): sdkgen_go::render_functions has cyclomatic complexity 46 (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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":1960}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdef402498bd593a0a57ee484e3423cf614940dd914d2b29507edb194a5cf178"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlUnion7._bamlDecode (cyclomatic 46): BamlUnion7._bamlDecode has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (BamlUnion7._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b8156feeaf2c2124f7698ae6b9166645b987244398fd0621dd61ba9d905e93"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlUnion7._bamlDecode (cyclomatic 46): BamlUnion7._bamlDecode has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (BamlUnion7._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c521d1a850954db8aab49edb2b7cf2fcc667a4c039d549e34d1d000ccad25ad"}},{"ruleId":"D1","level":"warning","message":{"text":"App.App (cyclomatic 46): App.App has cyclomatic complexity 46 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 24 belong to 9 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-vscode-webview/src/App.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6bcf7f449be45fe638ab83663efb5e000fbf4a4e1794b0c8e4498addb2c02f"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_stmt (cyclomatic 45): LoweringContext::lower_stmt has cyclomatic complexity 45 (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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":11905}}}],"partialFingerprints":{"codehealthFindingId/v1":"6589f7c06a2e79892cb0a7e7cee7b56dd4e6124fb20751ed2880329ccec0fb6a"}},{"ruleId":"D1","level":"warning","message":{"text":"Translator::raw (cyclomatic 45): Translator::raw has cyclomatic complexity 45 (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":"baml_language/crates/baml_query_btel/src/sql.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"c378797a27517b6d196d4d738711c709f7825701ad6b4f6d003caf90f0d4602d"}},{"ruleId":"D1","level":"warning","message":{"text":"Renderer::object (cyclomatic 45): Renderer::object has cyclomatic complexity 45 (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":"baml_language/crates/btel_reader/src/value.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"08608e258cb4b787ac3ee3404d5d1d52b8f71af13290e76a8953569378439920"}},{"ruleId":"D1","level":"warning","message":{"text":"Expression::repr (cyclomatic 45): Expression::repr has cyclomatic complexity 45 (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":"engine/baml-lib/baml-core/src/ir/repr.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"0def544a30f3a7e0906dcd9a18a67e5e5e1020c4d32a23fd06ed18ae29d2af2d"}},{"ruleId":"D1","level":"warning","message":{"text":"run-store-client.createRunStoreClient (cyclomatic 45): run-store-client.createRunStoreClient has cyclomatic complexity 45 (threshold 15). Most of this is not in the body itself: 3 of the 45 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 244, rejectPending). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/run-store-client.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"313cb809b9a151e6512259a0a331d08b99d06918a7dbd3a8466d4daf11776d5b"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_hir_ty::defaults::collect_default_expr_forward_references (cyclomatic 44): baml_compiler2_hir_ty::defaults::collect_default_expr_forward_references has cyclomatic complexity 44 (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":"baml_language/crates/baml_compiler2_hir_ty/src/defaults.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61fbaec0774f91729c8e85d763bd56448a71e92eb3f3a03c87e116151e5f356"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_project::runtime_compile::lower_session_submission (cyclomatic 44): bex_project::runtime_compile::lower_session_submission has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_project/src/runtime_compile.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"25477cc19b2c934879c63196d13ce6439f5ab0c75ad40e0959878ff4f2b11296"}},{"ruleId":"D1","level":"warning","message":{"text":"Blob::logical_bytes_approx_v1 (cyclomatic 44): Blob::logical_bytes_approx_v1 has cyclomatic complexity 44 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 11 belong to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"baml_language/crates/btel_snapshot/src/logical_bytes.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"609c28e0eb5092af9309d55de3057b3e1869dcdccb09fad9acd0a17d27e48487"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_go.decodeReflected (cyclomatic 44): baml_go.decodeReflected has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/dynamic.go"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"98448d03c405285a95d019200289360555d761dda0be24aef0b68749641cb474"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeCli::run (cyclomatic 43): RuntimeCli::run has cyclomatic complexity 43 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/cli/src/commands.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2080859d278846292b6a6e397f62413b922eac035c26d4a2e761ff13f347bd46"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_hir_ty::interfaces::impl_rules::impl_data (cyclomatic 43): baml_compiler2_hir_ty::interfaces::impl_rules::impl_data 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":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"018d6a985b9aa787010ae13708c9f5c853144fafee8c4a21c06f1c7b35c1570d"}},{"ruleId":"D1","level":"warning","message":{"text":"BexVm::execute_call_from_locals_offset (cyclomatic 43): BexVm::execute_call_from_locals_offset 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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":7473}}}],"partialFingerprints":{"codehealthFindingId/v1":"14872f0664f990e6c7cb2b48084792a147207b707fc287e1f4e6e85a452a576e"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm::package_baml::csv::scan_record (cyclomatic 43): bex_vm::package_baml::csv::scan_record 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":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc74c03c17dacdba18adb6986376ccec7f83fcea95d9dd6a5ceeb29a1ca4ffa"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm::package_baml::root::render_to_sink (cyclomatic 43): bex_vm::package_baml::root::render_to_sink 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":"baml_language/crates/bex_vm/src/package_baml/root.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3df73dc5587f52349b7c40d072168baf5e79d7043e6cad155f95cd993a0728"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_python_pydantic2::leaf::render_leaf_body (cyclomatic 43): sdkgen_python_pydantic2::leaf::render_leaf_body has cyclomatic complexity 43 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":1737}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e23e3ddee43c9ec601b5243951292bbd1f0cb971f92a1c9b88f58c5cbb78f5"}},{"ruleId":"D1","level":"warning","message":{"text":"Expression::assert_eq_up_to_span (cyclomatic 43): Expression::assert_eq_up_to_span has cyclomatic complexity 43 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/expression.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92d602ef67a042a6a16a0a3977a366d6db63e669a6b4c02737a9812c071e026"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonParseState::process_token (cyclomatic 43): JsonParseState::process_token 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":"engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c7898ba2018106ecdd1dac94ee05e99985ca9e0d522de9111c62dbd24318d24"}},{"ruleId":"D1","level":"warning","message":{"text":"PropertyHandler::ensure_http_config (cyclomatic 43): PropertyHandler::ensure_http_config 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":"engine/baml-lib/llm-client/src/clients/helpers.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf602118b0666fd9be2e6c838c77ca09c0af15428595f957226e3eb989841613"}},{"ruleId":"D1","level":"warning","message":{"text":"top-level statements (cyclomatic 42): top-level statements has cyclomatic complexity 42 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdk_tests/crates/csharp/generics/Program.cs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0c29132cca3fa423749ce78d7e9a1e35ae049d893541f0c3d41533c319a4a8"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_mir::pretty::write_rvalue (cyclomatic 42): baml_compiler2_mir::pretty::write_rvalue has cyclomatic complexity 42 (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":"baml_language/crates/baml_compiler2_mir/src/pretty.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"2460e61fb2b2f8f972d52ddfa36daea05bd0934cb7e33df40551668d98e5f143"}},{"ruleId":"D1","level":"warning","message":{"text":"TyResolvedRef::coerce (cyclomatic 42): TyResolvedRef::coerce has cyclomatic complexity 42 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_ty.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ef9af57d23536ea4b290f064f789214281349fc29d1bb335df80998301f106"}},{"ruleId":"D1","level":"warning","message":{"text":"OutputFormatContent::render_impl (cyclomatic 42): OutputFormatContent::render_impl has cyclomatic complexity 42 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_ops/src/output_format.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fcf17877c885719352d67a8f2a72caf332016e9807dad1b00a0b520ba7167f"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_typescript_shared::translate_ty::translate_ty (cyclomatic 42): sdkgen_typescript_shared::translate_ty::translate_ty has cyclomatic complexity 42 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/typescript/sdkgen_typescript_shared/src/translate_ty.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b7a3458c244206bbc1ecf0321af944a266ced6197d1505818589297bfa2770"}},{"ruleId":"D1","level":"warning","message":{"text":"Type::is_subtype_of (cyclomatic 42): Type::is_subtype_of has cyclomatic complexity 42 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jinja/src/evaluate_type/types.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f39bce4705e8b7b18e13ba73ae6c48a97b442f8a6e06b3856dc9564d44046f1"}},{"ruleId":"D1","level":"warning","message":{"text":"jsonish::deserializer::coercer::array_helper::pick_best (cyclomatic 42): jsonish::deserializer::coercer::array_helper::pick_best has cyclomatic complexity 42 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/deserializer/coercer/array_helper.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d2cbd7ef7a9ec6f741d69c0f9763dce8144b7e03d107983edc55ae3cd5b4f3"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_pattern_test_with_catch_policy (cyclomatic 41): LoweringContext::lower_pattern_test_with_catch_policy has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":13930}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2f107028d5a468422b3075e61e13a0b6d29052ca67682e4cea65b4865be8e7"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator::rvalue (cyclomatic 41): Generator::rvalue has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_rust/src/codegen/expr.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd7ce0edb3b207e409109028b368d4e4166121fa947391cc631e741267a5837"}},{"ruleId":"D1","level":"warning","message":{"text":"BexHeap::add_references_to_worklist (cyclomatic 41): BexHeap::add_references_to_worklist has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_heap/src/gc.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"b920df48801e5d74b3b7c7768504cd8ff393d82634bacbf3adfd41f4fbae4efa"}},{"ruleId":"D1","level":"warning","message":{"text":"Flag::fmt (cyclomatic 41): Flag::fmt has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fbd7dfa4372546397c5cc15b93bda84897aff9d432ce39b49d425bbc1c2dfe7"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonParseState::process_token (cyclomatic 41): JsonParseState::process_token has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"534f917cbc3f67ece9f152ff5821e98e35b89553e484dd93c24feab71bfb9c9c"}},{"ruleId":"D1","level":"warning","message":{"text":"Expression::from_ast (cyclomatic 41): Expression::from_ast has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/hir/lowering.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fbea8891087e4e7950d8c738861331f9817ef1527206e28f5bb0ba9d498b5a"}},{"ruleId":"D1","level":"warning","message":{"text":"internal_baml_ast::parser::parse_value_expression_block::parse_value_expression_block (cyclomatic 41): internal_baml_ast::parser::parse_value_expression_block::parse_value_expression_block has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/parser/parse_value_expression_block.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8da003c3efd30f773540a6bd80d6dc4b377645d789af9883c237daf228f5ccf"}},{"ruleId":"D1","level":"warning","message":{"text":"HostCallables.swift.restate (cyclomatic 41): HostCallables.swift.restate has cyclomatic complexity 41 (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":"baml_language/sdks/swift/Sources/BamlBridge/HostCallables.swift"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3cfa544442501cd4520d444572d42c6a5a15f5d2d736101d48d4511c4e7732"}},{"ruleId":"D1","level":"warning","message":{"text":"page.ProfilePage (cyclomatic 41): page.ProfilePage has cyclomatic complexity 41 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 12 belong to 5 function items inside it that branch. 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":"typescript2/app-beps/src/app/profile/page.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3f5747a829d17b75618f58470e2fa8396cd8b50566aaf78178b7a5f3fa0895"}},{"ruleId":"D1","level":"warning","message":{"text":"signup-form.SignupForm (cyclomatic 41): signup-form.SignupForm has cyclomatic complexity 41 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 10 belong to 4 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/eap/signup-form.tsx"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bedccaaa89a6b00ab01fffe344efc1adde9be200b9d50b694f2d0ccdbbda9b"}},{"ruleId":"D1","level":"warning","message":{"text":"deployment-status.DeploymentStatus (cyclomatic 41): deployment-status.DeploymentStatus has cyclomatic complexity 41 (threshold 15). Most of this is not in the body itself: 6 of the 41 points are its own statements and the rest belongs to 9 function items inside it that branch (a function literal at line 254, getProviderStatus, getStatusIcon, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/magicui/deployment-status.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e904b6c1d414641529858078d18b5aaaebaf4432d8574ee540c3d82a09f53e0"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeExprKind::fmt (cyclomatic 40): TypeExprKind::fmt has cyclomatic complexity 40 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"baml_language/crates/baml_compiler2_ast/src/ast.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b145052ec044c850ecfe24159c9130a5cba48dd1bcd6745b3d47ba20bb4d4c"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeRefDisplay::fmt (cyclomatic 40): TypeRefDisplay::fmt has cyclomatic complexity 40 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"baml_language/crates/baml_compiler2_hir/src/type_ref.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"545077361d8fe8d5b74f56859412044012720ebe1014c76e8d4d8a4249d62b79"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_mir::pretty::write_terminator (cyclomatic 40): baml_compiler2_mir::pretty::write_terminator has cyclomatic complexity 40 (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":"baml_language/crates/baml_compiler2_mir/src/pretty.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6927980995bbd5357e7fa965f8f8582f7c22ecfaffb20aac8fc542d3111b64"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_visualization::control_flow::from_ast::render_expr_compact_ast (cyclomatic 40): baml_compiler2_visualization::control_flow::from_ast::render_expr_compact_ast has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99af4497be64d3951131e54f6fbcf402abc8890307c274d733386641e4114bf"}},{"ruleId":"D1","level":"warning","message":{"text":"OutputFormatContent::render_type_hoisted (cyclomatic 40): OutputFormatContent::render_type_hoisted has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_ops/src/output_format.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f24fc0deefb945bd32d59704a256bc0c94f0910785d97316d54aa45223aa63"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_rust::analyze::analyze (cyclomatic 40): sdkgen_rust::analyze::analyze has cyclomatic complexity 40 (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":"baml_language/sdks/rust/sdkgen_rust/src/analyze.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1e2690b992bacb355b21f321b3b183f967ac693cc16591034624f2f63a018e"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_rust::wire_ty::wire_ty (cyclomatic 40): sdkgen_rust::wire_ty::wire_ty has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/rust/sdkgen_rust/src/wire_ty.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c17f8f966995521de928140483c814390e9eee104cb869e26c338feee014a4"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler::thir::typecheck::typecheck_statement (cyclomatic 40): baml_compiler::thir::typecheck::typecheck_statement has cyclomatic complexity 40 (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":"engine/baml-compiler/src/thir/typecheck.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0caa8d1b0bf3fe916baabca25820de2a33dfe0c2adf1621574d056f3a6e394"}},{"ruleId":"D1","level":"warning","message":{"text":"parser.parse (cyclomatic 40): parser.parse has cyclomatic complexity 40 (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":"tools/bctl_src/oncall/parser.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd5c35c683c3b493109b4349502a22de803a8f8430873e5a79980814bd1f2f2"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlUnion6._bamlDecode (cyclomatic 40): BamlUnion6._bamlDecode has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (BamlUnion6._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec499c2d6ed9a8e8e906a350b3b72a109a41bd2550f49d9eb457b27ad27ef9df"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlUnion6._bamlDecode (cyclomatic 40): BamlUnion6._bamlDecode has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (BamlUnion6._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa6bafc3d3a019248bcadfd2ed027cceb57857ce7be08571aeafadb24784bfb"}},{"ruleId":"D1","level":"warning","message":{"text":"emit-sublime.emitSublimeSyntax (cyclomatic 40): emit-sublime.emitSublimeSyntax has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 7 of the 40 points are its own statements and the rest belongs to 8 function items inside it that branch (convertRule, convertCaptures, resolveInclude, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar/scripts/emit-sublime.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f9c8b4014f7a57db1bc4033350145426bd80960d0117a3dfec241a17409378"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_path_expr (cyclomatic 39): LoweringContext::lower_path_expr has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":6424}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93de7bc9bdf1876119a038c6192b53a66f75854929c67e9c823804948e59c32"}},{"ruleId":"D1","level":"warning","message":{"text":"HashDriver::drive (cyclomatic 39): HashDriver::drive has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/hashing.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bf15bc255205380c7baaa67533284b7aa6467908dc07c003b7406df65aa033"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm_types::head_walk::visit_object_heads (cyclomatic 39): bex_vm_types::head_walk::visit_object_heads has cyclomatic complexity 39 (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. This shape REPEATS in the file: one other method here (bex_vm_types::head_walk::visit_object_heads_mut) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm_types/src/head_walk.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca346f288886c1153f493f3ddaaaae26ea93bf400ee7db620bf6671b259f6618"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm_types::head_walk::visit_object_heads_mut (cyclomatic 39): bex_vm_types::head_walk::visit_object_heads_mut has cyclomatic complexity 39 (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. This shape REPEATS in the file: one other method here (bex_vm_types::head_walk::visit_object_heads) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm_types/src/head_walk.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d906e961b3a8b0451fa229641ac3ca28c662af9bf7bf012245a1bb525780163"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_python_pydantic2::translate_ty::translate_ty_from (cyclomatic 39): sdkgen_python_pydantic2::translate_ty::translate_ty_from has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/translate_ty.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcceb66f44f52774b108c17441102a74c05f6927957082f812821bc7a2599cfe"}},{"ruleId":"D1","level":"warning","message":{"text":"Class::coerce (cyclomatic 39): Class::coerce has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/deserializer/coercer/ir_ref/coerce_class.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9921039a871e496df36c7fa25aaf6ceb287c573c6d2fa6d8edf13e68a2ec30"}},{"ruleId":"D1","level":"warning","message":{"text":"Flag::fmt (cyclomatic 39): Flag::fmt has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/deserializer/deserialize_flags.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5bf58dea3b051b2d5d76af4b54d76d9ba2b0294b517d3f6c4942d499a41bfe"}},{"ruleId":"D1","level":"warning","message":{"text":"signup.submitSignup (cyclomatic 39): signup.submitSignup has cyclomatic complexity 39 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/actions/signup.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91b4dc8b8a51641e4d522dbf56e77c597751da0de364f22cda10b4b8ba594b3"}},{"ruleId":"D1","level":"warning","message":{"text":"top-level statements (cyclomatic 38): top-level statements has cyclomatic complexity 38 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdk_tests/crates/csharp/stdlib_resources/Program.cs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12f14ea6dae53f0e243d738c30cdbc12c0ab551e6e4e31797aa8b5822e986db"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_emit::pull_semantics::walk_rvalue_pull (cyclomatic 38): baml_compiler2_emit::pull_semantics::walk_rvalue_pull has cyclomatic complexity 38 (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":"baml_language/crates/baml_compiler2_emit/src/pull_semantics.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b062df82fae243316e2123ba209a75f2e8fd80a400f431414476d96ee1e3c2"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_emit::stack_carry::is_stack_carry_use_safe (cyclomatic 38): baml_compiler2_emit::stack_carry::is_stack_carry_use_safe has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/stack_carry.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"775db0be5058153b5b05c0de7001c8206c4c45d080f9a4b9a722fc76e8277bba"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_hir_ty::exhaustiveness::write_ty_identity (cyclomatic 38): baml_compiler2_hir_ty::exhaustiveness::write_ty_identity has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/exhaustiveness.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e577fed2b912b142b923ae0c6e6aa6e45a0fee392e589fa531f72196aff2b66"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_expr (cyclomatic 38): LoweringContext::lower_expr has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":5942}}}],"partialFingerprints":{"codehealthFindingId/v1":"bccdbb9c55a9597df5702c656f5b2315b11e62f90bae4e98fda471a7d8f9406d"}},{"ruleId":"D1","level":"warning","message":{"text":"OutputFormatContent::render (cyclomatic 38): OutputFormatContent::render has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jinja-runtime/src/output_format/types.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9cc3ba67e46f0549b68f0fdf949ddf8e6a3d3a8c2e8e5c5777a1880a517ee1"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlType.toString (cyclomatic 38): BamlType.toString has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlType.java"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3ccba751fb4a80bec5dd0a653e47865471a1f165a18ee44eddeb6f1226ca69"}},{"ruleId":"D1","level":"warning","message":{"text":"index.testComplexNested (cyclomatic 38): index.testComplexNested has cyclomatic complexity 38 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 19 belong to 5 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/nested_structures/typescript/index.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aced80c463e9d257f16ed75a134743a380dfe66256677072434b5e9698310ee"}},{"ruleId":"D1","level":"warning","message":{"text":"bep-nav.BepNav (cyclomatic 38): bep-nav.BepNav has cyclomatic complexity 38 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 21 belong to 4 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-nav.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6970a136653d9ff9459372f163e81aa174f14477bbbc8e521e9a562d085c19"}},{"ruleId":"D1","level":"warning","message":{"text":"WebSocketRuntimePort.fromServer (cyclomatic 38): WebSocketRuntimePort.fromServer has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ports/WebSocketRuntimePort.ts"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe8d42cb1424b3f3c97ac688bde5e960d9a79b8f941837e00ba70a53f72e492"}},{"ruleId":"D1","level":"warning","message":{"text":"walkLibFile (cyclomatic 38): walkLibFile has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/stdlib-matrix/extractors/ts-surface.mjs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"58391ab7a043abe2de58743527afb51dbd163f3a3dc0936434872212d23e7bde"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_mir::optimize::values::fold (cyclomatic 37): baml_compiler2_mir::optimize::values::fold has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/optimize/values.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"16844e8a204704bd17f65a0e0402a43ecd216db9c1e4d22a0ef37a84a962c988"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_visualization::control_flow::from_ast::collect_callee_names_expr (cyclomatic 37): baml_compiler2_visualization::control_flow::from_ast::collect_callee_names_expr has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"d774150453002273eab3f4dc5c007ebb3c6751e67d37f8d976e64799caacb72f"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_parser::expr::infix (cyclomatic 37): baml_parser::expr::infix has cyclomatic complexity 37 (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":"baml_language/crates/baml_parser/src/expr.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bdd2e323ed15353912f88f7bd5175bc85aed642f14b1a630d96dab22db477cd"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_query_btel::functions::register (cyclomatic 37): baml_query_btel::functions::register has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/functions.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d400637eeef27c5c38a93fdc1aa69bb704a0027bdc626f5ff6765e92bac9ca"}},{"ruleId":"D1","level":"warning","message":{"text":"BexEngine::convert_heap_ptr_to_external_with_type (cyclomatic 37): BexEngine::convert_heap_ptr_to_external_with_type has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/conversion.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12bf0c01849f173173e1ab8cb25cecd6ccc369ae1ddcd9d71f645afd9c2bdf3"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonParseState::should_close_unescaped_string (cyclomatic 37): JsonParseState::should_close_unescaped_string has cyclomatic complexity 37 (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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8add314c1603353bb8fd409199e53248b7f520926de9a24e88e496eb739ec5"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_go::names::hash_go_ty (cyclomatic 37): sdkgen_go::names::hash_go_ty has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/sdkgen_go/src/names.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"492cd0ffc6d997e3c5a8ab870fd9dd2eb3ce2dff791870c0b08bb9a4b5fe7813"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonParseState::should_close_unescaped_string (cyclomatic 37): JsonParseState::should_close_unescaped_string has cyclomatic complexity 37 (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":"engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"506776914fcffa6590f8db4ad98b6d527dae53a0aba9e4d228b709909d3dc0fe"}},{"ruleId":"D1","level":"warning","message":{"text":"comment-feed-view.FeedCommentCard (cyclomatic 37): comment-feed-view.FeedCommentCard has cyclomatic complexity 37 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 15 belong to 8 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5ac8784fefd8ff1ff77aaf49460e1b9866d72dfb6ad30520a49cbe58358e2c"}},{"ruleId":"D1","level":"warning","message":{"text":"comment-thread.SingleComment (cyclomatic 37): comment-thread.SingleComment has cyclomatic complexity 37 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 13 belong to 7 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-thread.tsx"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1d325d0da8032c8c3070d06851f1c9eb1afc69961c88f6038373d9995d0ac5"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_ide::symbol_pool::build_symbol_pool (cyclomatic 36): baml_ide::symbol_pool::build_symbol_pool has cyclomatic complexity 36 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/symbol_pool.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceca70989c52e598d86240855ba3409a29f94a993dc50abea95db4723fd1952f"}},{"ruleId":"D1","level":"warning","message":{"text":"Structural::decode (cyclomatic 36): Structural::decode has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/json/decode.rs"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd95768f36964a2e6cf442af1efce29493a4480113d06d012b319515e444481f"}},{"ruleId":"D1","level":"warning","message":{"text":"BexVm::cmpop_values (cyclomatic 36): BexVm::cmpop_values has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":8973}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a5af65cb5cae195c60bf9eac6ee3b2fc88f74b348736789322cba37740ac2d"}},{"ruleId":"D1","level":"warning","message":{"text":"btel_reader::value::ty::level (cyclomatic 36): btel_reader::value::ty::level has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_reader/src/value/ty.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10dc72e72a7899479ff23d4a3463cfc4fca072ce00a03ccacf5d1c83fc65a1f"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_csharp::semantic::generate_program_inner (cyclomatic 36): sdkgen_csharp::semantic::generate_program_inner has cyclomatic complexity 36 (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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"989151f37120a00eaf2d368f828613b9084eb2d48514fd1b920b328b13ab0f90"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_csharp::semantic::encode_type_metadata (cyclomatic 36): sdkgen_csharp::semantic::encode_type_metadata has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":4625}}}],"partialFingerprints":{"codehealthFindingId/v1":"121df073da55e2bb56a3a828e6a94f18a907ee7805ba8ec1ed80569beeabd7d0"}},{"ruleId":"D1","level":"warning","message":{"text":"jsonish::helpers::relevant_data_models (cyclomatic 36): jsonish::helpers::relevant_data_models has cyclomatic complexity 36 (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":"engine/baml-lib/jsonish/src/helpers/mod.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9645b0ace285587090b97fc75575a351f69c155c99cd2422e0343141e576162"}},{"ruleId":"D1","level":"warning","message":{"text":"proto._fill_wire_ty (cyclomatic 36): proto._fill_wire_ty has cyclomatic complexity 36 (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":"baml_language/sdks/python/src/baml_bridge/proto.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e0ed8b3ad05ad4f72527faf1f15763c160579d0b3dfb31dfe0142173200748"}},{"ruleId":"D1","level":"warning","message":{"text":"index.TestingSidebar (cyclomatic 36): index.TestingSidebar has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 10 of the 36 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 109, a function literal at line 205, a function literal at line 265, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/index.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e22b30d976c9b3517d9023c0ac52539dd7aa5d0e8fc197968b4c844ef12a89"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::infer_catch (cyclomatic 35): InferenceContext::infer_catch has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":11412}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e384ca18c5cb867af136868a5115c0562686163c1ec3dfe013e939cebcad429"}},{"ruleId":"D1","level":"warning","message":{"text":"LowerCtx::lower_path (cyclomatic 35): LowerCtx::lower_path has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b554738e1ad0a1ba888fa98c773be66e24ce797089bd4c8a158cd8eab76104f"}},{"ruleId":"D1","level":"warning","message":{"text":"Analysis::new (cyclomatic 35): Analysis::new has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_rust/src/structure.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d69e71c66350c90ee72efed34958beba988dcb64912aa98e6c09b3ac17327dc"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm::package_baml::root::deep_copy_value_recursive (cyclomatic 35): bex_vm::package_baml::root::deep_copy_value_recursive has cyclomatic complexity 35 (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":"baml_language/crates/bex_vm/src/package_baml/root.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"754850e3f013267a8742cae53573b11cbe00155c88d489ff11ce120b7cec4128"}},{"ruleId":"D1","level":"warning","message":{"text":"bridge_ctypes::ty_encode::variant (cyclomatic 35): bridge_ctypes::ty_encode::variant has cyclomatic complexity 35 (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":"baml_language/crates/bridge_ctypes/src/ty_encode.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a257b965b0791210ade85e181cb261211aff9913360f40cbc86caa65e8b9ca"}},{"ruleId":"D1","level":"warning","message":{"text":"btel_file::reader::validate_file (cyclomatic 35): btel_file::reader::validate_file has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_file/src/reader.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fd0cd8f2eddcb6e7f66450b6452bb52845c02cddde29f9a4a925d02af1ade4"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_runtime::internal::llm_client::orchestrator::stream::orchestrate_stream (cyclomatic 35): baml_runtime::internal::llm_client::orchestrator::stream::orchestrate_stream has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/orchestrator/stream.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ae999fbee178a8593840efb687ad1155816e79b0784b1edad4a6aafbfa51fa"}},{"ruleId":"D1","level":"warning","message":{"text":"boundary_udf::yaml2jinja::rebuild_from_flattened (cyclomatic 35): boundary_udf::yaml2jinja::rebuild_from_flattened has cyclomatic complexity 35 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"engine/boundary-udf/src/yaml2jinja.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3477f8f8707817f20574af7243bdb7e164f1e57bda5c8821328a965157a1a5f"}},{"ruleId":"D1","level":"warning","message":{"text":"Decode.swift.forEachHead::visit (cyclomatic 35): Decode.swift.forEachHead::visit has cyclomatic complexity 35 (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":"baml_language/sdks/swift/Sources/BamlBridge/Decode.swift"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"88db567ab7274a4cf65fa264ccdf88f078b42c6b7ec96d92c65123830777067b"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringDiagnostic::to_diagnostic (cyclomatic 34): LoweringDiagnostic::to_diagnostic has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/lowering_diagnostic.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d812ba3abd00cbeb189e031974d7a0cf87026e18a47b6fda335a857b08d9c7e"}},{"ruleId":"D1","level":"warning","message":{"text":"Walk::word (cyclomatic 34): Walk::word has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/tokens.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07e8d870c86d2684efefc49b112b80607e01b877481309dd8d8283823ef470b"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_ide::resolve::member_position_at (cyclomatic 34): baml_ide::resolve::member_position_at has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/resolve.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7448f32febe027e3ee7dab1ffc011c60c5f754535285cc7080c079450f4656"}},{"ruleId":"D1","level":"warning","message":{"text":"NormalTy::from_interned (cyclomatic 34): NormalTy::from_interned has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/normalize.rs"},"region":{"startLine":3057}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcca08fd72fdab839f48a6057d1c0316814eb16baf4d7495c52490c9cd60ae5"}},{"ruleId":"D1","level":"warning","message":{"text":"BexVm::unwind_exception_frames (cyclomatic 34): BexVm::unwind_exception_frames has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":6733}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd19257010f151400f62563aa98f414133ca081f00ae9243ae29480c65db62c"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm::package_baml::csv::parse_reader_options (cyclomatic 34): bex_vm::package_baml::csv::parse_reader_options has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"8472781d05613a77990aa2ac71c7cbf077376abce650631bf021e6546d88dfd1"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm::package_baml::sap::empty_value (cyclomatic 34): bex_vm::package_baml::sap::empty_value has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/sap.rs"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f63323cbc6f8a96680e34c8e3991198f2990dc92d6d303e0c46683eb8622ea"}},{"ruleId":"D1","level":"warning","message":{"text":"btel_snapshot::host::add (cyclomatic 34): btel_snapshot::host::add has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_snapshot/src/host.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17bfc25264a8d8a91a3f312f736fdb3f147d4589209c8c40001753e6abf4749"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_java::to_source_code_internal (cyclomatic 34): sdkgen_java::to_source_code_internal has cyclomatic complexity 34 (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":"baml_language/sdks/java/sdkgen_java/src/lib.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fc2d2e3c79200713ea96896515a5d6633b023929f3f2912fa96dc33c53d3c3"}},{"ruleId":"D1","level":"warning","message":{"text":"internal_baml_core::ir::ir_helpers::get_dummy_value (cyclomatic 34): internal_baml_core::ir::ir_helpers::get_dummy_value has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d702ebd4c67e4ab8c70b2ac95290cba562508da849ecf333c5383eeb22c3b32"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_derive::derive_baml_hash (cyclomatic 34): baml_derive::derive_baml_hash has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-derive/src/lib.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4afa912b47e2bbe8678908b1207b285bb9b0c19f48117661f0fab016fb575b2"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_go.validateJSONSelectedPayload (cyclomatic 34): baml_go.validateJSONSelectedPayload has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/json.go"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b8e7bd7d24763a2ab6d60b804fb471902ea198be351e333eba60e77e1a0fc7"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlUnion5._bamlDecode (cyclomatic 34): BamlUnion5._bamlDecode has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (BamlUnion5._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2616af39f0fac813a4b0e490e9bf9540948bda67ec3165ac737cea8a977213"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlUnion5._bamlDecode (cyclomatic 34): BamlUnion5._bamlDecode has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (BamlUnion5._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f27bb78230ec98f1cd8396bb77369c5f9d32ad32a5fbd9bcaf6f2182c647e2"}},{"ruleId":"D1","level":"warning","message":{"text":"index.testSimpleNested (cyclomatic 34): index.testSimpleNested has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/nested_structures/typescript/index.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3007b92d946682c171ea7ff9302ddea3b62431829aee3f2fb70863e600905c"}},{"ruleId":"D1","level":"warning","message":{"text":"http.createRequestHandler.\u003Creturned closure\u003E (cyclomatic 34): http.createRequestHandler.\u003Creturned closure\u003E has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/http.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09bf1ec0f9fbadadc05af368379d43b7d9c9154b0e1853528eee6eb52589419"}},{"ruleId":"D1","level":"warning","message":{"text":"TelemetryView.ContextInspector (cyclomatic 34): TelemetryView.ContextInspector has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":3192}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9101b4cd4172d84fecf3fb643ee3e350267b408b1df75676371b2ce7c3765b8"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_emit::analysis::collect_uses_in_terminator (cyclomatic 33): baml_compiler2_emit::analysis::collect_uses_in_terminator has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/analysis.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"019ab3c7e8494d1a7a9fa54dcf53e5dbc25fbe483694b150472033e98e5c0463"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::member_callee (cyclomatic 33): InferenceContext::member_callee has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":6945}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff2e95c61a1c846958bc4d7bfe56c6ed37a037038a19bffaf942990e7bebf31"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_hir_ty::infer::trace_hooks::checked_declaration (cyclomatic 33): baml_compiler2_hir_ty::infer::trace_hooks::checked_declaration has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer/trace_hooks.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"70793a7112e3ca9450c9aceab6fecad1686cb27592e0b6ddd8f59bd7cc4ce058"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_mir::optimize::eliminate_dead_locals (cyclomatic 33): baml_compiler2_mir::optimize::eliminate_dead_locals has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/optimize.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13912cfa732e79c8ccc775ecab71fd5e28a8e541475c95b9b0eae05fba95743"}},{"ruleId":"D1","level":"warning","message":{"text":"Applier::apply (cyclomatic 33): Applier::apply has cyclomatic complexity 33 (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":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"38946d5b388c49de06a8f23d01b890e0b1af4b96e39c2b80bd5d5051a4ca2ae9"}},{"ruleId":"D1","level":"warning","message":{"text":"NormalTy::from_ty (cyclomatic 33): NormalTy::from_ty has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/normalize.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"7762d4f0bfc0760f292f0689f415e25b0fc07fe184ea83247ee297be657161d9"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_sap::jsonish::parser::entry::parse_func (cyclomatic 33): bex_sap::jsonish::parser::entry::parse_func has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/entry.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fd8f54987cc555577cc98dd34eb5d4013f62b879cc88c62ec083a3f560705a"}},{"ruleId":"D1","level":"warning","message":{"text":"BexVm::set_entry_point_with_type_args (cyclomatic 33): BexVm::set_entry_point_with_type_args has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":5114}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26063f83277259e9966f141b0f3d734c9bc1967bdba7788c16c326da9da45ae"}},{"ruleId":"D1","level":"warning","message":{"text":"btel_bcs::delivery::run_worker (cyclomatic 33): btel_bcs::delivery::run_worker has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_bcs/src/delivery.rs"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1732731b7a72438b4f2db174ccd2cb9e6e437e0231e6b977258b8658016d3d"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_rust::emit::class::fields_struct (cyclomatic 33): sdkgen_rust::emit::class::fields_struct has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/rust/sdkgen_rust/src/emit/class.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfaef38bc8cda375ddc0967070453306d1d4ccdc6f46ba2521b34e5219fe4d5"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionMetadata::analyze_statement (cyclomatic 33): FunctionMetadata::analyze_statement has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/watch.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e46516317ac37e33acfe83f6b65388b48bc324b30ea286236fb5747530b9f1"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler::hir::lowering::lower_stmt_with_options (cyclomatic 33): baml_compiler::hir::lowering::lower_stmt_with_options has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/hir/lowering.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"595a8683ba1de7082da3022f7dac531cee0d6324bb079be2dcd367e2e91b2663"}},{"ruleId":"D1","level":"warning","message":{"text":"generators_rust::ir_to_rust::stream_type_to_rust (cyclomatic 33): generators_rust::ir_to_rust::stream_type_to_rust has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/rust/src/ir_to_rust/mod.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbb32d0ce61ad827266b306e7f67e58ea2a2d53c932da2356dab150a810af96"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_go.encodeAny (cyclomatic 33): baml_go.encodeAny has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/dynamic.go"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73cca280a938c3bbbeee89e4d2cc36d671307532c57685362e7f22508584f1f"}},{"ruleId":"D1","level":"warning","message":{"text":"BAMLSDK.parseWatchValue (cyclomatic 33): BAMLSDK.parseWatchValue has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/sdk.ts"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a47c7f86138012b8a2eb54aa22e17b9a562d8b2327f9256d798a4f7fd9b61b0"}},{"ruleId":"D1","level":"warning","message":{"text":"LiveHeads.Map (cyclomatic 32): LiveHeads.Map has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Proto/LiveHeads.cs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a582366974b01fb687f31d11caadceb69a8b54d3425b0acafad0bae17b6dc8c5"}},{"ruleId":"D1","level":"warning","message":{"text":"StackifyCodegen::emit_terminator (cyclomatic 32): StackifyCodegen::emit_terminator 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. This is NOT this file\u0027s highest cyclomatic complexity: StackifyCodegen::try_specialize_binary_op (cyclomatic 41) 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":"baml_language/crates/baml_compiler2_emit/src/emit.rs"},"region":{"startLine":2393}}}],"partialFingerprints":{"codehealthFindingId/v1":"6563d57f35eeae26b41af5581f76bfb546fbe8c5293f6a27b691556fcf6050e4"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticIndexBuilder::walk_expr_children (cyclomatic 32): SemanticIndexBuilder::walk_expr_children has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir/src/builder.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8aa15e3ee378b48b0be1a5922aec175b2a8ee273de296c67b83e75975e0dc1d"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::infer_stmt (cyclomatic 32): InferenceContext::infer_stmt has cyclomatic complexity 32 (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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":3458}}}],"partialFingerprints":{"codehealthFindingId/v1":"7758d1d0d7de4703ada19dd14655a5b26a42aafc65046507da4fe50d6da4bcd1"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::infer_lambda (cyclomatic 32): InferenceContext::infer_lambda 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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":8793}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5ddb59fc80509a81a0ec1b5465f072ac6bdf1a0b0537ff8265d47bda04f408"}},{"ruleId":"D1","level":"warning","message":{"text":"NormalTy::is_subtype_of_inner (cyclomatic 32): NormalTy::is_subtype_of_inner has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/normalize.rs"},"region":{"startLine":1963}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f48ae19148decf9e7320b74af199d58990e5edff5b14239e75dedbe17fb9795"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeCtx::convert_ty (cyclomatic 32): TypeCtx::convert_ty has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/sap_model/convert.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"4081b324ab6ab729ddc1d8f8ec415abd70d2874e99a0de81d9a1d23827fcc3d0"}},{"ruleId":"D1","level":"warning","message":{"text":"TelemetryState::complete_invocation_at (cyclomatic 32): TelemetryState::complete_invocation_at has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/telemetry.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e6d5fbde213d3f04d4ef987f0501e07cd335c3487ef288d22c88fd978a0853"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_csharp::semantic::require_supported_type_inner (cyclomatic 32): sdkgen_csharp::semantic::require_supported_type_inner has cyclomatic complexity 32 (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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":1885}}}],"partialFingerprints":{"codehealthFindingId/v1":"32723bf9d33436cd3a83191b31f4ca250001b5e01e982cce9a6eab7daf17ded8"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_swift::emit::render_callable (cyclomatic 32): sdkgen_swift::emit::render_callable has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/rust/sdkgen_swift/src/emit.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba9343c410c3eeb30c995f80ea487be154588f89b03581b2017e0c1bbf83437"}},{"ruleId":"D1","level":"warning","message":{"text":"generators_go::ir_to_go::stream_type_to_go (cyclomatic 32): generators_go::ir_to_go::stream_type_to_go has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/go/src/ir_to_go/mod.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8936552ed3f47d7e05482602a369143b22fc11455ed7a553d3f8d28115d34d84"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_go.encodeJSON (cyclomatic 32): baml_go.encodeJSON 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":"baml_language/sdks/go/baml_go/json.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0dd5f57d111e6e01b2d1be2b7927aea62750a9e2ba304bcc612ca297723c5c"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_go.outboundToInbound (cyclomatic 32): baml_go.outboundToInbound 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":"baml_language/sdks/go/baml_go/thrown.go"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"98aac3c69b8d9eb7935ac4d32ad125a9f00f22b8ad8d17c49cf7cd4270c7db4b"}},{"ruleId":"D1","level":"warning","message":{"text":"index.testLargeStructure (cyclomatic 32): index.testLargeStructure has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/edge_cases/typescript/index.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b63ad1eb5d88ed5ece48600859022766b6f82bceba3453e15946a95bd0711f"}},{"ruleId":"D1","level":"warning","message":{"text":"top-level statements (cyclomatic 31): top-level statements has cyclomatic complexity 31 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdk_tests/crates/csharp/streaming/Program.cs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf57f9fca46f0e331415d3a97ad90888223fe052b576f26a9539cb8e9b012731"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::resolve_value_path (cyclomatic 31): InferenceContext::resolve_value_path 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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":7459}}}],"partialFingerprints":{"codehealthFindingId/v1":"0470959109320077fe3f7245b06c075a55d0567c9a1da0abd95a6f1e0f1e24f0"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_db::check::check_interfaces (cyclomatic 31): baml_db::check::check_interfaces has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: baml_db::check::tir_type_error_to_diagnostic_id (cyclomatic 127) 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":"baml_language/crates/baml_db/src/check.rs"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"7941328d93cd1d0da1f27f891caec5dc3f7bebfbaa17b454becffa9b3970e509"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_ide::annotations::process_body (cyclomatic 31): baml_ide::annotations::process_body 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":"baml_language/crates/baml_ide/src/annotations.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecc5e890c2f5864897051d6590d9123955192989554a0441c8af6d1a273354f"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_heap::accessor::convert_object (cyclomatic 31): bex_heap::accessor::convert_object has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_heap/src/accessor.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"316ab6a27e3cc5139ae3a8a16e4f054857301b7782a0bbbe11b5c841cf01b08f"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::visit (cyclomatic 31): Walker::visit has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/json/encode.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"5286f6839e5d10b840cd88b2e6325515f09453d95d23e4c9292067d8f970ea5d"}},{"ruleId":"D1","level":"warning","message":{"text":"cargo_stow::main (cyclomatic 31): cargo_stow::main 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":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":2577}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ab059bc99063db32b09ba35043d5dfda3e76b393786f25de5b11d47133d1a9"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_swift::translate_ty::translate_ty (cyclomatic 31): sdkgen_swift::translate_ty::translate_ty has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/rust/sdkgen_swift/src/translate_ty.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"0152f2e6defa3c8d823d45c24ca384cb173f19668e344e7f91311b10525b353c"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeContext::infer_type (cyclomatic 31): TypeContext::infer_type has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/thir/typecheck.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eeee9153ba6fc02368a471cd0cfac87b95a94297b31a595c0818abb760ae6e5"}},{"ruleId":"D1","level":"warning","message":{"text":"internal_baml_jinja::render_minijinja (cyclomatic 31): internal_baml_jinja::render_minijinja 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":"engine/baml-lib/jinja-runtime/src/lib.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd444859234f7825dc4d666c9e311003b011378d70754a39ed02f586264cb1e"}},{"ruleId":"D1","level":"warning","message":{"text":"jsonish::jsonish::parser::entry::parse_func (cyclomatic 31): jsonish::jsonish::parser::entry::parse_func has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/jsonish/parser/entry.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6c845abad54984a8b0c22b13dd68ea00ff6ee8c7130d6c4ba39517db2be362"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_vm::native::deep_equals_recursive (cyclomatic 31): baml_vm::native::deep_equals_recursive has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-vm/src/native.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f2b7f0bb1b8e3d2b3fd19c80683d6c5205b7a0257209ef6303c2f8a3996f11"}},{"ruleId":"D1","level":"warning","message":{"text":"runner.cmd_run (cyclomatic 31): runner.cmd_run 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":"baml_language/tools/speedtest/src/speedtest/runner.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94099eb242ece18fee87ad35a320ef47a49c79d6f1e10e10ba2a3fd3e54613b"}},{"ruleId":"D1","level":"warning","message":{"text":"serde.convertFieldTypeToGoType (cyclomatic 31): serde.convertFieldTypeToGoType 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":"engine/language_client_go/baml_go/serde/decode.go"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b16ce2b89d7ca3d8eb34bb7c0c0bc151d9fa7a7aa66bbcbe7d094302dce455"}},{"ruleId":"D1","level":"warning","message":{"text":"kpis.html.chart (cyclomatic 31): kpis.html.chart has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 13 of the 31 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 139, a function literal at line 136, a function literal at line 137, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/src/speedtest/templates/kpis.html"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"1814eb2c004d599a50a2e4fd5a5561adb3ed96d95321173dedc39f609acb4835"}},{"ruleId":"D1","level":"warning","message":{"text":"function-item.FunctionItem (cyclomatic 31): function-item.FunctionItem has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 11 of the 31 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 36, handleClick). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/function-item.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a476205d2f3c74795fb5e15eb4fe88212aa3a1d07027e163aad1584efa786bb"}},{"ruleId":"D1","level":"warning","message":{"text":"chart.ChartTooltipContent (cyclomatic 31): chart.ChartTooltipContent has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 5 of the 31 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 182, 131). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/chart.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"500d520f6e0ce2460781893fdb0424e527bd38fc5f15c9f58122d41b8f54ecf5"}},{"ruleId":"D1","level":"warning","message":{"text":"Workbench.Workbench (cyclomatic 31): Workbench.Workbench has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 12 of the 31 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 58, 226, 107, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_components/Workbench.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37eea021415e063226a668d879ba04712ceff249e9507feb169fea4d24aa871"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_cli::describe_command::write_description (cyclomatic 30): baml_cli::describe_command::write_description has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/describe_command.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fc4364b29b7520012c517f6329ffd3ce3167e5bc0050ffa47c07f6d01d3ba8"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::infer_callee (cyclomatic 30): InferenceContext::infer_callee has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":6684}}}],"partialFingerprints":{"codehealthFindingId/v1":"8015b5dc05777feb518503412c3b67f9887f1f96fdfc2b3fb87e1ca1f17c5198"}},{"ruleId":"D1","level":"warning","message":{"text":"LowerCtx::lower_type_ref_inner (cyclomatic 30): LowerCtx::lower_type_ref_inner 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":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd358a8a75d66957e9ba410b8988cc3b9ed175c973e01cac1aa3eaec7ee076db"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_hir_ty::impls::hash_eligible_within_depth::visit (cyclomatic 30): baml_compiler2_hir_ty::impls::hash_eligible_within_depth::visit has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/impls.rs"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea946ae214041d3d6e00b82db859e22a4f742e0e50640b6e88d5be728a297a5f"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_parser::items::unattributed_item (cyclomatic 30): baml_parser::items::unattributed_item has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":2356}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7100ba72446923af6f3307855686a4f8fd42e5316120ccbe2cf767ac1056d95"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_type_runtime::collect (cyclomatic 30): baml_type_runtime::collect has cyclomatic complexity 30 (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":"baml_language/crates/baml_type_runtime/src/lib.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"9525eb2f82b1ef9df4a9e5ede2665189560e8acc9646b603da6f5249ec9f3062"}},{"ruleId":"D1","level":"warning","message":{"text":"TraceSnapshotBuilder::copy_object (cyclomatic 30): TraceSnapshotBuilder::copy_object has cyclomatic complexity 30 (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":"baml_language/crates/bex_engine/src/trace_heap.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"641be55a7e31b64f00297d873f47a284aabce250a0d82a6fb7ab099559753dba"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassTy::coerce (cyclomatic 30): ClassTy::coerce has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_class.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bee9907862ece40a0fe62bed430ee8bcdcedebed21d6fd4de9605468200aa72"}},{"ruleId":"D1","level":"warning","message":{"text":"TelemetryState::enter_bytecode_with_trace (cyclomatic 30): TelemetryState::enter_bytecode_with_trace has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/telemetry.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"102219c39f916c7ca16f4dad8d207a872440c80309671fd5f68ada8c6f95c439"}},{"ruleId":"D1","level":"warning","message":{"text":"btel_file::reader::check_references (cyclomatic 30): btel_file::reader::check_references has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_file/src/reader.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"3880d053401c3b27bfbc8ea0124e301ae629057fdf92e038bf2d854a1551720d"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_csharp::semantic::render_program (cyclomatic 30): sdkgen_csharp::semantic::render_program has cyclomatic complexity 30 (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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":3412}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91d79d10ab042a49a4fc6cbade7a8166f51eec9498d0a96f4dcc7dacef49591"}},{"ruleId":"D1","level":"warning","message":{"text":"internal_baml_ast::parser::parse_expression::parse_expression (cyclomatic 30): internal_baml_ast::parser::parse_expression::parse_expression 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":"engine/baml-lib/ast/src/parser/parse_expression.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec8a5a28795d605b257debccb441a963bd260b5a26fbcb28c611dfd74219296"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlValueWithMeta::is_type (cyclomatic 30): BamlValueWithMeta::is_type 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. This shape REPEATS in the file: 2 other methods here (BamlValueWithMeta::is_type, BamlValueWithMeta::is_type) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-types/src/baml_value.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05872ab9df90147a4f4eaa9bb34f93aa69c30276bd9db161739fafb900c7fb5"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlValueWithMeta::is_type (cyclomatic 30): BamlValueWithMeta::is_type 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. This shape REPEATS in the file: 2 other methods here (BamlValueWithMeta::is_type, BamlValueWithMeta::is_type) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-types/src/baml_value.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"8451ec52f2cdf7d118caf74bb78ad00099ed2305ab224ecda0ce666f85b93286"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlValueWithMeta::is_type (cyclomatic 30): BamlValueWithMeta::is_type 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. This shape REPEATS in the file: 2 other methods here (BamlValueWithMeta::is_type, BamlValueWithMeta::is_type) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-types/src/baml_value.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00debc5ada2983bc0a5ab0d4668a40d10e524e13190330652a13c3fa5e966f2"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_runtime::tracingv2::storage::storage::build_function_log (cyclomatic 30): baml_runtime::tracingv2::storage::storage::build_function_log 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":"engine/baml-runtime/src/tracingv2/storage/storage.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e335ddba4e4b9541023a91fd8b769ff228e127207395774d1413b36948e8259"}},{"ruleId":"D1","level":"warning","message":{"text":"audit-site.main (cyclomatic 30): audit-site.main has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/scripts/audit-site.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"363860bf525ce18b903d0c6202e44ca30517f3e619c6ca90c91b5382a57b2f5f"}},{"ruleId":"D1","level":"warning","message":{"text":"annotation-svg.renderAnnotatedSnippet (cyclomatic 30): annotation-svg.renderAnnotatedSnippet has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 11 of the 30 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 94, a function literal at line 167, pos, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/snippets/annotation-svg.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"7688ee28f49fc70a32202a0cf5e32453b5a69554ecdc913609964739c6b41be0"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::lower_array_pattern (cyclomatic 29): InferenceContext::lower_array_pattern has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b8cc53d9c8e0adce3bd3deabd34cc0960ecf76fa61514c6a3d2f67abc466d2"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_parser::expr::primary (cyclomatic 29): baml_parser::expr::primary has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_parser/src/expr.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"995c553a371f0440371bcbff853629d2fdf3ed9c8fd3c6f0ad910460fe83d025"}},{"ruleId":"D1","level":"warning","message":{"text":"Renderer::structural (cyclomatic 29): Renderer::structural has cyclomatic complexity 29 (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":"baml_language/crates/baml_type/src/normalize/mu.rs"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fb43436d1cb340d72db9da52a6acb2ede2ed8b8de3c89415a0ab79e9873e98"}},{"ruleId":"D1","level":"warning","message":{"text":"Hydrator::value (cyclomatic 29): Hydrator::value has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/hydrate.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa05a6a8e3753c517b37d6a104b9733870bd9c9aea37b0e49d80466f50dffa2"}},{"ruleId":"D1","level":"warning","message":{"text":"BexEngine::projected_surface (cyclomatic 29): BexEngine::projected_surface has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":7113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ff3a50198c8c990df76bb73ae9e9341aeb5b00cc9656dadf6fffc5262f251d"}},{"ruleId":"D1","level":"warning","message":{"text":"Scratch::capture (cyclomatic 29): Scratch::capture has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/telemetry/snapshot.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb70fde5c49687fdbb38d9cc296895866f698d13416d395a5505e181e574ad2"}},{"ruleId":"D1","level":"warning","message":{"text":"sys_ops::output_format::walk_ty (cyclomatic 29): sys_ops::output_format::walk_ty has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_ops/src/output_format.rs"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d352bcb854aef1edb17014d974c6ef3a316f2a4e9cf83f4b7ee75b16ef116b"}},{"ruleId":"D1","level":"warning","message":{"text":"internal_baml_ast::parser::parse::parse (cyclomatic 29): internal_baml_ast::parser::parse::parse has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/parser/parse.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"343f1283b2e2f71692abcc3615c6326f771278d63406cd6be35e1669d060aec9"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_types::ir_type::converters::streaming::from_type_ir::partialize_helper (cyclomatic 29): baml_types::ir_type::converters::streaming::from_type_ir::partialize_helper has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-types/src/ir_type/converters/streaming.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f147a735534d9551d81d8b9a68b4ba1ce49fd48efd9937d805957aa5526cfd"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_runtime::internal::llm_client::traits::process_media (cyclomatic 29): baml_runtime::internal::llm_client::traits::process_media has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/traits/mod.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c951f94fafb33ee4962192dbc800f2148c0a36b6c88cbcb8e20d8bd80416153"}},{"ruleId":"D1","level":"warning","message":{"text":"index.testRecursiveComplexity (cyclomatic 29): index.testRecursiveComplexity has cyclomatic complexity 29 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. 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":"engine/generators/data/mixed_complex_types/typescript/index.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0f36193366b83b020678a7fd22791f18dd3de9b1992695f3d1a91312d97ca2"}},{"ruleId":"D1","level":"warning","message":{"text":"comment-feed-view.FeedThreadCard (cyclomatic 29): comment-feed-view.FeedThreadCard has cyclomatic complexity 29 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 11 belong to 5 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e28cbcd38bea6d93ceebf781fb5da431df83c9b154e3d682ff751c6307d336"}},{"ruleId":"D1","level":"warning","message":{"text":"tracker.runnerPose (cyclomatic 29): tracker.runnerPose has cyclomatic complexity 29 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/tracker.tsx"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a693361b653f5b417059ff07d4d15871bf02fef52b6f22f5688fa55aab75fe2"}},{"ruleId":"D1","level":"warning","message":{"text":"scene-player.ScenePlayer (cyclomatic 29): scene-player.ScenePlayer has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 14 of the 29 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 41, a function literal at line 81, go, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/scene-player.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"60500f85b673a4698ed54b64f0599fe8d5f61b8b262a898e13fcdd0832273b97"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionSidebar.TestTreeNode (cyclomatic 29): FunctionSidebar.TestTreeNode has cyclomatic complexity 29 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. 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":"typescript2/pkg-playground/src/FunctionSidebar.tsx"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7f263d22316bb190143bc8d46d638c662cafcd4e1569864f35e03df2b8cb2a"}},{"ruleId":"D1","level":"warning","message":{"text":"top-level statements (cyclomatic 28): top-level statements has cyclomatic complexity 28 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 5 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdk_tests/crates/csharp/host_callables/Program.cs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7baa4c9646f4961d4815d485227effcb91a4d970170bdf15c7d3e83b7ceeeaee"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_builtins2_codegen::codegen::receiver_input_type_with_vm_usage (cyclomatic 28): baml_builtins2_codegen::codegen::receiver_input_type_with_vm_usage has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_builtins2_codegen/src/codegen.rs"},"region":{"startLine":2235}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc03251a010ab9f2702449968ea432307ca3a46e9ba40d5ef64525baed65288e"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_ide::completion::context::classify (cyclomatic 28): baml_ide::completion::context::classify has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/completion/context.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1ce35258b77907db4712384bec01c5aa563d94b2c803b09d0ab39dddbdb0f6"}},{"ruleId":"D1","level":"warning","message":{"text":"IngressScheduler::admit_message_with_policy (cyclomatic 28): IngressScheduler::admit_message_with_policy has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/lsp_ingress.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aed19e03ea742a1aef4e5203ad375b5eef51c6d17bf8c495865fbb1d2a64658"}},{"ruleId":"D1","level":"warning","message":{"text":"BexVm::value_concrete_ty (cyclomatic 28): BexVm::value_concrete_ty has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: bex_vm::vm::value_type_tag (cyclomatic 30) 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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":4441}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbf470093f4b01e0cd205d17eb6fd2c3841979f09e3c7a64f24ccdd536e2191"}},{"ruleId":"D1","level":"warning","message":{"text":"Solution::learn (cyclomatic 28): Solution::learn has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_encode/src/plan.rs"},"region":{"startLine":1344}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff80098ae8aa6ca020a055beda1f18a1450a7bdb9ce4b4800220c71965907dd1"}},{"ruleId":"D1","level":"warning","message":{"text":"internal_baml_ast::parser::parse_type_expression_block::parse_type_expression_block (cyclomatic 28): internal_baml_ast::parser::parse_type_expression_block::parse_type_expression_block has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/parser/parse_type_expression_block.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f08b123ece560a82b6812e24b2728ea271075034dc20aebf96ece155816985"}},{"ruleId":"D1","level":"warning","message":{"text":"internal_baml_jinja_types::evaluate_type::stmt::track_walk (cyclomatic 28): internal_baml_jinja_types::evaluate_type::stmt::track_walk has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jinja/src/evaluate_type/stmt.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2209f4432401e9d9f181975b9a0e8a3cc6b37957ed3b4f06931e68b6099ed59"}},{"ruleId":"D1","level":"warning","message":{"text":"ProtoReader.armMatchesValue (cyclomatic 28): ProtoReader.armMatchesValue has cyclomatic complexity 28 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd03cb22511eb26d4bf36a947950d4cd11dd9f2f4e3a8b9e3b8b6857fae03db1"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_go.decodeJSON (cyclomatic 28): baml_go.decodeJSON has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/json.go"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f16e9e45ede49528dc35cd59e375f636cc42e2de0be58429a8cfc3bad85337c"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlUnion4._bamlDecode (cyclomatic 28): BamlUnion4._bamlDecode has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (BamlUnion4._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f15ddf40648d77d962e31d28acb7466259d231311c664b238958be98d7fcbd6"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlUnion4._bamlDecode (cyclomatic 28): BamlUnion4._bamlDecode has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (BamlUnion4._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db08afbeab1a1dec40fc42516c74a54c85c4a9abf1369d279085390a0f88a4e"}},{"ruleId":"D1","level":"warning","message":{"text":"issue-card.IssueCard (cyclomatic 28): issue-card.IssueCard has cyclomatic complexity 28 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 10 belong to 6 function items inside it that branch. 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":"typescript2/app-beps/src/components/issues/issue-card.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4211cf322a78ea6a8dcd17da98445c2382351d5aff8334034b2f91619cbb0ba"}},{"ruleId":"D1","level":"warning","message":{"text":"tracker.BamlBar (cyclomatic 28): tracker.BamlBar has cyclomatic complexity 28 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 10 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/tracker.tsx"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc39a795e045bfe30b9f2b6c105abed019e45396ea846fb21a2146b7b2030d5"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_builtins2_codegen::extract::type_expr_to_baml_type (cyclomatic 27): baml_builtins2_codegen::extract::type_expr_to_baml_type has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_builtins2_codegen/src/extract.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4d1861789966fd75548295f2a57de6a46739221eda4507fca1cc03afb82967"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::attempt (cyclomatic 27): InferenceContext::attempt has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer/obligations.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82eb825f6594bb986c76609d0663d99357f6d5581ec3f24ef97a613825bc27c"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::lower_interface_pattern (cyclomatic 27): InferenceContext::lower_interface_pattern has cyclomatic complexity 27 (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":"baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c4c4ca21f856ffdd7fe53d789351c4a7e64fa4e9e114c0b66ecfff37dc08ed"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_hir_ty::lower::interface_lowering_diagnostics (cyclomatic 27): baml_compiler2_hir_ty::lower::interface_lowering_diagnostics has cyclomatic complexity 27 (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":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":2901}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1eda66be62567deea9131d8ada6d869490f2df69622baca107ee75fd06d150"}},{"ruleId":"D1","level":"warning","message":{"text":"SchemaCx::field_schema (cyclomatic 27): SchemaCx::field_schema has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/param_schema.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"2364b196637462f08e47da737ca7cd6ee91d6225bb703100b55d8828f27d9e0c"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_ide::cursor_context::find_source_expr_ids_at (cyclomatic 27): baml_ide::cursor_context::find_source_expr_ids_at has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/cursor_context.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbf07d82b933a713b38af4765b05133ece0efd185f74dac21a343c7a0170bdb"}},{"ruleId":"D1","level":"warning","message":{"text":"BexEngine::call_callable_with_outcome_impl (cyclomatic 27): BexEngine::call_callable_with_outcome_impl has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":4141}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6efed9a07f3f2a538d65735f3e91d50e3aacdc365b3cba61671d47068243be"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonParseState::should_close_string (cyclomatic 27): JsonParseState::should_close_string has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5fe010939b8838538b0d54782edfb388ae0b413c75c400e143031581116e3f"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderDefinitionEquivalence::types_equivalent (cyclomatic 27): RenderDefinitionEquivalence::types_equivalent has cyclomatic complexity 27 (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":"baml_language/crates/bex_vm/src/package_reflect/type_class.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e888e75b9d8b39bbf51f198b36486470d1e1e7950cdf6b63cc2dbdac199afac"}},{"ruleId":"D1","level":"warning","message":{"text":"bridge_ctypes::ty_decode::live_keys (cyclomatic 27): bridge_ctypes::ty_decode::live_keys has cyclomatic complexity 27 (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":"baml_language/crates/bridge_ctypes/src/ty_decode.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"87054999218bafd8c5ca82fc24db82d7d367d70ef7166c15a6da49f5707ad5b8"}},{"ruleId":"D1","level":"warning","message":{"text":"Expression::to_unresolved_value (cyclomatic 27): Expression::to_unresolved_value has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/expression.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aee59410755b3ebe8f85d9087b4080b3b466dc197e775f92f246081d4c16cfd"}},{"ruleId":"D1","level":"warning","message":{"text":"OutputFormatContent::inner_type_render (cyclomatic 27): OutputFormatContent::inner_type_render has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jinja-runtime/src/output_format/types.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fed83e20a492923dcb0c47cb2948cca72eb89d25b1e8d91190090d4dc90bd0"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonParseState::should_close_string (cyclomatic 27): JsonParseState::should_close_string has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ba97b2e4b1b5bdb04a9cdc916d36aa7b8836cd30ba918512d8513c6e616b9b"}},{"ruleId":"D1","level":"warning","message":{"text":"internal_baml_parser_database::names::resolve_names (cyclomatic 27): internal_baml_parser_database::names::resolve_names has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/parser-database/src/names/mod.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d443cab3eba7f909e1a9298d8903035966fe3282dcf58ce707862d2af1a6cc"}},{"ruleId":"D1","level":"warning","message":{"text":"generators_openapi::type::convert_ir_type (cyclomatic 27): generators_openapi::type::convert_ir_type has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/openapi/src/type.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6fd6aca36cca6993044d1391a5482bc8d21b65cd72429490e0b4e6c4b0d91e"}},{"ruleId":"D1","level":"warning","message":{"text":"WithIr::encode (cyclomatic 27): WithIr::encode has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_cffi/src/ctypes/baml_value_with_meta_encode.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2ac9f4688f96fb952a7426203f9f8175a2f0b8b67cdb6cd4bd4fcfdcf2e974"}},{"ruleId":"D1","level":"warning","message":{"text":"run.main (cyclomatic 27): run.main has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/gc_policy/run.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf99e9acc61ebafa5b72a64cce5174e92cb8025d3669bc98e6cec751a4012b1"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_go.equalBAMLType (cyclomatic 27): baml_go.equalBAMLType has cyclomatic complexity 27 (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":"baml_language/sdks/go/baml_go/value.go"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d03d98f739be72b233e8df5bf4bb8be5605954c9dfcb690258230efda531e1"}},{"ruleId":"D1","level":"warning","message":{"text":"index.testComplexMaps (cyclomatic 27): index.testComplexMaps has cyclomatic complexity 27 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/map_types/typescript/index.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56446ba2b4a2dec27683f6fb3fc39f9a35039827a1ed88bcfe88df6c60a7c83"}},{"ruleId":"D1","level":"warning","message":{"text":"page.BcsComments (cyclomatic 27): page.BcsComments has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 8 of the 27 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 94, a function literal at line 43, link, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/comments/page.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b576ef56a9b1cb5cd4158d83994df190af0dbf9977fa02fa9d0fea4fb60b916d"}},{"ruleId":"D1","level":"warning","message":{"text":"bep-user-stance.BepUserStance (cyclomatic 27): bep-user-stance.BepUserStance has cyclomatic complexity 27 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 8 belong to 4 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-user-stance.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"32acaa2ea950bccedea9dc0bb3dd38f3c8e9d18b923bbbc0f3900cf6cb7a055f"}},{"ruleId":"D1","level":"warning","message":{"text":"search-menu.SearchMenu (cyclomatic 27): search-menu.SearchMenu has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 6 of the 27 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 67, onInputKeyDown, a function literal at line 50, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/components/search-menu.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c5b5e96e2491fb852810f6ebfd5238be860bda34da5604c9031903892cdc80"}},{"ruleId":"D1","level":"warning","message":{"text":"no-widen-then-assert.knownValueEvidence (cyclomatic 27): no-widen-then-assert.knownValueEvidence has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-widen-then-assert.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67b7de846483eefbc5eeacab38610d1d5935fbe46cd05a7ccd371641f669546"}},{"ruleId":"D1","level":"warning","message":{"text":"GenerateArgs::run_generate (cyclomatic 26): GenerateArgs::run_generate has cyclomatic complexity 26 (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":"baml_language/crates/baml_cli/src/generate.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34273e556a2fe053022235c34f5971c7888eb5c7d77328e6c7bd458ce969220"}},{"ruleId":"D1","level":"warning","message":{"text":"StackifyCodegen::emit_statement (cyclomatic 26): StackifyCodegen::emit_statement has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: StackifyCodegen::try_specialize_binary_op (cyclomatic 41) 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":"baml_language/crates/baml_compiler2_emit/src/emit.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffb4f2a522335a3d6c37ae0dcbb754c14a1f553d32a324b613c663d3ef370a6"}},{"ruleId":"D1","level":"warning","message":{"text":"Facts::project (cyclomatic 26): Facts::project has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/facts.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"89366a626cd780d8e092c49ba99afbe67f684f9e1a1139ffd969434c35f23cbf"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::infer_match (cyclomatic 26): InferenceContext::infer_match has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabef531d4e050bb4baec3ce64bc69622d10d238bf1372e2328b9391ff037b7e"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::infer_binary (cyclomatic 26): InferenceContext::infer_binary has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":5251}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb02d94ce9feb20d2cb7dba29e4a965b7d67b3e5b5dd1c959778760e1530274e"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_hir_ty::interfaces::match_ty_pattern_into (cyclomatic 26): baml_compiler2_hir_ty::interfaces::match_ty_pattern_into has cyclomatic complexity 26 (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":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cd7b9e60835400800aff2259289e8cdd1fd3c6b79b86c0901199cc3fff1f71"}},{"ruleId":"D1","level":"warning","message":{"text":"BexEngine::shutdown_with_deadline (cyclomatic 26): BexEngine::shutdown_with_deadline has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":2843}}}],"partialFingerprints":{"codehealthFindingId/v1":"914be455982f9e674e8173b0a44d2028d2f758a859f81046e21bab36dd221d54"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_engine::host_instrumentation::capture_callback_inputs::copy (cyclomatic 26): bex_engine::host_instrumentation::capture_callback_inputs::copy has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/host_instrumentation.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa41216f6ba3f676c1b5b880023fdb509a40ed9fd3c25e3528cf175069fc95c"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_heap::accessor::owned_inner (cyclomatic 26): bex_heap::accessor::owned_inner has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_heap/src/accessor.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed36206432617647e91df8dc25df98342d5f9f7f460344e69715329afcd6594"}},{"ruleId":"D1","level":"warning","message":{"text":"ImplResolver::match_template (cyclomatic 26): ImplResolver::match_template has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/resolve.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86f82edfd2dbb1412dbd9b3429da1ff6193d7e016bda0cfed05c4cb654b9319"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_csharp::semantic::collect_methods (cyclomatic 26): sdkgen_csharp::semantic::collect_methods has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed07edd7f1cb27cea7da7712da7860fc4adce0a6aac8ad134b76b29eea5623e"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_go::names::project_base (cyclomatic 26): sdkgen_go::names::project_base has cyclomatic complexity 26 (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":"baml_language/sdks/go/sdkgen_go/src/names.rs"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e937cc6a64190aa54b8cefb1be70a680dfa9c5e231d7960852c892d2895bc9"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_rust::analyze::field_deps (cyclomatic 26): sdkgen_rust::analyze::field_deps has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/rust/sdkgen_rust/src/analyze.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a57ae2f014cce3c2cafe96838fb4f81f4dc099758d253d023ad2beb132c6d6"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionMetadata::analyze_expression (cyclomatic 26): FunctionMetadata::analyze_expression has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/watch.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2c080faaadc9f9fb644e73c41e64756f5bc5a56f95c990ea75be1e5f02bddb"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler::codegen::compile_thir_to_bytecode (cyclomatic 26): baml_compiler::codegen::compile_thir_to_bytecode has cyclomatic complexity 26 (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":"engine/baml-compiler/src/codegen.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d17a857ab0cb94704f11b47ebff6d734f3ae09e60ab3d68981f8c05fc802d9f"}},{"ruleId":"D1","level":"warning","message":{"text":"HeaderCollector::visit_expression (cyclomatic 26): HeaderCollector::visit_expression has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/baml_vis/header_collector.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13e5f857f78a3bcb35be88f3e078c59fd8ea268065b6ab97dacadf33d75f6a2"}},{"ruleId":"D1","level":"warning","message":{"text":"internal_baml_ast::parser::parse_expr::parse_expr_block (cyclomatic 26): internal_baml_ast::parser::parse_expr::parse_expr_block has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/parser/parse_expr.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6cd914991b383cc043d15e9d51b55fd21212b8ea4540d53357891102983961"}},{"ruleId":"D1","level":"warning","message":{"text":"internal_baml_core::ir::repr::specialize_generics (cyclomatic 26): internal_baml_core::ir::repr::specialize_generics has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/ir/repr.rs"},"region":{"startLine":3104}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd67b350c5cf4b2fea783fb7dc67d216ddb0c43d417810138e111e9d1f91614"}},{"ruleId":"D1","level":"warning","message":{"text":"internal_baml_core::validate::generator_loader::v2::parse_generator (cyclomatic 26): internal_baml_core::validate::generator_loader::v2::parse_generator has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/validate/generator_loader/v2.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf80b2da6d9edefe6a3542169c5e363a56671b243cacdbf025846a5d82eb31a"}},{"ruleId":"D1","level":"warning","message":{"text":"internal_baml_core::validate::validation_pipeline::validations::expr_fns::validate_expression (cyclomatic 26): internal_baml_core::validate::validation_pipeline::validations::expr_fns::validate_expression has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/expr_fns.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"98163e46b1e5b3268511ae7a4922588b749738155d076fdf26b1e7784d2a8453"}},{"ruleId":"D1","level":"warning","message":{"text":"OutputFormat::call (cyclomatic 26): OutputFormat::call has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jinja-runtime/src/output_format/mod.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"c993fd4aac8edd4f4d85792485dda56a4a4d00c6f6ce1ea3afb2527fa5a89d74"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeTS::serialize_type (cyclomatic 26): TypeTS::serialize_type has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/typescript/src/type.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"af05a04a98bd131f314611d7b738b8f502ec5c29c59951719299d37711e21d69"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlType.toWireTy (cyclomatic 26): BamlType.toWireTy has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlType.java"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"96be2e4a781643969e08c416a262301bc069df3c8d64e4c528580a89d662194b"}},{"ruleId":"D1","level":"warning","message":{"text":"btel_record_smoke.measure (cyclomatic 26): btel_record_smoke.measure has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/btel_record_smoke.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86a768a33b5abbf9eec854c3371a93107f02d12fb520920d302dda8a4156d3f"}},{"ruleId":"D1","level":"warning","message":{"text":"page.loadExamples (cyclomatic 26): page.loadExamples has cyclomatic complexity 26 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. 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":"engine/baml-runtime/src/control_flow/mermaid-sandbox/app/page.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e424bd22a6d166ad02ae7f9288fa8ee12b1fca2888b898af9394fee515dd7d7"}},{"ruleId":"D1","level":"warning","message":{"text":"index.testUltraComplex (cyclomatic 26): index.testUltraComplex has cyclomatic complexity 26 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/mixed_complex_types/typescript/index.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8de9506a82b9d2d91db7ac26b56f33092e3e66e8837367d621f548dd6a586f"}},{"ruleId":"D1","level":"warning","message":{"text":"graph-view.GraphView (cyclomatic 26): graph-view.GraphView has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 8 of the 26 points are its own statements and the rest belongs to 10 function items inside it that branch (a function literal at line 212, a function literal at line 95, a function literal at line 100, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/graph-view.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec4412a82f1493c6254f47e9d82bc6e9f25f6a331bb84fdd94ab4c17cb66771"}},{"ruleId":"D1","level":"warning","message":{"text":"verify.verifyGeneratedRelease (cyclomatic 26): verify.verifyGeneratedRelease has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/generated-content/verify.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"309931b9891c25a13215f26a5b1355f332863e1cff5ad507fbdf38b05dfe8157"}},{"ruleId":"D1","level":"warning","message":{"text":"TelemetryView.ErrorCaptureView (cyclomatic 26): TelemetryView.ErrorCaptureView has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f791bd3d1b5deaba85280cb9f179a35e535a212391886b3dcc24058f51cb95"}},{"ruleId":"D1","level":"warning","message":{"text":"decode.deserializeValue (cyclomatic 26): decode.deserializeValue has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-proto/src/decode.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"e490e68a2fc343c507122e0777a0db9b54871fe9a9a72dc4d37fcbc13afcb63b"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlValue.TryGet (cyclomatic 25): BamlValue.TryGet has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file\u0027s highest cyclomatic complexity: BamlTypeDescriptor.FromWire (cyclomatic 37) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Values/BamlValue.cs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b0a9ba18a12a55e9c645fea35cc14d214a8dd4956dd2a12fca7cb5cf9b8abb"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_ast::lower_type_expr::lower_from_type_name_with_generic_args (cyclomatic 25): baml_compiler2_ast::lower_type_expr::lower_from_type_name_with_generic_args has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/lower_type_expr.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0d9cee39d6c9d1cc3eb5bc16a8d39bc8cc4dd52f2891ab40b1236db236f270"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_emit::analysis::classify_locals (cyclomatic 25): baml_compiler2_emit::analysis::classify_locals has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/analysis.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"7533f628e3c7b8e27c3f4ee7bcfc398faad220942758f2d7623f8ebbae4b3aac"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_hir_ty::method_resolution::lookup_impl_member (cyclomatic 25): baml_compiler2_hir_ty::method_resolution::lookup_impl_member has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/method_resolution.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"5446bc6aeb6e1a3f17d1fcf4e054fd96a8dd8b92159c0351f1980a7d7b187553"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_ide::resolve::template_position_at (cyclomatic 25): baml_ide::resolve::template_position_at has cyclomatic complexity 25 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. 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":"baml_language/crates/baml_ide/src/resolve.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fa5c26fc06283fd669a2869c18253c0f2bbd033d9eae1f5b6b08d82a00cdb8"}},{"ruleId":"D1","level":"warning","message":{"text":"BexVm::bigint_binop (cyclomatic 25): BexVm::bigint_binop has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: bex_vm::vm::value_type_tag (cyclomatic 30) 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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":5768}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a6b0ea0eee4c4071fcd1a489e22be76c233f10126c1e2079c4b1c2e63fd4ba"}},{"ruleId":"D1","level":"warning","message":{"text":"cargo_size_gate::output::render_aggregate_markdown (cyclomatic 25): cargo_size_gate::output::render_aggregate_markdown has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/tools_size_gate/src/output.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb75b087bd84f068e757715767eaa0c459ec6bcda0ef9ec63968b377484915d3"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_cpp::render_header (cyclomatic 25): sdkgen_cpp::render_header has cyclomatic complexity 25 (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":"baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs"},"region":{"startLine":2176}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e81b6421b7e94866644fd497d67e47d0d6e450d707d6efb668a87a03ebb2e0e"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderContext::type_source (cyclomatic 25): RenderContext::type_source has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"25dd33b5745fbcf514f4c5c74221cf001ef77becf5280856742d70cd3cda939c"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_csharp::semantic::collect_type_closure (cyclomatic 25): sdkgen_csharp::semantic::collect_type_closure has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":2359}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbbc6f54455e7bde58adb10185656e703970089234b2defffedd80482ad6ab72"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_java::emit::render_callable_pair (cyclomatic 25): sdkgen_java::emit::render_callable_pair has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/sdkgen_java/src/emit.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"557a49d17da22726242db89a03a870ef82c4ba93bf0eeacf6faf96231f3ceb0b"}},{"ruleId":"D1","level":"warning","message":{"text":"Statement::to_doc (cyclomatic 25): Statement::to_doc has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/hir/dump.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"749613f615442373b9c2235ddc3ffa30612df1149834876226ea87777bba2b91"}},{"ruleId":"D1","level":"warning","message":{"text":"Expression::fmt (cyclomatic 25): Expression::fmt has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/expression.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd630756a83e5ba165ca98a18fe3281c65f9675a500ba8ed1584d4087bbf1cf"}},{"ruleId":"D1","level":"warning","message":{"text":"internal_baml_jinja_types::evaluate_type::expr::handle_enum_binary_operation (cyclomatic 25): internal_baml_jinja_types::evaluate_type::expr::handle_enum_binary_operation has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jinja/src/evaluate_type/expr.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"677132d9a7a92a99ab34c994d0ed431ce2119b2711fa6f0b3e9ef64e60554d90"}},{"ruleId":"D1","level":"warning","message":{"text":"ParserDatabase::to_jinja_type (cyclomatic 25): ParserDatabase::to_jinja_type has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/parser-database/src/walkers/mod.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5166b88850769363d926c6243e06a39c8d330119a9137aafcc617894f48ee7"}},{"ruleId":"D1","level":"warning","message":{"text":"AwsClient::stream_chat (cyclomatic 25): AwsClient::stream_chat has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d6e364ae5db606b5b73c57eca63a77ab9fcedfecb80c6617cf39f914cc5f12"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder.build_target (cyclomatic 25): Builder.build_target has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_cffi/build.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bf107556686a5dfc898ccab084d4dc215b842d0bb568006def1367196e1782"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlWireDepth.ty (cyclomatic 25): BamlWireDepth.ty has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/Encode.swift"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff9404fed20f621e2eb03a1f011a4e850b85fb44021209a0e5816926577bba4"}},{"ruleId":"D1","level":"warning","message":{"text":"unified-prompt-preview.UnifiedPromptPreview (cyclomatic 25): unified-prompt-preview.UnifiedPromptPreview has cyclomatic complexity 25 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/unified-prompt-preview.tsx"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dba4875a8c1e3086bb8d343cc2ff8b4076dd7d32231f6450e97e61f528818fd"}},{"ruleId":"D1","level":"warning","message":{"text":"CapturedValueCard.CapturedValueCard (cyclomatic 25): CapturedValueCard.CapturedValueCard has cyclomatic complexity 25 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. 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":"typescript2/pkg-playground/src/CapturedValueCard.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"3088beea6a7409cc24a59319b3631c16ed4445da47250e78f4021b55d8adba24"}},{"ruleId":"D1","level":"warning","message":{"text":"use-telemetry.useTelemetry (cyclomatic 25): use-telemetry.useTelemetry has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 13 function literals inside it that branch (lines 166, 179, 194, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/use-telemetry.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3a3181c53a449eb101f38eb8ce064bbaf9d7e283fb7b8043180e2ec61b2bd1"}},{"ruleId":"D1","level":"warning","message":{"text":"ExecutionPanel.ExecutionPanel::handleCursorContext (cyclomatic 25): ExecutionPanel.ExecutionPanel::handleCursorContext has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (ExecutionPanel.ExecutionPanel) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"3694ba50e2f95aadeb2b19ab5f2bce1521953d38075313d3f21b950b309f506c"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprBody::expr_children (cyclomatic 24): ExprBody::expr_children has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/traverse.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab251e1da69fa57e593d953ddc3e3e9fc7e726823ea97bb95c86da0e0f0a40d4"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::lower_class_pattern (cyclomatic 24): InferenceContext::lower_class_pattern has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5378c521cbd080842ab3374c9cc341881c1550e4d3257f744a51ba57a518332"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_mir::optimize::collect_place_bound_locals (cyclomatic 24): baml_compiler2_mir::optimize::collect_place_bound_locals has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This shape REPEATS in the file: one other method here (baml_compiler2_mir::optimize::collect_place_bound_locals::scan_rvalue) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/optimize.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f84980fba44b9b3d408369335461dfbbf027cbd2ab1cd930f6270abc4f6975"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm::package_baml::csv::poll_record (cyclomatic 24): bex_vm::package_baml::csv::poll_record has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df7040e3755e23c13853869100c929bc316ae5f3aba6189df5910e37bf9d6d4"}},{"ruleId":"D1","level":"warning","message":{"text":"Bytecode::lower (cyclomatic 24): Bytecode::lower has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: OpCode::try_from (cyclomatic 149) 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":"baml_language/crates/bex_vm_types/src/bytecode.rs"},"region":{"startLine":2632}}}],"partialFingerprints":{"codehealthFindingId/v1":"f991d4449073ab4c8096acb839ec485c18154ae4752610a6bb22713aec463277"}},{"ruleId":"D1","level":"warning","message":{"text":"bridge_ctypes::value_decode::decode_inbound (cyclomatic 24): bridge_ctypes::value_decode::decode_inbound has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_ctypes/src/value_decode.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"0749abe18542e17d80a1a5c259ab9a7c2307d3bb2b4614b03dca583bed1b3f13"}},{"ruleId":"D1","level":"warning","message":{"text":"bridge_ctypes::value_encode::external_to_outbound (cyclomatic 24): bridge_ctypes::value_encode::external_to_outbound has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_ctypes/src/value_encode.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67aef8aa5dfd866a7f159e8df87b13e19679500f58c49844dc904bcdb4c916c"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_rust::to_source_code_with_optional_metadata (cyclomatic 24): sdkgen_rust::to_source_code_with_optional_metadata has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/rust/sdkgen_rust/src/lib.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d669a574a63de8b1b6b780408b1305edcf03d469b9891c90ce2f6233925a8d"}},{"ruleId":"D1","level":"warning","message":{"text":"Expression::to_doc (cyclomatic 24): Expression::to_doc has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/hir/dump.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"342ebdafed754fbbf14009aa7faa8f19dfd7e686c91a44f003f401365be0f84d"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprIterator::next (cyclomatic 24): ExprIterator::next has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-types/src/expr.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db916caf98d8d381cb981cdc3242e1d13bf80511b3dc0958c2a6ef6e14b4c3f"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlValueWithFlags::explanation_impl (cyclomatic 24): BamlValueWithFlags::explanation_impl has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/deserializer/types.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"168d6dfcbd28edf72aee83ac695c90b226785debb19e790390a83afd84707258"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_runtime::optimize::evaluator::failure_location (cyclomatic 24): baml_runtime::optimize::evaluator::failure_location has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/evaluator.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30d6767e4886ec9bd0f3af6581e55dea68a55104a9c56b3be1f409a65955fd1"}},{"ruleId":"D1","level":"warning","message":{"text":"language_server::baml_project::get_dummy_value (cyclomatic 24): language_server::baml_project::get_dummy_value has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/baml_project/mod.rs"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"3caf7bbd370b041522dfcbd5cfb99f3122c5b965ca4fac9a3fa7ec40a030c930"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlValue::baml_decode (cyclomatic 24): BamlValue::baml_decode has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"languages/rust/baml/src/codec/baml_value.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0bef4cee6ab12d10d223c763cfbcc8b97d0021e7b896343cceed57e1158c5c"}},{"ruleId":"D1","level":"warning","message":{"text":"ProtoWriter.naturalType (cyclomatic 24): ProtoWriter.naturalType has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoWriter.java"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"150c5246c1c999657e613bac53646cc5a37e775e120666a75bc83a6c49b920a7"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlType.matchesStructural (cyclomatic 24): BamlType.matchesStructural has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlType.java"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b982e13ff1afb8c67f48558414b8b5012660cf5c07daea7519749b376f70c96"}},{"ruleId":"D1","level":"warning","message":{"text":"telemetry_resources.run_case (cyclomatic 24): telemetry_resources.run_case has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/scripts/telemetry_resources.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e82aad66aee8b87417087530022cce272c51c642d3f5447b85831a4ed42f8d6"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_go.prepareInvocation (cyclomatic 24): baml_go.prepareInvocation has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/invocation.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b760beda7b936d4beef5b5758c5293ac400d352470e0fb68d8af5fa5864afed4"}},{"ruleId":"D1","level":"warning","message":{"text":"DebugPanel.buildNodesByFile (cyclomatic 24): DebugPanel.buildNodesByFile has cyclomatic complexity 24 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. 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":"typescript/packages/playground-common/src/features/debug-panel/components/DebugPanel.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f220cc5274d08f775f9b900b4db249c798f130e95f71e580c25a48d585864866"}},{"ruleId":"D1","level":"warning","message":{"text":"SmartEdge.mergePoints (cyclomatic 24): SmartEdge.mergePoints has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/smart-edge.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c310f90866345061f350161128a0c8ded62645aeed35f204cb1584e23a12008"}},{"ruleId":"D1","level":"warning","message":{"text":"index.LLMNode (cyclomatic 24): index.LLMNode has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 9 of the 24 points are its own statements and the rest belongs to 4 function items inside it that branch (getOutputPreview, getStateStyle, a function literal at line 156, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/nodes/LLMNode/index.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bd6351fcfca7bbac96ed7b19e5bf4187e4e8f680604000d89dc17452068ab2"}},{"ruleId":"D1","level":"warning","message":{"text":"route.PUT (cyclomatic 24): route.PUT has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/beps/route.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74931fcb8c216c05119c3e45bc245c53a266f8f03a4d983666479217c6614ff"}},{"ruleId":"D1","level":"warning","message":{"text":"reader.BcsReader (cyclomatic 24): reader.BcsReader has cyclomatic complexity 24 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 8 belong to 5 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/reader.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ac1f3f5b1087d7a1cc9924c3e7f00711ffd5b371b034d3e2381979a57476ef"}},{"ruleId":"D1","level":"warning","message":{"text":"dictionary-types.unsafeDirectValue (cyclomatic 24): dictionary-types.unsafeDirectValue has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d98eed94d9dd43eb84a5b1c99fce2489fce9e849f15210930d6be0dd3f41a1"}},{"ruleId":"D1","level":"warning","message":{"text":"media.MDXMedia (cyclomatic 24): media.MDXMedia has cyclomatic complexity 24 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/media.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1e1f49355278e98d58d8e91bd6df5e360827e4b77206fc51b67ceb516dc88c"}},{"ruleId":"D1","level":"warning","message":{"text":"hyperobs.Timeline (cyclomatic 24): hyperobs.Timeline has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 6 function items inside it that branch (a function literal at line 1369, a function literal at line 1453, a function literal at line 1355, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/hyperobs.tsx"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"1324f9874a08669246933169600054fe4882daab28b0aca9e78fb208523eff2b"}},{"ruleId":"D1","level":"warning","message":{"text":"stack.Media (cyclomatic 24): stack.Media has cyclomatic complexity 24 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 11 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/stack.tsx"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"5476f165c16312d58e354a76327ae49199a0b9efb52b2134c9c4f26cfa5bc63a"}},{"ruleId":"D1","level":"warning","message":{"text":"args-form-model.defaultValue (cyclomatic 24): args-form-model.defaultValue has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/args-form-model.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8824119962c7e86ae0a362b7150203fb7bc54a251c4e4253d8fd216c39786218"}},{"ruleId":"D1","level":"warning","message":{"text":"args-form-model.matches (cyclomatic 24): args-form-model.matches has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/args-form-model.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"179e9fc123c95c04f7534d23621a7a24c446553402bf8018591bdd4612e21b6f"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionSidebar.FunctionSidebar (cyclomatic 24): FunctionSidebar.FunctionSidebar has cyclomatic complexity 24 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/FunctionSidebar.tsx"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"2682146d0197bb5f0319536ab35b4ad9a4f2f14de19fa8baea33cfa5e8ebf819"}},{"ruleId":"D1","level":"warning","message":{"text":"group-node.GroupNode (cyclomatic 24): group-node.GroupNode has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/graph/nodes/group-node.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"193b1a2d04f0a3a5030640874c139b7a16ad963615c083e0eb74f760fe059416"}},{"ruleId":"D1","level":"warning","message":{"text":"GenerateUnionSource (cyclomatic 23): GenerateUnionSource has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.UnionGenerator/Program.cs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"16395753c8353fe92551423268339199b0d84bc5e6ee11cc9c36a6e22d7de496"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_builtins2_codegen::codegen::extraction_expr (cyclomatic 23): baml_builtins2_codegen::codegen::extraction_expr 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":"baml_language/crates/baml_builtins2_codegen/src/codegen.rs"},"region":{"startLine":1660}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb325b0efeb4678af68e3de0505c1e6a83248d0a49447fca7472d6a7e2c7be93"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_ast::lower_tree::body::statement (cyclomatic 23): baml_compiler2_ast::lower_tree::body::statement has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43692a586d8acbb5f92d021d9bf22b1ab721c05eb04e0f6fdd0d85e9c683289"}},{"ruleId":"D1","level":"warning","message":{"text":"WitnessPat::render (cyclomatic 23): WitnessPat::render 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":"baml_language/crates/baml_compiler2_hir_ty/src/exhaustiveness.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d7d6afb0bf1f89eb58ba268577f1817911d612bf24b5b752688366e9172ddd"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_hir_ty::coherence::unify_into_at (cyclomatic 23): baml_compiler2_hir_ty::coherence::unify_into_at has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee2d3c557aa1ed9c27c71318d7d1ec2a60ab0f9689cde7bf40d14120b15244d"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_hir_ty::impls::match_pattern (cyclomatic 23): baml_compiler2_hir_ty::impls::match_pattern has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/impls.rs"},"region":{"startLine":2130}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7128efda7974d01039b85cdd09fd2f693b03daa4bd5977b63a7a310b381b1bd"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::terminator (cyclomatic 23): Walker::terminator has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/escape.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"525c64b58db283b46df38be89d2e6e22e86055668db9092fde0170031ba0fc69"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_mir::escape::array_walks (cyclomatic 23): baml_compiler2_mir::escape::array_walks has cyclomatic complexity 23 (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":"baml_language/crates/baml_compiler2_mir/src/escape.rs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6f5b0f13ee9e0f7e1f82b3bef2538eff968e97be9b2b2934c2ab891eeb0b0b"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_query_btel::query::run (cyclomatic 23): baml_query_btel::query::run 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":"baml_language/crates/baml_query_btel/src/query.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5754f1d81259a95188e72131cce2fb67fa5443aaeba6820f36cdde4d283c66e"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_type::unify::unify_into_at (cyclomatic 23): baml_type::unify::unify_into_at has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/unify.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f20de3123e47785327ff275647bf2afc29b3db652c5ad1ebb40d2061fa971a2"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderDefinitionValidator::visit (cyclomatic 23): RenderDefinitionValidator::visit 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":"baml_language/crates/bex_vm/src/package_reflect/type_class.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2f590f87cdc2b03b73acc3c1fdad1ef4f12bc44ac61cf38d712306a3f6993d"}},{"ruleId":"D1","level":"warning","message":{"text":"Scratch::add (cyclomatic 23): Scratch::add has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/telemetry/snapshot.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2e1051ead79a7947d8199c4698c756b7ed55fef143ca2ed04e333e4cdaf8a5"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm::package_baml::csv::convert_cell (cyclomatic 23): bex_vm::package_baml::csv::convert_cell has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4f9bd83121e456b1fe4088a3ab071126021db63e2e9a60e5eba0c6d148a651"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm::package_reflect::graft::relocate (cyclomatic 23): bex_vm::package_reflect::graft::relocate has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/graft.rs"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"cacf5aff4c1a5fbff1b2637ff4bd7f8bb94257b20eb73d313479d729834d9b42"}},{"ruleId":"D1","level":"warning","message":{"text":"bridge_cffi::baml_to_host::decode_invocation_request (cyclomatic 23): bridge_cffi::baml_to_host::decode_invocation_request 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":"baml_language/crates/bridge_cffi/src/baml_to_host.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"651377c08fe22445a3d328e9b51c1a8e0ab707c20e7c3b2b8dde20320e900d47"}},{"ruleId":"D1","level":"warning","message":{"text":"ArtifactTelemetry::from_manifest (cyclomatic 23): ArtifactTelemetry::from_manifest 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":"baml_language/crates/btel_settings/src/artifact.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec519e9f1b67f75e997551a00717d0017a4ea610762d08ca463e38afa4ad691"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_rust::emit::function::emit_binding (cyclomatic 23): sdkgen_rust::emit::function::emit_binding has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/rust/sdkgen_rust/src/emit/function.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00f329508e277b469451ba504af4b425571bf483ead93d6dc0caf14558876c7"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler::thir::interpret::parse_json_to_baml_value (cyclomatic 23): baml_compiler::thir::interpret::parse_json_to_baml_value has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 2 function items inside it that branch (json_to_baml, json_to_baml_inferred). 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":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":2589}}}],"partialFingerprints":{"codehealthFindingId/v1":"10630ee96a2d71a20f15ae934e208129f9fdba7b9ddebd1a150bf0b2bd7bafcc"}},{"ruleId":"D1","level":"warning","message":{"text":"MermaidDiagramGenerator::visit_expression (cyclomatic 23): MermaidDiagramGenerator::visit_expression has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec7e596d074aa0bac02f0f7eae8efc40ccc64f1f8b2394e291a8961a0d332aa"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_runtime::tracingv2::publisher::rpc_converters::extract_blobs_from_trace_data (cyclomatic 23): baml_runtime::tracingv2::publisher::rpc_converters::extract_blobs_from_trace_data 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":"engine/baml-runtime/src/tracingv2/publisher/rpc_converters/mod.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aaa2978e4b1c11b199eba71b65329c404d71b019bca2602cba0edbac954e591"}},{"ruleId":"D1","level":"warning","message":{"text":"generators_rust::ir_to_rust::type_to_rust (cyclomatic 23): generators_rust::ir_to_rust::type_to_rust has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/rust/src/ir_to_rust/mod.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"a693486293bc72719e764d509685c26a3fa96560ffb11d2a77eaffa42f0a384a"}},{"ruleId":"D1","level":"warning","message":{"text":"kpis.build (cyclomatic 23): kpis.build 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":"baml_language/tools/speedtest/src/speedtest/kpis.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"6738fdadd3ebdfcdc5e2c5a2f99d3b2025fabdd7016b66bcf8b55f609e5971b8"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder.build_all (cyclomatic 23): Builder.build_all 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":"engine/language_client_cffi/build.py"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9460e325adcd0f5a25384b7136aba7abb621a50660424ed6883fb58510e904"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_go.decodeMedia (cyclomatic 23): baml_go.decodeMedia 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":"baml_language/sdks/go/baml_go/media.go"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2144b3361c259da55f8f370565a1e454241cb378cbb709182c77a155fbdb917"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlRuntime.executeTests (cyclomatic 23): BamlRuntime.executeTests has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 10 of the 23 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 914, 846, 885). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/runtime/BamlRuntime.ts"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfb6b14ce2dd4e1caa19474646f4d92cb1f263ae8c22cd536930cd7ddcb5160"}},{"ruleId":"D1","level":"warning","message":{"text":"preview-toolbar.PreviewToolbar (cyclomatic 23): preview-toolbar.PreviewToolbar has cyclomatic complexity 23 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/preview-toolbar.tsx"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ebfae1eb11ad4caed17cd6bd8f6df85917979a14548cedc18d7fb1a947488c"}},{"ruleId":"D1","level":"warning","message":{"text":"prompts.buildAIAssistantPrompt (cyclomatic 23): prompts.buildAIAssistantPrompt has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 11 of the 23 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 102, formatVersion, a function literal at line 86, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/lib/prompts.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e23d53238af13d144410c5f9d0b3b7736226fb36bf9f5e246270387c1cc968"}},{"ruleId":"D1","level":"warning","message":{"text":"route.POST (cyclomatic 23): route.POST 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":"typescript2/app-beps/src/app/api/agent/beps/route.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"81149be331a95c96f75176cb4f8307c44eaa41cfd65b87de4f91ae66b6a12ab8"}},{"ruleId":"D1","level":"warning","message":{"text":"board.BcsBoard (cyclomatic 23): board.BcsBoard has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 10 of the 23 points are its own statements and the rest belongs to 9 function items inside it that branch (setParam, a function literal at line 162, a function literal at line 172, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/board.tsx"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"7112a0e5ee7d7af7e2d6b8c465dd122236d72e0dc125c9d899771cc0c7a44d63"}},{"ruleId":"D1","level":"warning","message":{"text":"dictionary-types.dictionaryValueTypes (cyclomatic 23): dictionary-types.dictionaryValueTypes has cyclomatic complexity 23 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"016d486dabf990914b739f6efaf33e2dd890417027c8390e55069c4d0f4b748b"}},{"ruleId":"D1","level":"warning","message":{"text":"council-gate.Council (cyclomatic 23): council-gate.Council has cyclomatic complexity 23 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 10 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/sheep-council/council-gate.tsx"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"2894b4f39234ccffc4c8d900e686ac30d2b12273ce58eb7194222232ab03c3e9"}},{"ruleId":"D1","level":"warning","message":{"text":"MetadataBadges.extractMetadata (cyclomatic 23): MetadataBadges.extractMetadata 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":"typescript2/pkg-playground/src/components/MetadataBadges.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"423ec02b6e21455cc096a43d69922d8436fbdece5911b3646aaf01260a5c0696"}},{"ruleId":"D1","level":"warning","message":{"text":"PrimitiveProtocol.DecodeStreamPull (cyclomatic 22): PrimitiveProtocol.DecodeStreamPull has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Proto/PrimitiveProtocol.cs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a359fe4a3c210b30b98cfd8912c81560d55b7c03aca862a025585603e96f8a3"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprBody::display_expr_inner (cyclomatic 22): ExprBody::display_expr_inner has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/ast.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e21ef90d1ee9c8aec79513eec656767ea8c2f1e5d76c07eb8a5e6147d93bbd8"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_mir::memory::spawn_shared_cells (cyclomatic 22): baml_compiler2_mir::memory::spawn_shared_cells has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/memory.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca48dfed5d4292609dbfe07b14a38554d8c1f448ab2effad2597452ed46ea211"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_rust::codegen::types::build_type (cyclomatic 22): baml_compiler2_rust::codegen::types::build_type has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_rust/src/codegen/types.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18fe37f89061712e9b63b3c5f46786985c48e5e272d9fa8862f994487be931f"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_visualization::control_flow::flatten::compute_required_nodes (cyclomatic 22): baml_compiler2_visualization::control_flow::flatten::compute_required_nodes has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c6df06ae16958a7d373c6e5c1c0ca726afc12952bd6f3f2cf518316a8172c1"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_db::check::source_aware_tir_type_error_message (cyclomatic 22): baml_db::check::source_aware_tir_type_error_message has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: baml_db::check::tir_type_error_to_diagnostic_id (cyclomatic 127) 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":"baml_language/crates/baml_db/src/check.rs"},"region":{"startLine":2026}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53d52680c8e4a1805eaaa65b4e5eeebcb3c5ce1cf8e5f3b3fe9c766f193cd00"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_ide::resolve::operator_target_at (cyclomatic 22): baml_ide::resolve::operator_target_at has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/resolve.rs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d70c6031ed7b5daab837c375bf302aa112bbd8d75bb795e3d56f8e9a85efb9"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_ide::usages::find_member_usages (cyclomatic 22): baml_ide::usages::find_member_usages has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/usages.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be4ed6cca6e4fafbc404f4393e756a133b4e7f76e9611ef1012555b22ba91be"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_lsp_server::playground_server::lsp_ws_session (cyclomatic 22): baml_lsp_server::playground_server::lsp_ws_session has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2975c9a6cd225ff6ff5a7e97494a90d18e84481c39d80a072a759659c22329"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_parser::types::collect_ambiguous_pipes (cyclomatic 22): baml_parser::types::collect_ambiguous_pipes has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_parser/src/types.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"03929b0f7a9d91fe3bebdefc02a8a3a6f05cc2b667b0d1ee6ba78d01bbffe3eb"}},{"ruleId":"D1","level":"warning","message":{"text":"LlmBody::parse (cyclomatic 22): LlmBody::parse has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"4505f3ead82c75f78a222dd6173f6c4a7b534dacd6266e4f0f70c30a91329be7"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonInhabitance::solve (cyclomatic 22): JsonInhabitance::solve has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/json_inhabit.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"2492680ebb88f2d47ba0c0e91e7c2145ea82feaba4e11c1853e105c9ab2a1b65"}},{"ruleId":"D1","level":"warning","message":{"text":"BexVm::binop_values (cyclomatic 22): BexVm::binop_values has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: bex_vm::vm::value_type_tag (cyclomatic 30) 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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":9127}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d400fab397a65e0fe217af9efe4f0b1413870ea73640b9ceccaba7d5b49b7b"}},{"ruleId":"D1","level":"warning","message":{"text":"BexVm::exec_compact (cyclomatic 22): BexVm::exec_compact has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: bex_vm::vm::value_type_tag (cyclomatic 30) 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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":9242}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0ecfc2058d75acc7ebd02c1f57004ad904d14ae9fe926b3f0622a0ee48515a"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm::package_baml::json::path::select (cyclomatic 22): bex_vm::package_baml::json::path::select has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/json/path.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82a1d9f40522073adf19bfea39a8ca141d3966fb9a2fbab74d837a7a9c2b510"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm::package_reflect::type_class::render_type_value_source (cyclomatic 22): bex_vm::package_reflect::type_class::render_type_value_source has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/type_class.rs"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88113ead13c3b1c216b1ec006abaec098ee1044218e1493de0b1aefd7e31616"}},{"ruleId":"D1","level":"warning","message":{"text":"bridge_cffi::host_capture::copy (cyclomatic 22): bridge_cffi::host_capture::copy has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_cffi/src/host_capture.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"220031eeb61ab6ed17e5925b0d090215c92d1711274414a368da3f5e029d5897"}},{"ruleId":"D1","level":"warning","message":{"text":"btel_bcs::plan::validate_response (cyclomatic 22): btel_bcs::plan::validate_response has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_bcs/src/plan.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b1dc5fd76595999eb50a4a960a5047eb668cddba71ff0685baf0ddd2c82412"}},{"ruleId":"D1","level":"warning","message":{"text":"TelemetryRuntime::write_span_with_context (cyclomatic 22): TelemetryRuntime::write_span_with_context has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_processor/src/runtime.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f1181fdf2afcf10400851221a7d08eeee318996f5cd2a0b13e0268cbcf25d5"}},{"ruleId":"D1","level":"warning","message":{"text":"Renderer::value (cyclomatic 22): Renderer::value has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_reader/src/value.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f707a14cefe8e3ceb0658a95665a59143a101ba38eb17e0c2b5057b43566cd5"}},{"ruleId":"D1","level":"warning","message":{"text":"btel_reader::value::span::reach (cyclomatic 22): btel_reader::value::span::reach has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_reader/src/value/span.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9bcfcab5d8ebfdaadd38f55bff9a1f3dff91f58144a9185b60d51a0bc4f034"}},{"ruleId":"D1","level":"warning","message":{"text":"GoNames::for_pool (cyclomatic 22): GoNames::for_pool has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: sdkgen_go::names::union_type_component (cyclomatic 26) 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":"baml_language/sdks/go/sdkgen_go/src/names.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50f64bb3a3c3e84816c6e3aefb0462af8255dcd89401e63c8a3e5c9305c6782"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_go::collect_projected_codec_types (cyclomatic 22): sdkgen_go::collect_projected_codec_types has cyclomatic complexity 22 (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. This is NOT this file\u0027s highest cyclomatic complexity: sdkgen_go::baml_type_descriptor_with (cyclomatic 32) 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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"221a825b62d8bd66458c530c2a5e3c5bb1e54dade4ed01ddf1798263b5eb207b"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_go::add_projected_type_imports (cyclomatic 22): sdkgen_go::add_projected_type_imports has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: sdkgen_go::baml_type_descriptor_with (cyclomatic 32) 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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":2684}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ebb08bb508db30761d79ec4c11cc5e6bc853c640814912b024ffa12274781f"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_go::render_callback_codecs (cyclomatic 22): sdkgen_go::render_callback_codecs has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: sdkgen_go::baml_type_descriptor_with (cyclomatic 32) 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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":4444}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b2b15316b7e48aaec2c506981eac48a125dc9b55fae26436c4b968ac107081"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_bridge::outbound::to_inbound (cyclomatic 22): baml_bridge::outbound::to_inbound has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/rust/bridge_rust/src/outbound.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a357ce05e26a71409a0d5190775ef169e3d41ec193a9eef27ceaf4cc162be3"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler::thir::interpret::check_watch_changes (cyclomatic 22): baml_compiler::thir::interpret::check_watch_changes has cyclomatic complexity 22 (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":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b3a2136defe05f6b0986af772ca28a498b83b90a210512cac1329367cf30a7"}},{"ruleId":"D1","level":"warning","message":{"text":"internal_baml_ast::parser::parse_expr::parse_statement_inner_rule (cyclomatic 22): internal_baml_ast::parser::parse_expr::parse_statement_inner_rule has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/parser/parse_expr.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e33b63a68dd2d185a4382c47088bfec9c3b9bb4937b2d35488f2d94de6c80a8"}},{"ruleId":"D1","level":"warning","message":{"text":"internal_baml_core::validate::validation_pipeline::validations::expr_fns::validate_stmt (cyclomatic 22): internal_baml_core::validate::validation_pipeline::validations::expr_fns::validate_stmt has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/expr_fns.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a6d7729dc6ef82f28aa9718d03a73a061eaef0cb8dd3d7d331b2fe7aff200e"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_log::logger::log_event_internal (cyclomatic 22): baml_log::logger::log_event_internal has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-log/src/logger.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a0c728f00e2c755da6a67dc1c558b7fe9388bed0d1c3c55d0dab328082a533"}},{"ruleId":"D1","level":"warning","message":{"text":"internal_baml_jinja_types::evaluate_type::expr::infer_const_type (cyclomatic 22): internal_baml_jinja_types::evaluate_type::expr::infer_const_type has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jinja/src/evaluate_type/expr.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b5cfbe31486dcda2c5bb8975f7b96df55136881bba15311d18a1845e8cf352"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlValueWithFlags::fmt (cyclomatic 22): BamlValueWithFlags::fmt has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/deserializer/types.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7dfc7468142355404ca1159e066309b8a9261e4fb8c8ec013ff92617a17d6df"}},{"ruleId":"D1","level":"warning","message":{"text":"UnresolvedAwsBedrock::resolve (cyclomatic 22): UnresolvedAwsBedrock::resolve has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/llm-client/src/clients/aws_bedrock.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbdb9ab4936f7fa9307629a17ebcf0f63024623508e5afe433acb9c0f6a62e3e"}},{"ruleId":"D1","level":"warning","message":{"text":"VertexClient::build_request (cyclomatic 22): VertexClient::build_request has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/vertex/vertex_client.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"68779a9872bb86b5d7642ed85cd3b8ba780f0054d54b8b64dea84121c40219a7"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_cffi_macros::generate_param_extraction (cyclomatic 22): baml_cffi_macros::generate_param_extraction has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc42be7f1f0627c172f59a4afc1eedd88e42e2729e7db5b5b411a3cfac76345"}},{"ruleId":"D1","level":"warning","message":{"text":"generators_go::ir_to_go::type_to_go (cyclomatic 22): generators_go::ir_to_go::type_to_go has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/go/src/ir_to_go/mod.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"51dbd1ca80fa25274e1c6e1c8826e29c6222fa97ca156a67aba7758d10551b43"}},{"ruleId":"D1","level":"warning","message":{"text":"generators_typescript::ir_to_ts::type_to_ts (cyclomatic 22): generators_typescript::ir_to_ts::type_to_ts has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/typescript/src/ir_to_ts/mod.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6790213bf41dc2be2b8654e2b8aca035dfe3f5cd14669f446904e35cf119f4f"}},{"ruleId":"D1","level":"warning","message":{"text":"bump-version.perform_version_bumps (cyclomatic 22): bump-version.perform_version_bumps has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bump-version.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ff406f615938d35a3b1ae5537120da7c6a944aae9fcde54bf2cd84957ec985"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_go.isJSONBAMLType (cyclomatic 22): baml_go.isJSONBAMLType has cyclomatic complexity 22 (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":"baml_language/sdks/go/baml_go/json.go"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda1dfa29fc19f1a8ff6109deaf176569e70790d92bc53fcdb8964714bb441c3"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_go.resolveRuntime (cyclomatic 22): baml_go.resolveRuntime has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/runtime_artifact.go"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"1494d39506e20e015fb8dcf169a223568c5549a25be0edc6a157c3c1aa20a648"}},{"ruleId":"D1","level":"warning","message":{"text":"serde.typeToString (cyclomatic 22): serde.typeToString has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/baml_go/serde/decode.go"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58977a8e6342abc97f0fb2502557f0c4abd268210e4b2ce871b42943b025fd3"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlUnion3._bamlDecode (cyclomatic 22): BamlUnion3._bamlDecode has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (BamlUnion3._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"247d892a2fc97f31f014f05f254471b05d164221084fbf48ac78adf195939f15"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlUnion3._bamlDecode (cyclomatic 22): BamlUnion3._bamlDecode has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (BamlUnion3._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf231c0781c5ed6d2a00eb1c99e5435ad31d72e2c5db32c7b453a556f2baf79d"}},{"ruleId":"D1","level":"warning","message":{"text":"EmbedDialog.EmbedDialog (cyclomatic 22): EmbedDialog.EmbedDialog has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 8 of the 22 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 65, buildUrl, a function literal at line 62, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_components/EmbedDialog.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"64458588d67c0729593604d557bb5f671e4722a7be5053e833d283490f8971ba"}},{"ruleId":"D1","level":"warning","message":{"text":"SmartEdge.splitPoints (cyclomatic 22): SmartEdge.splitPoints has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/smart-edge.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a0ca79a7fb55a74f10851631bb221b33ba3a4be1676c9c352c11bf6e74f687"}},{"ruleId":"D1","level":"warning","message":{"text":"index.BaseNode (cyclomatic 22): index.BaseNode has cyclomatic complexity 22 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 9 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/nodes/BaseNode/index.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd69fb29bfabfa965d62b9f200418a981a3070a506eb46c3df9cb6eb0c7c1a09"}},{"ruleId":"D1","level":"warning","message":{"text":"bep-export-all-dialog.BepExportAllDialog (cyclomatic 22): bep-export-all-dialog.BepExportAllDialog has cyclomatic complexity 22 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 10 belong to 2 function literals inside it that branch. 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":"typescript2/app-beps/src/components/bep/bep-export-all-dialog.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0940b8fba5200b00b8b5d996da6ab9151cf740db8c74c46fec2a5c2a1f0c9c5f"}},{"ruleId":"D1","level":"warning","message":{"text":"bep-table-of-contents.BepTableOfContents (cyclomatic 22): bep-table-of-contents.BepTableOfContents has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 5 of the 22 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 121, 147, 154, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-table-of-contents.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b940399781aa2f6cfddf580056fb438dddeb08cdcb273ae6fee64418ca2550"}},{"ruleId":"D1","level":"warning","message":{"text":"comment-thread.CommentThread (cyclomatic 22): comment-thread.CommentThread has cyclomatic complexity 22 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 10 belong to 4 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-thread.tsx"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0cd3e86780ee6ea8d82bd4016dc0877fe0eadd6d49f0bd490fb216af195917"}},{"ruleId":"D1","level":"warning","message":{"text":"package-generator.buildReferencePages (cyclomatic 22): package-generator.buildReferencePages has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. 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":"typescript2/app-developer-docs/lib/generated-content/package-generator.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f8ec770b66350515f6a42f01e443195aed200cf89745318da9abeb3bd4e06e"}},{"ruleId":"D1","level":"warning","message":{"text":"hyperobs.ChatMessage (cyclomatic 22): hyperobs.ChatMessage has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/hyperobs.tsx"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"14598402b793b4f03b740a7a74152cac583c9038b769164f4d82383424402a1c"}},{"ruleId":"D1","level":"warning","message":{"text":"args-form-model.reconcileValue (cyclomatic 22): args-form-model.reconcileValue has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"typescript2/pkg-playground/src/args-form-model.ts"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3acce5eb85197291dc9f04a502250a8725ef80675bcd96d2640a16bf4eca465"}},{"ruleId":"D1","level":"warning","message":{"text":"FunctionSidebar.FunctionTreeNode (cyclomatic 22): FunctionSidebar.FunctionTreeNode has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/FunctionSidebar.tsx"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b704ddd8c47b99f4990c315ad4e88ea379b5210f41eb771f2f70a3e0df88aa"}},{"ruleId":"D1","level":"warning","message":{"text":"lod.applyLevelOfDetail (cyclomatic 22): lod.applyLevelOfDetail has cyclomatic complexity 22 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. 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":"typescript2/pkg-playground/src/graph/lod.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"398a6028c39be306a7f50e94acb745c6c9a0a63baa317af4b70d317bf2c179f0"}},{"ruleId":"D1","level":"warning","message":{"text":"ReplayServer.ServeRequestAsync (cyclomatic 21): ReplayServer.ServeRequestAsync has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdk_tests/crates/csharp/streaming/Program.cs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94355ce48fbb8f1b721c98867704e3aa1165521f664e1f2f90de863efeed988"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::infer_assign (cyclomatic 21): InferenceContext::infer_assign has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":4317}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e43af2ed6390b5f774a001bee13a2afd0ecf2497dd37d07c53e60208db6e590"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::field_access_resolved (cyclomatic 21): InferenceContext::field_access_resolved has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":10054}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26f7ecd33fd3c2ae2d66228c7923d39fa18112dfc59f102c58513901191dae0"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_hir_ty::json_attrs::class_errors (cyclomatic 21): baml_compiler2_hir_ty::json_attrs::class_errors has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/json_attrs.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"401ceea0b83d71264968753ec96882d29d13c5f411c1c46e95e2ea4f8b56350a"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_lvalue (cyclomatic 21): LoweringContext::lower_lvalue has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":12365}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52a42647b6e9c18016b584a9c62b788fcf6424992458d9d7d8039706ea1c762"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_mir::escape::describe (cyclomatic 21): baml_compiler2_mir::escape::describe has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/escape.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"129fb0c79209a8e056e94b387ca5c12fa5384f525764355efce844e6ff698eb2"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_mir::optimize::count_in_rvalue (cyclomatic 21): baml_compiler2_mir::optimize::count_in_rvalue has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/optimize.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8090ccbd2e734753b634fe375a1fbf9962f112f0444c18fef38bdc75840e453"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_db::check::validate_ambiguous_typevar_associated_projection_in_type_expr (cyclomatic 21): baml_db::check::validate_ambiguous_typevar_associated_projection_in_type_expr has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: baml_db::check::tir_type_error_to_diagnostic_id (cyclomatic 127) 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":"baml_language/crates/baml_db/src/check.rs"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a299241a4652083da90b1177c480d9babd5d152eac87227d1e106b030d610f9"}},{"ruleId":"D1","level":"warning","message":{"text":"TriviaInfo::from_scan (cyclomatic 21): TriviaInfo::from_scan has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/trivia_classifier.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5d03a1566eac76c1eae38363b788c388ed153babcc844f0e62694dd03d06ca"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_ide::info::generic_type_parameter_info_at (cyclomatic 21): baml_ide::info::generic_type_parameter_info_at has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/info.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"234b7516b51c397cb41ce36163962076717f9b1b71dc60fe6faa4bd041c2737d"}},{"ruleId":"D1","level":"warning","message":{"text":"Translator::binary (cyclomatic 21): Translator::binary has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/sql.rs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"058863fc665e2953b3aa8c2959a227b86a74d33a95cc3eda863aa7fcc040a2eb"}},{"ruleId":"D1","level":"warning","message":{"text":"Translator::function (cyclomatic 21): Translator::function has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/sql.rs"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd65ab62a5f7e062a986d4a826d3265f7a74b297e45b07c27d60c6c36b14ab9"}},{"ruleId":"D1","level":"warning","message":{"text":"NormalTy::is_disjoint_from (cyclomatic 21): NormalTy::is_disjoint_from has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: NormalTy::legacy_render (cyclomatic 30) 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":"baml_language/crates/baml_type/src/normalize.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e14ab60f5dd6b1b40cbf0e39a911887df190102ac7ad2a7c00b17505462a7be"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_engine::conversion::find_matching_member (cyclomatic 21): bex_engine::conversion::find_matching_member has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: bex_engine::conversion::value_matches_type (cyclomatic 35) 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":"baml_language/crates/bex_engine/src/conversion.rs"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"f816df0e755d6c5892162812f0f9562bc63cf03837ce88d998d9815baf6dfe6d"}},{"ruleId":"D1","level":"warning","message":{"text":"IntTy::coerce (cyclomatic 21): IntTy::coerce has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6af16fee0311c92631d8aa0c78b6949df2dd4df5085189d8b719c17dd7e00f0"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm::package_baml::json::copy_json (cyclomatic 21): bex_vm::package_baml::json::copy_json has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/json/mod.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5a6ea8ac0aec65e9970e62172c5a7d1c97ca4c42b797671f88b2e540498c43"}},{"ruleId":"D1","level":"warning","message":{"text":"FieldType::repr (cyclomatic 21): FieldType::repr has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/ir/repr.rs"},"region":{"startLine":1885}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3e8878435fe551c104d3a80b841163680656c9fcc3767c3cbef2410e642620"}},{"ruleId":"D1","level":"warning","message":{"text":"btel_snapshot::decode::decode (cyclomatic 21): btel_snapshot::decode::decode has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_snapshot/src/decode.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55b33cc6316c2f801d24fbc0d8775826870c25ef4c230327f5aa10c430aff3f"}},{"ruleId":"D1","level":"warning","message":{"text":"sys_glob::glob_to_regex (cyclomatic 21): sys_glob::glob_to_regex has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_glob/src/lib.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"7edef828bc8b43aaf7f9950085e9444e652f0732cf0fbae4f24ecf8c82585168"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeSysOps::_send_sse (cyclomatic 21): NativeSysOps::_send_sse has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":3428}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ebc185f209e3daacc19e565902cd0c967a537ce726a8059b6f041ea2e363c6"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_swift::translate_ty::slot_expr (cyclomatic 21): sdkgen_swift::translate_ty::slot_expr has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/rust/sdkgen_swift/src/translate_ty.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"898155b03127cee535501af8ba4456ac90438635a9f746d624da20e849207b1c"}},{"ruleId":"D1","level":"warning","message":{"text":"ExprIterator::next (cyclomatic 21): ExprIterator::next has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/thir.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dad7423cdafa596074133f4ccd89bd135e9d6eee90e2a1b9fa12b24404c88f9"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler::hir::lowering::type_ir_from_ast (cyclomatic 21): baml_compiler::hir::lowering::type_ir_from_ast has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/hir/lowering.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9cfa54d3dc887ced8d4854d55a9742411395900fd4d2a6aa370da6d72ac0086"}},{"ruleId":"D1","level":"warning","message":{"text":"IRHelperExtended::distribute_type_with_meta (cyclomatic 21): IRHelperExtended::distribute_type_with_meta has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: IRHelperExtended::is_subtype (cyclomatic 29) 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":"engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"529febf63d456150b785ff66711715edb14c8b59452e0033517e9829ac19f0d7"}},{"ruleId":"D1","level":"warning","message":{"text":"internal_baml_jinja::minijinja_value_to_json (cyclomatic 21): internal_baml_jinja::minijinja_value_to_json has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jinja-runtime/src/lib.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f0783e09c2f92a11abc3a70ea696918d1a80c904d95a70a46f854ac69ac2cf"}},{"ruleId":"D1","level":"warning","message":{"text":"jsonish::deserializer::coercer::match_string::string_match_strategy (cyclomatic 21): jsonish::deserializer::coercer::match_string::string_match_strategy has cyclomatic complexity 21 (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":"engine/baml-lib/jsonish/src/deserializer/coercer/match_string.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba443d1c81d1eea2e5a1d7f2f60024dd6b60909439fc1fea6d6d49667806a317"}},{"ruleId":"D1","level":"warning","message":{"text":"jsonish::deserializer::semantic_streaming::process_node (cyclomatic 21): jsonish::deserializer::semantic_streaming::process_node has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/deserializer/semantic_streaming.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e866440192a52ff951f5c1e927e2d4cd63e2812b0129a69baef5169ae53334a5"}},{"ruleId":"D1","level":"warning","message":{"text":"generators_ruby::ir_to_rb::stream_type_to_rb (cyclomatic 21): generators_ruby::ir_to_rb::stream_type_to_rb has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/ruby/src/ir_to_rb/mod.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d654d1f111e202dcee09ab19b342b8bc44c9f6068424c3073fe65c2b961fd2d0"}},{"ruleId":"D1","level":"warning","message":{"text":"RubyToJson::serialize_baml (cyclomatic 21): RubyToJson::serialize_baml has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_ruby/ext/ruby_ffi/src/ruby_to_json.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa6eb70b26ec920a473b203a9bbdbc3b642d6ea2489c129234bb66628044466"}},{"ruleId":"D1","level":"warning","message":{"text":"proto._ty_to_python_type (cyclomatic 21): proto._ty_to_python_type has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/src/baml_bridge/proto.py"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"43257b4147cba0e491cedf649025ce9c6a3f25869bbfcf5b7a7579542d767123"}},{"ruleId":"D1","level":"warning","message":{"text":"proto.decode_value (cyclomatic 21): proto.decode_value has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/src/baml_bridge/proto.py"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94a0f895c17590e581a4c5197dd7dc5ff1bf70b514c135ed6e27f45f114cbe8"}},{"ruleId":"D1","level":"warning","message":{"text":"schedule.validate (cyclomatic 21): schedule.validate has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bctl_src/oncall/schedule.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"13de6124e6015ce9a66fb15d2d7d2ab49f5c3c0b5cd2920532e211657b37cfb2"}},{"ruleId":"D1","level":"warning","message":{"text":"Run.fixture (cyclomatic 21): Run.fixture has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/btel_query_smoke.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb2df51910e27229748b88de29e04d23d3613c63a8a09478c798635f4314d18"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_go.reflectBAMLType (cyclomatic 21): baml_go.reflectBAMLType has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/dynamic.go"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26c2e2643b61ae31d78ef7dac756972331e1ac14ec3b6e5ba132a03233d709d"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_go.appendOutboundHandles (cyclomatic 21): baml_go.appendOutboundHandles has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/media.go"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f64ce7cfb982b791cb30a1cadbfba59d645df8698f4fde5cad1e69e84ef1d2"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_go.findOrDownloadLibrary (cyclomatic 21): baml_go.findOrDownloadLibrary has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/baml_go/lib_common.go"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"173d0bd12ecda4c8884ed698b7b27c759fd9a78d15ffb96ae794b14c0eedfd47"}},{"ruleId":"D1","level":"warning","message":{"text":"serde.encodeValue (cyclomatic 21): serde.encodeValue has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/baml_go/serde/encode.go"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf917bcd6a7fb97f393b77a21e2770e30315cb5d3d8dfea38d621463144164fb"}},{"ruleId":"D1","level":"warning","message":{"text":"atomWithHashBase64.atomWithHash (cyclomatic 21): atomWithHashBase64.atomWithHash has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 10 of the 21 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 113, a function literal at line 41, a function literal at line 31, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/lib/atomWithHashBase64.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79d3bb231bdbcc452b7cd2b413e51794a77be5ee08e31fd6e66f584598bd093"}},{"ruleId":"D1","level":"warning","message":{"text":"route.GET (cyclomatic 21): route.GET has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/auth/github/callback/route.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c021e512420aba62a9cf17202877d77e93a6547a06b77457b492e0372259e801"}},{"ruleId":"D1","level":"warning","message":{"text":"bep-list.BepList (cyclomatic 21): bep-list.BepList has cyclomatic complexity 21 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 7 belong to 5 function items inside it that branch. 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":"typescript2/app-beps/src/components/bep/bep-list.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba729354150108281c80fdcb0875c68e502466ac764ff99241fdef5d3a03f794"}},{"ruleId":"D1","level":"warning","message":{"text":"decision-form.DecisionForm (cyclomatic 21): decision-form.DecisionForm has cyclomatic complexity 21 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 10 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/decisions/decision-form.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42980ed9af58b8d42dbb30a252b9f2b5e4c66a2363525bbb57a4a7c6fce4f23"}},{"ruleId":"D1","level":"warning","message":{"text":"pipeline.stageInfo (cyclomatic 21): pipeline.stageInfo has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"typescript2/app-feedback/src/lib/pipeline.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d45fb795fd234e36df8a3c52ffb365327ba0017dfb6efe11b0d2b64aefe199"}},{"ruleId":"D1","level":"warning","message":{"text":"app.App (cyclomatic 21): app.App has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 9 of the 21 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 705, 643, 588, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-type-quiz/src/app.tsx"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"51be585793e35755b658a82622aac2008dd6577aaa6af0968b77082063112cbe"}},{"ruleId":"D1","level":"warning","message":{"text":"tracker.Transit (cyclomatic 21): tracker.Transit has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 2 of the 21 points are its own statements and the rest belongs to 10 function literals inside it that branch (lines 1672, 1578, 1604, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/tracker.tsx"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ebbc6c6a0a3e20947e7477a148fac689ad9d17b2a93db4c7c5382cf013b207"}},{"ruleId":"D1","level":"warning","message":{"text":"pinned.Looped (cyclomatic 21): pinned.Looped has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 4 of the 21 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 243, 271, 296, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/pinned.tsx"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37391753d532f9a87893b5f3b4adafab509bb9714f44af7f07f2ba76a8052da"}},{"ruleId":"D1","level":"warning","message":{"text":"vscode.VSCodeMock (cyclomatic 21): vscode.VSCodeMock has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/vscode.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"63881912590bcdd2423fe9da942d4af299c68dacd9e41ca012f8615b39f191a5"}},{"ruleId":"D1","level":"warning","message":{"text":"TelemetryView.TimingsTab (cyclomatic 21): TelemetryView.TimingsTab has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 7 of the 21 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 2316, 2317, 2355, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":2282}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7ec2c28f7102f525efd835de32b66ff16c96a2e2fb2bea4132e42d72c9788b"}},{"ruleId":"D1","level":"warning","message":{"text":"walkNodeModuleFile::visitModuleBody (cyclomatic 21): walkNodeModuleFile::visitModuleBody has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/stdlib-matrix/extractors/ts-surface.mjs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e05d9e6b90afa0be17e6903c7ccca24c6755014939811b53a745490aa0a8e49"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_base::escape::decode_escape (cyclomatic 20): baml_base::escape::decode_escape has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_base/src/escape.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57c597bbdec63c28308690545ebaa38ce1529affa60d546850feb2180dd2b3c"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_hir_ty::infer::infer_body_impl (cyclomatic 20): baml_compiler2_hir_ty::infer::infer_body_impl has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":1774}}}],"partialFingerprints":{"codehealthFindingId/v1":"568f489ffde24700387764a3b072a083857612b2988153757f4ee861c84956da"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_hir_ty::interfaces::collect_type_generic_bound_errors (cyclomatic 20): baml_compiler2_hir_ty::interfaces::collect_type_generic_bound_errors has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs"},"region":{"startLine":1604}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5a8f5cbd0259d39d94252a3c0fa2592d6c0ca3e2d9307ffb94d11f384bd0b9"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_multi_segment_path_as_field_chain (cyclomatic 20): LoweringContext::lower_multi_segment_path_as_field_chain 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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":6810}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4dd7de3e31364675a18759794b176dd6fb673ef327d53deb479ae1b0743bf40"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::check_intrinsic (cyclomatic 20): LoweringContext::check_intrinsic 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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":9322}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b8c6bd397ffe7c5dad481993abb8684560d24d0678c9bcdbbdaf8d59b2a304"}},{"ruleId":"D1","level":"warning","message":{"text":"Facts::statement (cyclomatic 20): Facts::statement has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/optimize/effects.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed40c0b0e1c2ef24c2595b8f0e9e0ba25725d1c5b9e499a5365852a8704dbe75"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_mir::escape::coverage (cyclomatic 20): baml_compiler2_mir::escape::coverage has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/escape.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"4959deb0363e7d35aa6090c48b264e94908a46e2fd27851eb460485c306826d8"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_mir::optimize::propagate_copies (cyclomatic 20): baml_compiler2_mir::optimize::propagate_copies 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":"baml_language/crates/baml_compiler2_mir/src/optimize.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a73b5f39cc1da1ad0bd75addaa01dd1b78b9fb4ceb76257194417212cba95d7"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_mir::optimize::values::fold_constants (cyclomatic 20): baml_compiler2_mir::optimize::values::fold_constants 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":"baml_language/crates/baml_compiler2_mir/src/optimize/values.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff43ad0e824842d73450728fc714d6ac18970aa6a0beba23b23ff3c9fb404253"}},{"ruleId":"D1","level":"warning","message":{"text":"Walk::token (cyclomatic 20): Walk::token has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: SemanticTokenType::legend_index (cyclomatic 25) 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":"baml_language/crates/baml_ide/src/tokens.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b1dbefed57c80794a263dae3684d3e7ca190f6136632b4a88317ec6fe9045d"}},{"ruleId":"D1","level":"warning","message":{"text":"Translator::projection (cyclomatic 20): Translator::projection 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":"baml_language/crates/baml_query_btel/src/sql.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a73d5babfd7cff7de4a666656e160e62abc44f54bdbb186e14695714fda447c"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonInhabitance::discover (cyclomatic 20): JsonInhabitance::discover 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":"baml_language/crates/baml_type/src/json_inhabit.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"070def99aa11f239e5e14f3ce31ce44f99a4e1724dd75d43535ed45958b8bed6"}},{"ruleId":"D1","level":"warning","message":{"text":"BexEngine::new_with_config (cyclomatic 20): BexEngine::new_with_config has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":1857}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c4b28a5bfabe8721674179bf656c9d9717769345a29c1ce442297562344eb5"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_project::runtime_compile::projected_interface (cyclomatic 20): bex_project::runtime_compile::projected_interface has cyclomatic complexity 20 (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":"baml_language/crates/bex_project/src/runtime_compile.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6e2bf8501dd752857040aa1e1126c10f84508cc1ebd76b155f1271de812359"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_sap::deserializer::coercer::match_string::string_match_strategy (cyclomatic 20): bex_sap::deserializer::coercer::match_string::string_match_strategy has cyclomatic complexity 20 (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":"baml_language/crates/bex_sap/src/deserializer/coercer/match_string.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac08d335a1b1eb45627f272fa69a9cc99ed6f975ba666cf9bc48a8cdb354d9a"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm::debug::display_instruction (cyclomatic 20): bex_vm::debug::display_instruction has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/debug.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bcc77c8b8da3d62404b1d4b343b622ccbbb7097b6af73d717717be1c9f92e90"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm::package_baml::json::decode::decode_one (cyclomatic 20): bex_vm::package_baml::json::decode::decode_one has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/json/decode.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcc361c982b4050246d5649810df6d586ba567c07d296f2c041f9990814d28e"}},{"ruleId":"D1","level":"warning","message":{"text":"btel_reader::value::step (cyclomatic 20): btel_reader::value::step has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_reader/src/value.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8eb0102cb76e3205e91242c97badea19046e93aaa21e28c1859fb594210dc78"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_go::render_types (cyclomatic 20): sdkgen_go::render_types has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: sdkgen_go::baml_type_descriptor_with (cyclomatic 32) 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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":5136}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad375070a2ce98e94e7bfb711c5112ff89d8859fe58bca9f5e197972452a489"}},{"ruleId":"D1","level":"warning","message":{"text":"LeafBody::needs_baml_pyhandle (cyclomatic 20): LeafBody::needs_baml_pyhandle has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to one function item inside it that branches (ty_uses_rust_type). 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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a95cb9f5f38f4a23e98bc5388b30bda36ceaa3bfe1fc89aececcaa41d3cfc2b"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_swift::to_source_code_with_optional_metadata (cyclomatic 20): sdkgen_swift::to_source_code_with_optional_metadata 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":"baml_language/sdks/swift/rust/sdkgen_swift/src/lib.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49da2d97c52d5bea862e9ea3cc6621ab505b36391365778cd9f398069026d09"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_swift::emit::render_class (cyclomatic 20): sdkgen_swift::emit::render_class has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/rust/sdkgen_swift/src/emit.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b993711beedc1bcc69082c44c418472c542faee0d3e20965fd417ebd389b720"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphBuilder::build_header (cyclomatic 20): GraphBuilder::build_header 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":"engine/baml-lib/ast/src/ast/baml_vis/graph.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9d2926d846e42b6f06e93006705e1810e2225c8001a1ca06fd1c0c7f722ad6"}},{"ruleId":"D1","level":"warning","message":{"text":"MermaidDiagramGenerator::visit_stmt (cyclomatic 20): MermaidDiagramGenerator::visit_stmt has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb266b561095daa3b6f61bd9b5738c2919579389c7d3de043fe3b582df76d58"}},{"ruleId":"D1","level":"warning","message":{"text":"Stmt::fmt (cyclomatic 20): Stmt::fmt 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":"engine/baml-lib/ast/src/ast/stmt.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"53152440f10e8c7c309c61e7f4de41206ef26da8a103d2f84ed419e703bb23d5"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeGeneric::to_union_name (cyclomatic 20): TypeGeneric::to_union_name has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-types/src/ir_type/mod.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"65368117fd5b74f28f435afe71d639252f95d1aa99c302ea22c7a936754a8a96"}},{"ruleId":"D1","level":"warning","message":{"text":"internal_baml_jinja_types::evaluate_type::stmt::narrow_attr_access_on_union_var (cyclomatic 20): internal_baml_jinja_types::evaluate_type::stmt::narrow_attr_access_on_union_var has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: internal_baml_jinja_types::evaluate_type::stmt::truthy (cyclomatic 27) 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":"engine/baml-lib/jinja/src/evaluate_type/stmt.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a67f3d075212599594c1eb89d7f2dbbe68d0a9d677d284b9790f244901f4e6"}},{"ruleId":"D1","level":"warning","message":{"text":"jsonish::deserializer::semantic_streaming::required_done (cyclomatic 20): jsonish::deserializer::semantic_streaming::required_done has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/deserializer/semantic_streaming.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fb6b6fc7ec8c6a409316ed9dfeb7d42d3799de30a2e299c8d2e84b401042c9"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_runtime::async_vm_runtime::try_vm_value_from_baml_value (cyclomatic 20): baml_runtime::async_vm_runtime::try_vm_value_from_baml_value has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/async_vm_runtime.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd3727660036de0c7aef19d86d5bcf1a7a2384fd322837dc41efd7c62662485"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_runtime::internal::llm_client::primitive::stream_request::make_stream_request (cyclomatic 20): baml_runtime::internal::llm_client::primitive::stream_request::make_stream_request has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/stream_request.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a913a65ac071c59be63ca3aebc50d221481edd6d56b68f7aeb33e09ce4c25e"}},{"ruleId":"D1","level":"warning","message":{"text":"generators_typescript::ir_to_ts::stream_type_to_ts (cyclomatic 20): generators_typescript::ir_to_ts::stream_type_to_ts has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/typescript/src/ir_to_ts/mod.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"884ebff57930bd849821ec5fbc75a7d03031e74bb1068d705eee5c0da4734aeb"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_go.releaseOutboundOpaqueHostValues (cyclomatic 20): baml_go.releaseOutboundOpaqueHostValues 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":"baml_language/sdks/go/baml_go/media.go"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0dc84ee032bca09fc3cf69859fce73646be4b9fd26a23693e00ff0ddeb9550"}},{"ruleId":"D1","level":"warning","message":{"text":"index.testMixedOptionalNullable (cyclomatic 20): index.testMixedOptionalNullable has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/optional_nullable/typescript/index.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"709f9b83316aff405dcbc12944c65e2f5c18f70a019254db06fa83c16fcfff24"}},{"ruleId":"D1","level":"warning","message":{"text":"index.GroupNode (cyclomatic 20): index.GroupNode has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/nodes/GroupNode/index.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5e084c52f8cc81e31ec0bc89492b8a946c7d2b18090703a19b7e015a06b04f"}},{"ruleId":"D1","level":"warning","message":{"text":"bcs.checkPages (cyclomatic 20): bcs.checkPages has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"typescript2/app-beps/convex/bcs.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9ef78ac890457768d53ae007cb32c8168f761df0b6afd43a363637064fcef5"}},{"ruleId":"D1","level":"warning","message":{"text":"page.UsersPage (cyclomatic 20): page.UsersPage has cyclomatic complexity 20 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/users/page.tsx"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c40b5df16b715002ed097cba71dc6b68e20387910fa0fa768494ff5a8238e88"}},{"ruleId":"D1","level":"warning","message":{"text":"bcs-render.adjust (cyclomatic 20): bcs-render.adjust has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 2 function items inside it that branch (a function literal at line 141, collect). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/bcs-render.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a1cc9258f66d477cd51bc26e67caede1c74c6972fe08e022eb08c65bafc346"}},{"ruleId":"D1","level":"warning","message":{"text":"bep-routes.parseBepSegments (cyclomatic 20): bep-routes.parseBepSegments 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":"typescript2/app-beps/src/lib/bep-routes.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe4284fea926f9428b9013e832f98848495b266c2b9d29a2d64ff0ca1f50d30"}},{"ruleId":"D1","level":"warning","message":{"text":"dictionary-types.classifyWideningTarget (cyclomatic 20): dictionary-types.classifyWideningTarget 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":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d708efffe7bd13257dbd6e627f3dc7abc48c2260ed2475e051dffa9bcb85f0"}},{"ruleId":"D1","level":"warning","message":{"text":"dictionary-types.classifyAliasBroadTarget (cyclomatic 20): dictionary-types.classifyAliasBroadTarget has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"b403f0378f524d8bcdef6b65e145c1ba9ecdff5a1419d2e8555c0485f7cf72b2"}},{"ruleId":"D1","level":"warning","message":{"text":"issue-detail.IssueDetail (cyclomatic 20): issue-detail.IssueDetail has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/components/issues/issue-detail.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1a1656625a132ac941c617b5d77aec92b6ca6835292a0a219977916676ae9c"}},{"ruleId":"D1","level":"warning","message":{"text":"issue-list.IssueList (cyclomatic 20): issue-list.IssueList has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 9 of the 20 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 129, 125, 124, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/components/issues/issue-list.tsx"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8f03d417c55e6f0e67ad02015dac88ccee1396dce48591f2a93fad3cf49ffc"}},{"ruleId":"D1","level":"warning","message":{"text":"signup-form.SignupConfirmation (cyclomatic 20): signup-form.SignupConfirmation 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":"typescript2/app-website/app/(home)/eap/signup-form.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d4e2427a457e76a96ae471e46851694f84aa5f2cf5886ef2c70079c6d96467"}},{"ruleId":"D1","level":"warning","message":{"text":"tracker.drawFrame (cyclomatic 20): tracker.drawFrame has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 3 of the 20 points are its own statements and the rest belongs to 8 function items inside it that branch (onLamb, a function literal at line 787, a function literal at line 798, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/tracker.tsx"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe9c8b6ec81dde75d52ac2f97cfd89e26e7f828d130ae954340b05113ea69e1"}},{"ruleId":"D1","level":"warning","message":{"text":"newsletter-form.NewsletterForm (cyclomatic 20): newsletter-form.NewsletterForm has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 5 of the 20 points are its own statements and the rest belongs to 8 function items inside it that branch (handleSubmit, SignUpFormButton, hasRecentSubmission, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/newsletter-form.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bd038fa75f2c3f9610fde8bfb91280d51fb35858b491e38b15544337aba813"}},{"ruleId":"D1","level":"warning","message":{"text":"ApiKeysDialog.ApiKeysDialog::renderRow (cyclomatic 20): ApiKeysDialog.ApiKeysDialog::renderRow has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/components/ApiKeysDialog.tsx"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"1424e5ec677684b99cf7863c219a75892836f03c71462c28e7f93eb3c0bb60dc"}},{"ruleId":"D1","level":"warning","message":{"text":"PrimitiveProtocol.DecodeHandle (cyclomatic 19): PrimitiveProtocol.DecodeHandle has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table. This is NOT this file\u0027s highest cyclomatic complexity: PrimitiveProtocol.Decode (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Proto/PrimitiveProtocol.cs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b711d972722cf5c0eb70595df10d9c22cca9fb899aed9eefc4105948d5e1a2"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlValue.AddValueHash (cyclomatic 19): BamlValue.AddValueHash has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: BamlTypeDescriptor.FromWire (cyclomatic 37) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Values/BamlValue.cs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fd9a3ae7461f16e09ec8dc0088b4b62f3e77b3139f230984877da10ec51e07"}},{"ruleId":"D1","level":"warning","message":{"text":"EscapeIssue::fmt (cyclomatic 19): EscapeIssue::fmt has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_base/src/escape.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"74efa0485b25ac1c710f8d208c0d6706435d73ccd7d0450544a653ca8ac5ae60"}},{"ruleId":"D1","level":"warning","message":{"text":"DescribeArgs::find (cyclomatic 19): DescribeArgs::find has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/describe_command.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"6541858d911975d2f65b4ee44eea87fcf43149751eb0e9e36c71f7fc7e79bd68"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_cli::generate::discover_generators (cyclomatic 19): baml_cli::generate::discover_generators has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/generate.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffd3eb0767d04d74170a78074553b1f47b54a7b563bbf8354c497313a4ba44b"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_emit::analysis::is_return_phi (cyclomatic 19): baml_compiler2_emit::analysis::is_return_phi has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/analysis.rs"},"region":{"startLine":1785}}}],"partialFingerprints":{"codehealthFindingId/v1":"935737bdf4438258fd5b10319387420433546722495fc6cb6eef0c7c9f3fd046"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticIndexBuilder::collect_pattern_names (cyclomatic 19): SemanticIndexBuilder::collect_pattern_names has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: SemanticIndexBuilder::render_type_expr (cyclomatic 23) 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":"baml_language/crates/baml_compiler2_hir/src/builder.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5e90452f0216c30d7cac056f844b3368c36d122107890a510ebfc143802f68"}},{"ruleId":"D1","level":"warning","message":{"text":"Matrix::specialize (cyclomatic 19): Matrix::specialize has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/exhaustiveness.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcdf5bc1390c14460c61d4051ba9eb47fff51d8d35d9d9f9a04e25f68fd646af"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_mir::memory::walk_rvalue_places (cyclomatic 19): baml_compiler2_mir::memory::walk_rvalue_places has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/memory.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6f889aa9c5b4a9dc5f25a1bb130325fc6f3f63f9d31462b86d2829aea7f5c6"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_mir::optimize::collect_place_bound_locals::scan_rvalue (cyclomatic 19): baml_compiler2_mir::optimize::collect_place_bound_locals::scan_rvalue has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This shape REPEATS in the file: one other method here (baml_compiler2_mir::optimize::collect_place_bound_locals) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/optimize.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"3063944ae657701844ac291f00c56a1de02e5f392937854023ee008799e397f4"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_mir::optimize::apply_subst_to_rvalue (cyclomatic 19): baml_compiler2_mir::optimize::apply_subst_to_rvalue has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This shape REPEATS in the file: one other method here (baml_compiler2_mir::optimize::remap_rvalue) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/optimize.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"470c539962467d393cdb2ee8d2d23befa3fb2f7644976fb2df78c8b8a28a6f3a"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_mir::optimize::remap_rvalue (cyclomatic 19): baml_compiler2_mir::optimize::remap_rvalue has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This shape REPEATS in the file: one other method here (baml_compiler2_mir::optimize::apply_subst_to_rvalue) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/optimize.rs"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96e3d485b2b028bace76d4265b59fe20ba2d541d5b67dd849c5b7f992845727"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator::constant (cyclomatic 19): Generator::constant has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_rust/src/codegen/constant.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"326d53c7c77a47d7af72f5d7c5a38c7a82b1f3ae76f704998a048b08096a4c74"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_visualization::control_flow::flatten::prepare_control_flow_graph_for_visualization (cyclomatic 19): baml_compiler2_visualization::control_flow::flatten::prepare_control_flow_graph_for_visualization has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe82b9658e5a44c81a5b38bb11b81abe2e0766a699fcb7fc07023a477f7ed901"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_ide::cfg::ast_test_control_flow_graph_impl (cyclomatic 19): baml_ide::cfg::ast_test_control_flow_graph_impl has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/cfg.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbcbf2f0b81c2d67c1105f601c1ecc83f17b47ff0da36cfb96b771e1791bc84"}},{"ruleId":"D1","level":"warning","message":{"text":"BexEngine::call_resolved_with_trace (cyclomatic 19): BexEngine::call_resolved_with_trace has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":3449}}}],"partialFingerprints":{"codehealthFindingId/v1":"a891d0ded039bb3a9d8223d90e704b640bd5e92cf898e1854e8aae8c2a886f7d"}},{"ruleId":"D1","level":"warning","message":{"text":"BigintTy::coerce (cyclomatic 19): BigintTy::coerce has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4f3b4e200cba247e89d9f3032a26f858975652a6c26e46c643280e5f02d8af"}},{"ruleId":"D1","level":"warning","message":{"text":"BexVm::begin_error_evidence (cyclomatic 19): BexVm::begin_error_evidence has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm/error_evidence.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16728546e7d8037d94058ab86312c1eb6cf4a071082b1c87bbb157634e0859c"}},{"ruleId":"D1","level":"warning","message":{"text":"BexVm::value_runtime_package (cyclomatic 19): BexVm::value_runtime_package has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: bex_vm::vm::value_type_tag (cyclomatic 30) 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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":4700}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9efdbf5c1a9881a581f4bc88b82eb88063b123dcb2787f9a3073cc938f68861"}},{"ruleId":"D1","level":"warning","message":{"text":"Planner::natural (cyclomatic 19): Planner::natural has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Planner::rank (cyclomatic 25) 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":"baml_language/crates/bridge_encode/src/plan.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"433e0e53cbcd54d94baecc79cc0888fbf59eb88847a6d10f896eaace95eaf9c9"}},{"ruleId":"D1","level":"warning","message":{"text":"BcsDeliveryHandle::submit (cyclomatic 19): BcsDeliveryHandle::submit has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_bcs/src/delivery.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"31346aa1cbb2417a2644615e953c4fa76aee2850c16843293dbafcbddd4d52b8"}},{"ruleId":"D1","level":"warning","message":{"text":"EncodedSpans::event (cyclomatic 19): EncodedSpans::event has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_recorder/src/encoding.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35e9010dce0a3b694855c07f228740e99926ff3605f185d9abe71a4717ccdfb"}},{"ruleId":"D1","level":"warning","message":{"text":"btel_snapshot::walk::value (cyclomatic 19): btel_snapshot::walk::value has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_snapshot/src/walk.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a96981db40889470bb0d63cb8a11c90a9af2e023a07f3e5dfdb3789e8b91a19"}},{"ruleId":"D1","level":"warning","message":{"text":"OutputFormatContent::auto_prefix (cyclomatic 19): OutputFormatContent::auto_prefix has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_ops/src/output_format.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4aa33a33bb776a84e295cf2be91a02fe9647e4f57d56cdce9f337ffeb0fdf4e"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_cpp::emit_callable (cyclomatic 19): sdkgen_cpp::emit_callable has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"60db0b0d14d3ae1d49263eb0ff261917b6f0a23773472d2f4196ed03ffc945fd"}},{"ruleId":"D1","level":"warning","message":{"text":"IRSignature::new_from_ir (cyclomatic 19): IRSignature::new_from_ir has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/ir/ir_hasher/mod.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"31240f6556b27081ac6fb7d02ed38e31deba485990067b34963aa539859d84fd"}},{"ruleId":"D1","level":"warning","message":{"text":"internal_baml_jinja_types::evaluate_type::stmt::predicate_implications (cyclomatic 19): internal_baml_jinja_types::evaluate_type::stmt::predicate_implications has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: internal_baml_jinja_types::evaluate_type::stmt::truthy (cyclomatic 27) 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":"engine/baml-lib/jinja/src/evaluate_type/stmt.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df8eb6b79d62b34023248d6ce2117015aacbe34868a9c12813cf0f2eca8da38"}},{"ruleId":"D1","level":"warning","message":{"text":"OutputFormatContent::prefix::auto_prefix (cyclomatic 19): OutputFormatContent::prefix::auto_prefix has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jinja-runtime/src/output_format/types.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8de5476028e6dae7e98710cf1185361d4b2ea756e747515e9216d7ee45f1215"}},{"ruleId":"D1","level":"warning","message":{"text":"internal_baml_prompt_parser::parser::parse_prompt::handle_print_block (cyclomatic 19): internal_baml_prompt_parser::parser::parse_prompt::handle_print_block has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/prompt-parser/src/parser/parse_prompt.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"776241e1910ab25e715bed9b69cab8d2dc64173cef3e1f6b0c337c7b6ae07438"}},{"ruleId":"D1","level":"warning","message":{"text":"App::handle_key (cyclomatic 19): App::handle_key has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/tui.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd270112be83b05bc3890d0b830d0faf529b9d6486e4b66b30253f931e9add8f"}},{"ruleId":"D1","level":"warning","message":{"text":"WasmRuntime::run_tests (cyclomatic 19): WasmRuntime::run_tests has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":2027}}}],"partialFingerprints":{"codehealthFindingId/v1":"225b6803a505a7a97dff621c3ef1875bf432961f463463b2ee6ce1ef3bd6366f"}},{"ruleId":"D1","level":"warning","message":{"text":"generators_python::ir_to_py::stream_type_to_py (cyclomatic 19): generators_python::ir_to_py::stream_type_to_py has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/python/src/ir_to_py/mod.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd6f3e75d3ec80359cf0113a19c1148e76cd7c07b0b367329c6575fa0452627"}},{"ruleId":"D1","level":"warning","message":{"text":"generators_python::watchers::build_notification_collectors (cyclomatic 19): generators_python::watchers::build_notification_collectors has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/python/src/watchers.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a952bcc5e65c60b6aac79cda15e72ede53af060e7f6660aefd2c697caea74a2"}},{"ruleId":"D1","level":"warning","message":{"text":"generators_lib::version_check::check_version (cyclomatic 19): generators_lib::version_check::check_version has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/utils/generators_lib/src/version_check.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0017ef92b2c6a4e59a59a2f0004afc86735b0f883e0ba5d3f9ecb616defe99"}},{"ruleId":"D1","level":"warning","message":{"text":"WithIr::encode (cyclomatic 19): WithIr::encode has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_cffi/src/ctypes/baml_type_encode.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d8a95531f5522e8a8b635ba8ccb9569dba0e70ba7b51082c3d974b1007ac47"}},{"ruleId":"D1","level":"warning","message":{"text":"language_server::server::api::diagnostics::project_diagnostics (cyclomatic 19): language_server::server::api::diagnostics::project_diagnostics has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/server/api/diagnostics.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb4d87658bbeba2a86f14ed498a71cfb62c6e0a66487fa3cdf2d0a189a5d1d5"}},{"ruleId":"D1","level":"warning","message":{"text":"_invocation.normalize (cyclomatic 19): _invocation.normalize has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/src/baml_bridge/_invocation.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a9ef3e4c2458285599d6e8c5854692c6a08eee0b59b04cebba60407cb27399"}},{"ruleId":"D1","level":"warning","message":{"text":"summarize.main (cyclomatic 19): summarize.main has cyclomatic complexity 19 (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":"baml_language/tools/gc_policy/summarize.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e3109f5ef90fc5804a2db5eda9f108c8b8d96bba44d9aa3c307f3286d28ade"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlPromptJSON._bamlDecode (cyclomatic 19): BamlPromptJSON._bamlDecode has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/Prompt.swift"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aac1775072339c4da52d84d97805982b66fe88fb4c355efd428c8c059789f78"}},{"ruleId":"D1","level":"warning","message":{"text":"index.testObjectArrays (cyclomatic 19): index.testObjectArrays has cyclomatic complexity 19 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 9 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/array_types/typescript/index.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a6c7148e40896681777352e3e4ffe65a3f260f69a87928dced2a7cdd29ad96"}},{"ruleId":"D1","level":"warning","message":{"text":"index.testSimpleMaps (cyclomatic 19): index.testSimpleMaps has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/map_types/typescript/index.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2acf2566d46fa4cbf2fc8f16a4991141291c1118234aa79b88ea85f1ba1a2f"}},{"ruleId":"D1","level":"warning","message":{"text":"index.testNestedMaps (cyclomatic 19): index.testNestedMaps has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/map_types/typescript/index.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c358e71a9e2fe79a7470a3e18b636c51b8de96570e96049b3ba4848f6832797"}},{"ruleId":"D1","level":"warning","message":{"text":"index.testDeeplyNested (cyclomatic 19): index.testDeeplyNested has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/nested_structures/typescript/index.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"4354a6ba86ccda416c0428da6c167c39e47d729489953b852c373339fd8614f5"}},{"ruleId":"D1","level":"warning","message":{"text":"index.testMixedPrimitives (cyclomatic 19): index.testMixedPrimitives has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/primitive_types/typescript/index.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c594275415f5c01a462e792c8a3bc720758253a6b8c122f4ab713e38563694d0"}},{"ruleId":"D1","level":"warning","message":{"text":"clientwrapper.EmbedComponentInner (cyclomatic 19): clientwrapper.EmbedComponentInner has cyclomatic complexity 19 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 6 belong to 5 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/embed/clientwrapper.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"83cc02607b5f3f9c9cede0fb1992afaa84c22a45fb43ec8eacda102ef9792407"}},{"ruleId":"D1","level":"warning","message":{"text":"collapsible-message.CollapsibleMessage (cyclomatic 19): collapsible-message.CollapsibleMessage has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to 3 function items inside it that branch (getMediaIndicator, a function literal at line 32, a function literal at line 90). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/collapsible-message.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d591572697dc1a0a2f47bbca6cadad9e13dbbd47ee153adeae5152f10fa8620f"}},{"ruleId":"D1","level":"warning","message":{"text":"route.GET (cyclomatic 19): route.GET has cyclomatic complexity 19 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. 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":"typescript2/app-beps/src/app/api/agent/beps/[number]/comments/route.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7ef1203b6fe42fd0f5ef25686f1b492d1ee2e0679f12950a0cde73c68d8a44"}},{"ruleId":"D1","level":"warning","message":{"text":"frame.BcsFrame (cyclomatic 19): frame.BcsFrame has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 61, 93, 101). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/frame.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4894e9def0c467b44a54a52e2112e6698c93a50072d9d1c674514450f07131b"}},{"ruleId":"D1","level":"warning","message":{"text":"bep-route-shell.BepRouteShell::handleConfirmSubmit (cyclomatic 19): bep-route-shell.BepRouteShell::handleConfirmSubmit has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (bep-route-shell.BepRouteShell) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-route-shell.tsx"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ddd33f5752b1f8ed04bd1a82842db426410b2a973d808df92c63dc7858ea68f"}},{"ruleId":"D1","level":"warning","message":{"text":"ProblemsBoard.ProblemsBoard (cyclomatic 19): ProblemsBoard.ProblemsBoard has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 53, 122, 44, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_components/ProblemsBoard.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"46078d21bf84ff89066b122e365be126eb429426252f213fd1cd6095aebd613d"}},{"ruleId":"D1","level":"warning","message":{"text":"code-mirror-viewer.CodeMirrorViewer (cyclomatic 19): code-mirror-viewer.CodeMirrorViewer has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 7 function literals inside it that branch (lines 137, 111, 265, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/codemirror-panel/code-mirror-viewer.tsx"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2751b7b02557e330b80ccea8219c857616817ab612ef3c986d24ad6d4cd6cb1f"}},{"ruleId":"D1","level":"warning","message":{"text":"hero-video.codeDeco (cyclomatic 19): hero-video.codeDeco has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/hero-video.tsx"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1ff11fdeb0ccca21ffbbe508e76967b6b0afaf076e35ad710720861a81f575"}},{"ruleId":"D1","level":"warning","message":{"text":"improve.Collage (cyclomatic 19): improve.Collage has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 7 function literals inside it that branch (lines 831, 730, 790, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/improve.tsx"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"9010957bda0aa17deac6cf6f5635b480fe9c95d987a636c9b33d3ed105695559"}},{"ruleId":"D1","level":"warning","message":{"text":"ArgsForm.FieldInput (cyclomatic 19): ArgsForm.FieldInput has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ArgsForm.tsx"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"fede519c929058302282917b2ae099ed30f62b7dfbf3e569cf750509cbbac71d"}},{"ruleId":"D1","level":"warning","message":{"text":"ExecutionPanel.CollectionDebugView (cyclomatic 19): ExecutionPanel.CollectionDebugView has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 414, 428). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"121f751a51284e6d39504e858837e0fd4d28121b64aeb02e93171988352ae0db"}},{"ruleId":"D1","level":"warning","message":{"text":"loadRuns (cyclomatic 19): loadRuns has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"typescript2/app-speedtest/api-server.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6cacccb8c78eecc5dd955ac6cc72503082700a06c59fc217fa523f69f70cc7"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlGeneratedCodecContext.ReadUnionCore (cyclomatic 18): BamlGeneratedCodecContext.ReadUnionCore has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedCodec.cs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"4068ffaaef405c81b2f2df0e3b09fe963749462f586e1332977d37f7574a88da"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlGeneratedRegistry.CreateCanonicalType (cyclomatic 18): BamlGeneratedRegistry.CreateCanonicalType has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedRegistry.cs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a30d00453ad05278b8cc2a3365555425d566e686ce956b828934d5b87d394a"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlValue.From (cyclomatic 18): BamlValue.From has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: BamlTypeDescriptor.FromWire (cyclomatic 37) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Values/BamlValue.cs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"11af5ab767a01743cfdad3fa044f1b429593fb7090906defb8718c95a9e448df"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_builtins2_codegen::codegen::baml_type_to_input (cyclomatic 18): baml_builtins2_codegen::codegen::baml_type_to_input has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_builtins2_codegen/src/codegen.rs"},"region":{"startLine":2135}}}],"partialFingerprints":{"codehealthFindingId/v1":"12694a3c47ef4b516964eef950c731815c9a3a0f4b303bc6ccff66fa8f8ec36d"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_builtins2_codegen::codegen_io::emit_result_conversion_for_ty (cyclomatic 18): baml_builtins2_codegen::codegen_io::emit_result_conversion_for_ty has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs"},"region":{"startLine":2720}}}],"partialFingerprints":{"codehealthFindingId/v1":"e503d7d654c502b85f0ba7ddcf2e7f47811a91121da8f2bd9d0899bc6db6e640"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_cli::describe_command::write_interface_body (cyclomatic 18): baml_cli::describe_command::write_interface_body has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"baml_language/crates/baml_cli/src/describe_command.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8c90cc007f78cd6a461a3e26441cc64ded32b2a7a8a8b696736b2d7b8f5696"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_ast::lower_tree::body::object_literal (cyclomatic 18): baml_compiler2_ast::lower_tree::body::object_literal has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: baml_compiler2_ast::lower_tree::body::binary_expr (cyclomatic 20) 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":"baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ba0f771f9de3c74f64c47665c0197b1d871c6cdd43ccabd997ef6444b04791"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_emit::analysis::collect_def_use (cyclomatic 18): baml_compiler2_emit::analysis::collect_def_use has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/analysis.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"214be37da3654fd7322997e0f2a0a910776670213f66f4495c2d0008d0a61203"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticIndexBuilder::walk_stmt (cyclomatic 18): SemanticIndexBuilder::walk_stmt has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: SemanticIndexBuilder::render_type_expr (cyclomatic 23) 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":"baml_language/crates/baml_compiler2_hir/src/builder.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a60d4b4706aa0b73c288420e89608fde638fb8f99aecf834f54e914a4cecea"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::take_unresolved_infer_diagnostics (cyclomatic 18): InferenceContext::take_unresolved_infer_diagnostics has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":12294}}}],"partialFingerprints":{"codehealthFindingId/v1":"5656fd1ba47670133645906b623071525d7273b1d98ace14a460900071ba16b0"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_member_access (cyclomatic 18): LoweringContext::lower_member_access has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":10524}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba6e157bf49ca30d2fceffcfa6c36188f1d97b4bac481fd43e65dbeee0da6db"}},{"ruleId":"D1","level":"warning","message":{"text":"Analysis::new (cyclomatic 18): Analysis::new has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/optimize/effects.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1fc3b2f350f184ecf1b08791cf47e60dfa71358e4de78997a0fb565eea7f70"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_mir::memory::walk_rvalue_type_slots (cyclomatic 18): baml_compiler2_mir::memory::walk_rvalue_type_slots has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/memory.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd98cc8468ca697d434e26ad4202e58965c9b453f8dc69c8e7b3c6c97f39587"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_rust::init::generate (cyclomatic 18): baml_compiler2_rust::init::generate has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_rust/src/init.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"50cc9faffabc6a663ff3bc3bd3bd24a5d807dc4ea859e9cb53cb1e4e09aa5ade"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_db::check::new_tir_diagnostic (cyclomatic 18): baml_db::check::new_tir_diagnostic has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: baml_db::check::tir_type_error_to_diagnostic_id (cyclomatic 127) 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":"baml_language/crates/baml_db/src/check.rs"},"region":{"startLine":1838}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4c0e67da6dd363f0d5ace97b8bfa17c3c9fad029c7d61d22b64c5ab8ee4002"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_ide::tokens::index::index_function (cyclomatic 18): baml_ide::tokens::index::index_function has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/tokens/index.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe14a824154f21f642883290678e4bfd14c77e0e9828a646b4de320ccc23b19"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_linker::space::relocate (cyclomatic 18): baml_linker::space::relocate has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_linker/src/space.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f3b9af553f4e1e9f906b2414c89f788f59f3e90c57ba7f039b770ff6c87609"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_lsp_server::run_stdio_loop (cyclomatic 18): baml_lsp_server::run_stdio_loop has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/lib.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefcbd3499f9a824f389b1082363b44f774b41cf5f0d52c0093af73aba665dac"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_lsp_server::lsp_ingress::lifecycle_action (cyclomatic 18): baml_lsp_server::lsp_ingress::lifecycle_action has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/lsp_ingress.rs"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5471a014cc500d2283a35a840b2e9b73418cc0fe30b054255d261418026c0a"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_lsp_server::playground_server::playground_ws_session (cyclomatic 18): baml_lsp_server::playground_server::playground_ws_session has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"450e172b616ace185f5d14619c86e79c28e34d13957e645543d26863fa2386a6"}},{"ruleId":"D1","level":"warning","message":{"text":"Translator::select (cyclomatic 18): Translator::select has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/sql.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"629402dc525226133861252dba6ff2c351e32607605f46c322ad28fb9f7bc703"}},{"ruleId":"D1","level":"warning","message":{"text":"Translator::navigation (cyclomatic 18): Translator::navigation has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/sql.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33a1a315a6adbbae3a3ee74e3dc55e4261ddc2b097c3b92ea2e0c0b3a280dec"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_type::normalize::mu::algebra_pass (cyclomatic 18): baml_type::normalize::mu::algebra_pass has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/normalize/mu.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d833df4480739547091d141f71f0348365ea1556b113b1f14ee7a6d3046170"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_type::normalize::mu::convert (cyclomatic 18): baml_type::normalize::mu::convert has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/normalize/mu.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"528ea78220fbf5b55642b90521d448f11cb2d05c2792f8fc27837fdfcdef631a"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_events::history::history_run_matches_filter (cyclomatic 18): bex_events::history::history_run_matches_filter has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_events/src/history/mod.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91af5fce30bb49c8c3bb4f26c907317908ad8b806133876da99c9c3d576f868"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_events::run::run_matches_filter (cyclomatic 18): bex_events::run::run_matches_filter has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_events/src/run.rs"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"f346377047926aadd3ee7f79eab5d34802bac28c3046dd0846cba48d75742aa1"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectRuntimeCompiler::compile (cyclomatic 18): ProjectRuntimeCompiler::compile has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_project/src/runtime_compile.rs"},"region":{"startLine":1660}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed2d96e619b4b2387e170af7b1fcd59b96be73a131de2bc17366b1e842ba2aa"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_project::runtime_compile::owned_diagnostic (cyclomatic 18): bex_project::runtime_compile::owned_diagnostic has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 7 of the 18 points are its own statements and the rest belongs to 2 function items inside it that branch (highlight_kind, owned_text). 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":"baml_language/crates/bex_project/src/runtime_compile.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e617415e720990998210fe5d27fd35143b2e7bd5b26472a0383a3ed8e01ae18"}},{"ruleId":"D1","level":"warning","message":{"text":"BexVm::resume_compiled (cyclomatic 18): BexVm::resume_compiled has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm/compiled_rt/frame.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a806f768e01a3ebc06b7048f98d64c9964081f14b9a9ced47048fe858eca76a"}},{"ruleId":"D1","level":"warning","message":{"text":"BexVm::finish_trace_hook_config (cyclomatic 18): BexVm::finish_trace_hook_config has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: bex_vm::vm::value_type_tag (cyclomatic 30) 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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":2695}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3e1277a7f54f21417b245ce6be656e0025cccd721193006b7e4aab43f684ed"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm::package_baml::toml::snapshot (cyclomatic 18): bex_vm::package_baml::toml::snapshot has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/toml.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7c252f5aa44d270c9c6fb7f82f25569ee14d4aa80b9cde12af4ed7861f4891"}},{"ruleId":"D1","level":"warning","message":{"text":"bridge_encode::rules::javascript (cyclomatic 18): bridge_encode::rules::javascript has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_encode/src/rules.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"97adcabd3e5445dd7f89c4555f4a0693e01a62d08fb413b2c016a92fe8048d1f"}},{"ruleId":"D1","level":"warning","message":{"text":"WasmIoFs::mkdir (cyclomatic 18): WasmIoFs::mkdir has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_wasm/src/wasm_io_fs.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"60165acb1e5b6b425633282898970f67521a4da2a2843586978e9212d6a35622"}},{"ruleId":"D1","level":"warning","message":{"text":"Processor::process_available (cyclomatic 18): Processor::process_available has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_processor/src/lib.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"8caf137e52c92a23454f2f2a6238a484104859850fb8929073e8eacb49caad9f"}},{"ruleId":"D1","level":"warning","message":{"text":"Code::group (cyclomatic 18): Code::group has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_reader/src/value/code.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a74f53c3c6d0cb374d56c58b114dfa206289da62a393f73d8545be2d86e4ef"}},{"ruleId":"D1","level":"warning","message":{"text":"btel_snapshot::walk::object (cyclomatic 18): btel_snapshot::walk::object has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_snapshot/src/walk.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c599d6e6c348205baebc8fcd7dea311cc012a5905a640e4664500e5cbc69a5"}},{"ruleId":"D1","level":"warning","message":{"text":"WasmHost::call_registered_callable_with_context (cyclomatic 18): WasmHost::call_registered_callable_with_context has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_wasm/src/host_value.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"5969ab93c98fbb8d18d9015bab22f54fabe427db4c53424d05cc11cb875df548"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_go::generated_functions (cyclomatic 18): sdkgen_go::generated_functions has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: sdkgen_go::baml_type_descriptor_with (cyclomatic 32) 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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ba05c47cf3bc0be7179cf0563f1a68b67baa88722199d9cad5fcdf38273c8e"}},{"ruleId":"D1","level":"warning","message":{"text":"PyValue::shape (cyclomatic 18): PyValue::shape has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/bridge_python/src/encode.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"663288a1871c00427d5bf24200adbeaed3b3aede3120ffeb853f1df7c4924a1c"}},{"ruleId":"D1","level":"warning","message":{"text":"MermaidGeneratorContext::render_mermaid_graph (cyclomatic 18): MermaidGeneratorContext::render_mermaid_graph has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to one function item inside it that branches (emit). 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":"engine/baml-lib/ast/src/ast/baml_vis/diagram_generator.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d57c373a57a37769c96c129e7ae3230a6b5a65ebcb93136204e8724b63c1e1"}},{"ruleId":"D1","level":"warning","message":{"text":"jsonish::deserializer::coercer::coerce_union::try_cast_union (cyclomatic 18): jsonish::deserializer::coercer::coerce_union::try_cast_union has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/deserializer/coercer/coerce_union.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ed5b76d6b3286534d5ebeb30ff8d205347c22711fe0d9d408ef5ec69216f5f"}},{"ruleId":"D1","level":"warning","message":{"text":"InitUI::render (cyclomatic 18): InitUI::render has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/cli/init_ui.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32b95f390df4fc803baf3b6ce88e79cdaca0c8be171f14a8a35ea95ad89e892"}},{"ruleId":"D1","level":"warning","message":{"text":"CandidateApplier::update_field_attributes (cyclomatic 18): CandidateApplier::update_field_attributes has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/applier.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f715a1d456164c7277a43c25aede3bfcb7f4cdbbc75cc9d575ea0fd8ed6b6e"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_runtime::internal::llm_client::primitive::openai::response_handler::scan_openai_responses_stream (cyclomatic 18): baml_runtime::internal::llm_client::primitive::openai::response_handler::scan_openai_responses_stream has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/openai/response_handler.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c86fe4b8ccfdc9d067dddfcfb54a048955b0f56011cc93cbb08f997d815423"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_runtime::optimize::tui::display_pareto_and_select (cyclomatic 18): baml_runtime::optimize::tui::display_pareto_and_select has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/tui.rs"},"region":{"startLine":1683}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e3a6298618b5860bd588f746de5acb95d53e36bec39f27f86964cb429e5268"}},{"ruleId":"D1","level":"warning","message":{"text":"TypePy::serialize_type (cyclomatic 18): TypePy::serialize_type has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/python/src/type.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"89197a83aecadac3573dc460b22bc9975f57bcc1a5c306673f726b0eca989e53"}},{"ruleId":"D1","level":"warning","message":{"text":"generators_ruby::ir_to_rb::type_to_rb (cyclomatic 18): generators_ruby::ir_to_rb::type_to_rb has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/ruby/src/ir_to_rb/mod.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f067e62442ceebe1d6aadf7658bd7f424acd753d3bdad7700becbaf9907a05e1"}},{"ruleId":"D1","level":"warning","message":{"text":"language_server::server::api::request (cyclomatic 18): language_server::server::api::request has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/server/api.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a869cdc61587885704bd30ec15dc252cadadce5fac43be312518630bf5d31af4"}},{"ruleId":"D1","level":"warning","message":{"text":"playground_server::handlers::webview_rpc::webview_rpc_handler (cyclomatic 18): playground_server::handlers::webview_rpc::webview_rpc_handler has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/playground-server/src/handlers/webview_rpc.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b4bf0063f2130c5e59596d0f025d38451652f35d974d81273a8f7a63014d84"}},{"ruleId":"D1","level":"warning","message":{"text":"ProtoReader.decodeClassWithDesc (cyclomatic 18): ProtoReader.decodeClassWithDesc has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: ProtoReader.decodeWithDesc (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4d31f0e1da83a1c6e1485b8306ba65d5e323e32b3437305f0d4aa01afddd7c"}},{"ruleId":"D1","level":"warning","message":{"text":"telemetry_resources.monitor (cyclomatic 18): telemetry_resources.monitor has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/scripts/telemetry_resources.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07adbe5bc04a004bbd3bef376cf7fadd80055db5e8fc4922d59d61235fcd038"}},{"ruleId":"D1","level":"warning","message":{"text":"btel_query_summary.query_section (cyclomatic 18): btel_query_summary.query_section has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/btel_query_summary.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd13dee20aca1e7bf5e3f6fdfa4ab62ff9c7cf70636b6ecbe1e86b031be00c7"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_go.currentRuntimeConfig (cyclomatic 18): baml_go.currentRuntimeConfig has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/runtime_artifact.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"865e8e5e87794f12405e3a91c37e209288c93c506a84c3bc74af330793c1b63d"}},{"ruleId":"D1","level":"warning","message":{"text":"Encode.swift.encodeCallArgs (cyclomatic 18): Encode.swift.encodeCallArgs has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/Encode.swift"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3ff626652bc961d3001ff78b6f2d7a1766bdfa7a38e0e19cc4b12ceba9397b"}},{"ruleId":"D1","level":"warning","message":{"text":"index.testOptionalFields (cyclomatic 18): index.testOptionalFields has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/optional_nullable/typescript/index.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce023afa9dee039acacdda86eb0c75119e21e93160b8d9440cdb1c5d1f101104"}},{"ruleId":"D1","level":"warning","message":{"text":"index.testComplexUnions (cyclomatic 18): index.testComplexUnions has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/union_types_extended/typescript/index.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa288c1c64d79d1f9916784f803a263730523acf178a50c6f156f6cafc63337"}},{"ruleId":"D1","level":"warning","message":{"text":"ExecutionLogPanel.ExecutionLogPanel (cyclomatic 18): ExecutionLogPanel.ExecutionLogPanel has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 425, 352, 344, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/detail-panel/components/ExecutionLogPanel.tsx"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"41467125aa56c1ed478f0365a4b52bb066d5bbe2df42c8446650d28f576a69c1"}},{"ruleId":"D1","level":"warning","message":{"text":"useEdgeDraggable.useEdgeDraggable (cyclomatic 18): useEdgeDraggable.useEdgeDraggable has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to 6 function items inside it that branch (onDragging, onDragStart, isDraggingEdge, \u2026). 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":"typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/useEdgeDraggable.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda1133e93e44727ca4c9d7f4fd154321486ca1948f42097f15db94e4fa111db"}},{"ruleId":"D1","level":"warning","message":{"text":"index.DiamondNode (cyclomatic 18): index.DiamondNode has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 3 function items inside it that branch (getStateStyle, a function literal at line 119, a function literal at line 105). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/nodes/DiamondNode/index.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"162dd1cab48c0e62dc931d550604f39df53d3803a3405565a18141f0aedfacd8"}},{"ruleId":"D1","level":"warning","message":{"text":"code-mirror-viewer.CodeMirrorViewer (cyclomatic 18): code-mirror-viewer.CodeMirrorViewer has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 243, 416, 147, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/codemirror-panel/code-mirror-viewer.tsx"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca398215b6b0ce02ab9d50f4126e0efef4b836a1f823b183e3f044210a4d6fda"}},{"ruleId":"D1","level":"warning","message":{"text":"bep-submit-modal.BepSubmitModal (cyclomatic 18): bep-submit-modal.BepSubmitModal has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 belong to 4 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-submit-modal.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"094471e3065f8075bb1ae15a268d7f6514b9a901da1a4c74b40f886ef15563b3"}},{"ruleId":"D1","level":"warning","message":{"text":"issue-form.IssueForm (cyclomatic 18): issue-form.IssueForm has cyclomatic complexity 18 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/issues/issue-form.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8004478a3700f571a1e9eab0a6a2f3ace1f034cd691f07aa238e44709aa8d817"}},{"ruleId":"D1","level":"warning","message":{"text":"app.Reveal (cyclomatic 18): app.Reveal has cyclomatic complexity 18 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 6 belong to 4 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-type-quiz/src/app.tsx"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"4278abea47dd1fc1ae781d4b701b95900fa44f1b66fd6408961b65c3b8130d86"}},{"ruleId":"D1","level":"warning","message":{"text":"software.Figure (cyclomatic 18): software.Figure has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 339, 336, 354, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/software.tsx"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0deed0fd8afb0d884d18ea8f3603526244f858f04b21d7cbe3932c438725094"}},{"ruleId":"D1","level":"warning","message":{"text":"meter.Images (cyclomatic 18): meter.Images has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 384, 299, 425). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/pricing/meter.tsx"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e25d4d4255e71456866f6619db038790123ed821f5802f0601b24b68c57711"}},{"ruleId":"D1","level":"warning","message":{"text":"evidence.reparentToRetainedAncestors (cyclomatic 18): evidence.reparentToRetainedAncestors has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. 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":"typescript2/pkg-playground/src/telemetry/evidence.ts"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"296091d2e83511ab5c522c1c92fee85428b27d52ae8707d216980c53d1eb5746"}},{"ruleId":"D1","level":"warning","message":{"text":"TelemetryView.ContextTreeRows (cyclomatic 18): TelemetryView.ContextTreeRows has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":2985}}}],"partialFingerprints":{"codehealthFindingId/v1":"901dc3683b43df95c06f23120fe620a83c26a3bc5b06ea68728c91fb150f1647"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_builtins2_codegen::extract::extract_scoped (cyclomatic 17): baml_builtins2_codegen::extract::extract_scoped 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":"baml_language/crates/baml_builtins2_codegen/src/extract.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"156763006b65dd42ea242cd5078586a2c9b9d05d45dc90cd4d567208d7d8e121"}},{"ruleId":"D1","level":"warning","message":{"text":"RunArgs::run_expression (cyclomatic 17): RunArgs::run_expression has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/run_command.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5464ac1b453bd9a5b4515108f5807605881bf32da6822e1d794ed9cc3caf78"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_emit::compute_function_metadata (cyclomatic 17): baml_compiler2_emit::compute_function_metadata has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/lib.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"0725781259b141755c35c0db94450dc53eb7ad13e21d6dfa7ae99ada2cc010e4"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_emit::analysis::rematerializable (cyclomatic 17): baml_compiler2_emit::analysis::rematerializable has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/analysis.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4db924d58f2e8ccde50b54fefef52b00bd1800b24ee7b39052eae69a2dbdffb"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_hir::body_type_refs::collect_body_type_refs (cyclomatic 17): baml_compiler2_hir::body_type_refs::collect_body_type_refs has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir/src/body_type_refs.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"032720e44ea0351198fe3034a511341805e48206290e7afc4c556d69401f27be"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::seed_implicit_llm_schema (cyclomatic 17): InferenceContext::seed_implicit_llm_schema has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":6181}}}],"partialFingerprints":{"codehealthFindingId/v1":"541017e0d95e9cfe7137447929ca4e05a5b6c810ca9e4d00e021b446424baa15"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::infer_source_object (cyclomatic 17): InferenceContext::infer_source_object has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":9612}}}],"partialFingerprints":{"codehealthFindingId/v1":"12556b8194fd1e89730352a44640500237d0cd025da3b8872d044160a2339238"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::infer_exported_object (cyclomatic 17): InferenceContext::infer_exported_object 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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":9819}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7506159c87b8ec8ceb84a4a6bd06721732adf24d21fd945b68c466c29f495b"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_hir_ty::infer::reachability::add_diagnostics (cyclomatic 17): baml_compiler2_hir_ty::infer::reachability::add_diagnostics 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":"baml_language/crates/baml_compiler2_hir_ty/src/infer/reachability.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"02465479bd4ac9e17a2ba28a0b145c25b32924fbd8debe3056c923c20c9913c0"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_hir_ty::init_io::evaluated_calls_impl (cyclomatic 17): baml_compiler2_hir_ty::init_io::evaluated_calls_impl has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/init_io.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa768125e419f75d06312d4830f6cc5831db8e90728546faee9678d99ef59295"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_rust::admit::recursive_functions (cyclomatic 17): baml_compiler2_rust::admit::recursive_functions 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":"baml_language/crates/baml_compiler2_rust/src/admit.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"471b836a2bd61e0c2fadc2e4aec81b9594e19e290cae694f2c9e55b1f59b69df"}},{"ruleId":"D1","level":"warning","message":{"text":"PrintChain::try_print_members_single_line (cyclomatic 17): PrintChain::try_print_members_single_line has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: AnyExpr::single_line_width (cyclomatic 31) 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":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":3350}}}],"partialFingerprints":{"codehealthFindingId/v1":"010f0efe8548174aa6d4283e53fe1abbf69cb67589903700f6362b4f5a5499d6"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_ide::resolve::receiver_at_dot (cyclomatic 17): baml_ide::resolve::receiver_at_dot 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":"baml_language/crates/baml_ide/src/resolve.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86e4059ccdb06df6bc87da1d2dbd324ed2cb7e193f0b636dae8ac16a00fe1d4"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_lsp_server::playground_server::proxy_ws (cyclomatic 17): baml_lsp_server::playground_server::proxy_ws has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":2503}}}],"partialFingerprints":{"codehealthFindingId/v1":"843e5df121d49b1ab8901bba72df247277c757499791d78488c6f817e50e36e1"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_parser::items::alloc_docs (cyclomatic 17): baml_parser::items::alloc_docs has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4605689774ec718c64d011250648f6bb9324874bb97247142a1375337bcb711"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_parser::items::impl_members (cyclomatic 17): baml_parser::items::impl_members 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":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"73351187290e893a87f0211e78cc746a33515c982e89efc736372c744f0ce9be"}},{"ruleId":"D1","level":"warning","message":{"text":"Fetcher::install_to_toolchain_root_with_force (cyclomatic 17): Fetcher::install_to_toolchain_root_with_force has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_release/src/lib.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f8268f699366f7ee668b5832419732dfed994d9ba76984e9dd481be3af5599"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonInhabitance::node (cyclomatic 17): JsonInhabitance::node has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/json_inhabit.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"109897d2bf2e7dc04dbc3f523ed28ac12da40296712d2d93960bdf009ec02388"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_engine::conversion::collect_live_type_var_bindings (cyclomatic 17): bex_engine::conversion::collect_live_type_var_bindings has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: bex_engine::conversion::value_matches_type (cyclomatic 35) 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":"baml_language/crates/bex_engine/src/conversion.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3c9c8a00b99b2108ff1b987695c3ccc2c9912675566bdb4f5a27bbd7ebe117"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_engine::conversion::find_matching_union_member (cyclomatic 17): bex_engine::conversion::find_matching_union_member has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: bex_engine::conversion::value_matches_type (cyclomatic 35) 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":"baml_language/crates/bex_engine/src/conversion.rs"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"3750b2a0a255c3ec4de8cdaaa3a0c6e177c11e5a1c6b7ce78e0318a4e529e097"}},{"ruleId":"D1","level":"warning","message":{"text":"BexHeap::verify_object_invariants (cyclomatic 17): BexHeap::verify_object_invariants has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_heap/src/heap_debugger/real.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"e372900f2ae3cb742a317183553aeecc107edf181ee8b112ec95746dd571c691"}},{"ruleId":"D1","level":"warning","message":{"text":"FloatTy::coerce (cyclomatic 17): FloatTy::coerce 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":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"68394fd83f02eb7daa8b673585f442bb1b35353d9ce10e84f4577a0631f59369"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::open_instance (cyclomatic 17): Walker::open_instance 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":"baml_language/crates/bex_vm/src/package_baml/json/encode.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a25283296826d5ed4643710e99b8ad884b747e5e3e43bfe7d86076e6f3577fd"}},{"ruleId":"D1","level":"warning","message":{"text":"ImplResolver::hash_eligible (cyclomatic 17): ImplResolver::hash_eligible has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/resolve.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"39759828061433fdd5140dc9d346e803d15690a36b5fdbae5270596d5f921daf"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderDefinitionEquivalence::definitions_equivalent (cyclomatic 17): RenderDefinitionEquivalence::definitions_equivalent 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":"baml_language/crates/bex_vm/src/package_reflect/type_class.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"94925a21c7339df83308460c80861a0f1bfd82eeae8a82fc96661351b8e946bd"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm::call_specialize::specialize_calls (cyclomatic 17): bex_vm::call_specialize::specialize_calls 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":"baml_language/crates/bex_vm/src/call_specialize.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd02334f796b1815a24ba3152f62c5ba75c157370f2df19bf1a1e33f1155f898"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm::package_baml::csv::decode_record_to_instance (cyclomatic 17): bex_vm::package_baml::csv::decode_record_to_instance 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":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":1560}}}],"partialFingerprints":{"codehealthFindingId/v1":"95835b11a863650774e361ec57859be054ee98eaec7769b3db0d548ebc3d9fbe"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm::package_baml::toml::reconcile (cyclomatic 17): bex_vm::package_baml::toml::reconcile 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":"baml_language/crates/bex_vm/src/package_baml/toml.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f89bea6a68b8533f10f330292d6486fc7c32603505e28ad3aa18231a127f470"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm::package_reflect::type_class::first_open_interface (cyclomatic 17): bex_vm::package_reflect::type_class::first_open_interface 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":"baml_language/crates/bex_vm/src/package_reflect/type_class.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62bcd7296f8998a79abd4b796fbce47d33edb07c0de877a23b80b22862a3049"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm::package_reflect::type_class::expanded_type_value_nominals (cyclomatic 17): bex_vm::package_reflect::type_class::expanded_type_value_nominals 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":"baml_language/crates/bex_vm/src/package_reflect/type_class.rs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde2dbdb9316c47ac2e0dc4bc5fac1f7630a23375d37cfb012cfced7d359453c"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader::object (cyclomatic 17): Reader::object has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_snapshot/src/decode.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"8554c34e9c09c9bffe1f2d8a54cb12fe85abfe5fb5ac274079c0d71f7664985e"}},{"ruleId":"D1","level":"warning","message":{"text":"SseParser::feed (cyclomatic 17): SseParser::feed 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":"baml_language/crates/sys_types/src/sse.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"df517719a147aa517c6d955d20a2e57542961f049b8569e256f11351c1a453ae"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_java::emit::render_class (cyclomatic 17): sdkgen_java::emit::render_class has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/sdkgen_java/src/emit.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a24c5416bbbfb06e6e97bd9441f78f928b6bcd064c9888b29778a63596e29a1"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_rust::analyze::compute_sccs (cyclomatic 17): sdkgen_rust::analyze::compute_sccs 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":"baml_language/sdks/rust/sdkgen_rust/src/analyze.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdad7643590d0e30609d3a3f6e1ea6a60024701fb93ed4b7d1e0fd752f091669"}},{"ruleId":"D1","level":"warning","message":{"text":"internal_baml_ast::parser::parse_named_args_list::parse_named_argument_list (cyclomatic 17): internal_baml_ast::parser::parse_named_args_list::parse_named_argument_list 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":"engine/baml-lib/ast/src/parser/parse_named_args_list.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda69bcde55368eb45b8c75de7f7f02e4413963275a918d92cc907af5e6277ad"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_runtime::cli::init::generate_main_baml_content (cyclomatic 17): baml_runtime::cli::init::generate_main_baml_content has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/cli/init.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4e6fd2f7a64a1a2cf88538c0eeee7b9c4540838ea09441be1c0c47fbde8c2b"}},{"ruleId":"D1","level":"warning","message":{"text":"WasmRuntime::list_testcases (cyclomatic 17): WasmRuntime::list_testcases has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f8cb3f97da47c86a26c477ae8c2cf1abb7a202fc1115897b7a978bf88a8289"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_vm::debug::display_bytecode (cyclomatic 17): baml_vm::debug::display_bytecode has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-vm/src/debug.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"70bafbd64489344fff03e83e1abad3b8f3ddea4bc54d1a4a3c05bf40d82f214f"}},{"ruleId":"D1","level":"warning","message":{"text":"PreOrderTraversal::from_root_dyn_impl (cyclomatic 17): PreOrderTraversal::from_root_dyn_impl has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/boundary-udf/src/yaml2jinja.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba77d2f1f71f764f317a7730d1403a3d8abfc4da20cc4407be6059affe6d3094"}},{"ruleId":"D1","level":"warning","message":{"text":"generators_typescript::watchers::build_event_collectors (cyclomatic 17): generators_typescript::watchers::build_event_collectors 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":"engine/generators/languages/typescript/src/watchers.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a4e415b3765a0dbb0f3073712ee7690bb67305e1407a42e4196dad4788149a"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_pack_host::finalize_dispatch (cyclomatic 17): baml_pack_host::finalize_dispatch has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_pack_host/src/lib.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41b29ac1874353303228fc78bc7441254d026be92aa60e610e53db65e2c44b1"}},{"ruleId":"D1","level":"warning","message":{"text":"csharp-mtime-cache.restore (cyclomatic 17): csharp-mtime-cache.restore 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":".github/scripts/csharp-mtime-cache.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc009dd2aac2cd1767a1fb995c54ee3b92bcb5c57eba6567f13623705fa1dc6"}},{"ruleId":"D1","level":"warning","message":{"text":"telemetry_resource_report.render_report (cyclomatic 17): telemetry_resource_report.render_report 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":"baml_language/scripts/telemetry_resource_report.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e54193af00df51a3be1114bf792499802466dec02dbb0e2ed5ae6dee0bdc778"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_go.decodeGeneratedClass (cyclomatic 17): baml_go.decodeGeneratedClass 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":"baml_language/sdks/go/baml_go/dynamic.go"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78a3c9048ddbfc5c70b1aeea86042794c9ec0b03bd06281b65b7e2abd6385de"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_go.encodeCallForDispatchWithTargetAndTypeArgs (cyclomatic 17): baml_go.encodeCallForDispatchWithTargetAndTypeArgs has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"baml_language/sdks/go/baml_go/runtime.go"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2556f9e6a9cff25cad20926b27dab3cafe2c785b57f40ed92f2eef3d9cd57a"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_go.resolveManifestArtifact (cyclomatic 17): baml_go.resolveManifestArtifact 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":"baml_language/sdks/go/baml_go/runtime_artifact.go"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9f3d5b2b99ff51ce20e4cb78dc0add663ec786f816be0c7330164214bf9659"}},{"ruleId":"D1","level":"warning","message":{"text":"kpis.html.standing (cyclomatic 17): kpis.html.standing has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 6 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/src/speedtest/templates/kpis.html"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3d2673563c3266847cba3590166e4b24fb422fec80caecfd33fbb49f90bb2a"}},{"ruleId":"D1","level":"warning","message":{"text":"index.testNumberEdgeCases (cyclomatic 17): index.testNumberEdgeCases has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/edge_cases/typescript/index.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"246ef0027925bdc9170f2c0cabf27969c2eac07dc629b58f9049dbae7ab51edd"}},{"ruleId":"D1","level":"warning","message":{"text":"index.testNullableTypes (cyclomatic 17): index.testNullableTypes has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/optional_nullable/typescript/index.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c878d89ef1698a64312b57bb3e3e6e3fe74c3d6f0f38dfc703b75174b1ca0375"}},{"ruleId":"D1","level":"warning","message":{"text":"Node.Node (cyclomatic 17): Node.Node has cyclomatic complexity 17 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 8 belong to 5 function literals inside it that branch. 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":"typescript/apps/fiddle-web-app/app/[project_id]/_components/Tree/Node.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"08615a79d1815ee3cd6827f08f4064bd54bbc8ad0c6b5f5a4c33ea4e0434d2a6"}},{"ruleId":"D1","level":"warning","message":{"text":"simulator.simulateExecution (cyclomatic 17): simulator.simulateExecution 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":"typescript/packages/playground-common/src/sdk/runtime/simulator.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6aba54c93e8c446cf7983c10f896688c6138560e6414300d0c15eb3dc9cdafd"}},{"ruleId":"D1","level":"warning","message":{"text":"date-picker-input.DatePickerInput (cyclomatic 17): date-picker-input.DatePickerInput has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 19, 63). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/custom/date-picker-input.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d162fc2c3b5235761df6224007bf040ea5ef9fe7e1c6ac9c1a8822d86f85396"}},{"ruleId":"D1","level":"warning","message":{"text":"page.LoginContent (cyclomatic 17): page.LoginContent has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 3 function items inside it that branch (handlePasskeySubmit, a function literal at line 40, handleGitHubLogin). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/login/page.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0d50b3d6b04ea28924a6308ca546052965f219a0d446003444e3b3c4fab55d"}},{"ruleId":"D1","level":"warning","message":{"text":"version-analysis-status.VersionAnalysisStatus (cyclomatic 17): version-analysis-status.VersionAnalysisStatus has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ai-assistant/version-analysis-status.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ec61806c912af2e6c5c1a7cdd3c0932b1abb6488d4becdae3a336868ac781f"}},{"ruleId":"D1","level":"warning","message":{"text":"bep-export-dialog.BepExportDialog (cyclomatic 17): bep-export-dialog.BepExportDialog has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. 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":"typescript2/app-beps/src/components/bep/bep-export-dialog.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a287d44c83d50aa127e507fad2bf7f3717b5b2d799a55b027a0a7e72aec7e01e"}},{"ruleId":"D1","level":"warning","message":{"text":"bcs-auth.verify (cyclomatic 17): bcs-auth.verify has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/bcs-auth.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b99abc79dfb694f2f8b4379766ffb94e65a80b6d76c3a4a3c9614550679d210"}},{"ruleId":"D1","level":"warning","message":{"text":"export-utils.generateAgentContext (cyclomatic 17): export-utils.generateAgentContext has cyclomatic complexity 17 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 7 belong to 6 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/export-utils.ts"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66541318fcc9c4f8b4f7f26b4a00d52a0083ce9eafd4ae121b94c62f849e17d"}},{"ruleId":"D1","level":"warning","message":{"text":"generated-reference.GeneratedReferenceContent (cyclomatic 17): generated-reference.GeneratedReferenceContent has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. 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":"typescript2/app-developer-docs/components/generated-reference.tsx"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed23111e41439033f4e88c5b2a6a7d6b442d8aeacaf2c89b7102882758a4a80"}},{"ruleId":"D1","level":"warning","message":{"text":"send-slack-report.captureDashboardOnce (cyclomatic 17): send-slack-report.captureDashboardOnce has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. 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":"typescript2/app-product-metrics/src/jobs/send-slack-report.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"68421c97574913be10a12f49f01f404475c42022230eaefa47657dbcc4681f1a"}},{"ruleId":"D1","level":"warning","message":{"text":"types.buildGroups (cyclomatic 17): types.buildGroups has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. 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":"typescript2/app-stdlib-matrix/src/types.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"3693317564475dcee9d28d7f403ccdf0e7d3a29a181ab5faa40c884b0f35fe79"}},{"ruleId":"D1","level":"warning","message":{"text":"app.Question (cyclomatic 17): app.Question has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-type-quiz/src/app.tsx"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"1799e581775336ab00c94130e8f3fd805f59c913e7915c02c91189847ce6c6eb"}},{"ruleId":"D1","level":"warning","message":{"text":"teammate-emails.TeammateEmails (cyclomatic 17): teammate-emails.TeammateEmails has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 88, a function literal at line 99, addEmails). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/eap/teammate-emails.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f309009024c719101e8418c262e9654f6bd94e159b0715594a3b54c3803d8837"}},{"ruleId":"D1","level":"warning","message":{"text":"page.EpisodePage (cyclomatic 17): page.EpisodePage has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/podcast/[slug]/page.tsx"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd4c71f0c8c0b4f24313290efae08b8924a400b45d1dac08069903f8fc7a71e"}},{"ruleId":"D1","level":"warning","message":{"text":"architecture.Lanes (cyclomatic 17): architecture.Lanes has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 2 function items inside it that branch (a function literal at line 1813, side). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/adopt/architecture.tsx"},"region":{"startLine":1793}}}],"partialFingerprints":{"codehealthFindingId/v1":"81783aded983e55f12e256178b8eb15279edbc294358291ea879e2665b710ca8"}},{"ruleId":"D1","level":"warning","message":{"text":"language.Examples (cyclomatic 17): language.Examples has cyclomatic complexity 17 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. 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":"typescript2/app-website/components/home/language.tsx"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9f950f14e3b42422acdbb6805f39700a14ea87a7d6f9b7e3fb940318469603"}},{"ruleId":"D1","level":"warning","message":{"text":"review.Comment (cyclomatic 17): review.Comment has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 5 of the 17 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 1097, 1155, 1055, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/review.tsx"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1de65e2f5a1cf9f8be94cd8ab522629efdfb875c6e5077949b36ca538a226c2"}},{"ruleId":"D1","level":"warning","message":{"text":"luma-answers.readRegistrationAnswers (cyclomatic 17): luma-answers.readRegistrationAnswers 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":"typescript2/app-website/lib/luma-answers.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3f7cb133fd3560666472ae69bb8bc77d283acfeedb639ca11f91287c1a8a96"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_builtins2_codegen::codegen::call_arg_for_type (cyclomatic 16): baml_builtins2_codegen::codegen::call_arg_for_type has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_builtins2_codegen/src/codegen.rs"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf321f47f76ab28b9e69e4cf3343f2e8ceef458875f691bdeb0e1098e91cdc2"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_ast::lower_tree::items::lower_file_on (cyclomatic 16): baml_compiler2_ast::lower_tree::items::lower_file_on has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"6565671e312816fc965c66ec9551c77b3fdf02a363bdfa41d27b1b38855931c9"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_emit::package::type_pass (cyclomatic 16): baml_compiler2_emit::package::type_pass has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/package/mod.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"65505dbd350c67d066fe85460e43efde98436dd83763c5577a2998a885b23791"}},{"ruleId":"D1","level":"warning","message":{"text":"SemanticIndexBuilder::collect_invalid_builtin_throw_types (cyclomatic 16): SemanticIndexBuilder::collect_invalid_builtin_throw_types has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: SemanticIndexBuilder::render_type_expr (cyclomatic 23) 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":"baml_language/crates/baml_compiler2_hir/src/builder.rs"},"region":{"startLine":1959}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0245d1d1c2acf2264de687f0ddd1a49b0d017ae7305b7feeb2ef2d551db005"}},{"ruleId":"D1","level":"warning","message":{"text":"InferenceContext::try_solve_bounded_var (cyclomatic 16): InferenceContext::try_solve_bounded_var has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":14586}}}],"partialFingerprints":{"codehealthFindingId/v1":"94853f7ca6ab9c55d17adf51d18391be792637fcbfb6cfc3c19f1c1a68ccace6"}},{"ruleId":"D1","level":"warning","message":{"text":"LowerCtx::lower_definition (cyclomatic 16): LowerCtx::lower_definition has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5cca749ab425ff225cb773ffdd6994e84a1e0dd55de9c768aa24c2e425873a"}},{"ruleId":"D1","level":"warning","message":{"text":"LoweringContext::lower_match_chain (cyclomatic 16): LoweringContext::lower_match_chain has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: LoweringContext::convert_binop (cyclomatic 18) 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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":13168}}}],"partialFingerprints":{"codehealthFindingId/v1":"086653efa4c5d28f3528b5e4a5f6f3bf45a4371992eff2ba0286a5e5806e9eb3"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_mir::lower::lower_tir_template (cyclomatic 16): baml_compiler2_mir::lower::lower_tir_template has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: LoweringContext::convert_binop (cyclomatic 18) 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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a580c8f9d4e6812ce98301a0be1b8b10b569d051dab562bdd7e8a1d17116bc6"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_mir::pretty::write_statement (cyclomatic 16): baml_compiler2_mir::pretty::write_statement has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/pretty.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc19ad3c3069e9d7f8b73113a49c0adb9d53ade6250bc67dd52f13bdc97caea"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator::compiled_call (cyclomatic 16): Generator::compiled_call has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_rust/src/codegen/call.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4764d23bae32c365feb24765195b502271da811723b23958eef11a8f73d107"}},{"ruleId":"D1","level":"warning","message":{"text":"ProgramIndex::index_objects (cyclomatic 16): ProgramIndex::index_objects has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_rust/src/index.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ba5076186e17d96467c4dc60183bae7a63c5ccabfb3265ba2a9bddec55d61f"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_compiler2_visualization::control_flow::from_ast::collect_callee_names_stmt (cyclomatic 16): baml_compiler2_visualization::control_flow::from_ast::collect_callee_names_stmt has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99bd14b9484f3794ee48594f5ecb61ba9aaa285397999580e84dc81f3c1d58c"}},{"ruleId":"D1","level":"warning","message":{"text":"CompletionContext::new (cyclomatic 16): CompletionContext::new has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/completion/context.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaad456776219cc211eab33bc2f7e64eac046322e8d2eb2b731eb656af55a8b2"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_ide::cfg::expand_user_function_calls_in_graph (cyclomatic 16): baml_ide::cfg::expand_user_function_calls_in_graph has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/cfg.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"951971a994248b2b17ed44001504e758bbdd7c12f57658acea852da37030327e"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_ide::describe::describe_locals (cyclomatic 16): baml_ide::describe::describe_locals has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/describe.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41931b957864faae08df008476719b37479d5313f7bdee2250b100801927a48"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_query_btel::ingest::apply_fresh (cyclomatic 16): baml_query_btel::ingest::apply_fresh has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ac8df4c94e0049e4122149a37158cf1715b6b90ffffcf78589bd418a3cb249"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_query_btel::ingest::resolve_nodes (cyclomatic 16): baml_query_btel::ingest::resolve_nodes has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":2051}}}],"partialFingerprints":{"codehealthFindingId/v1":"328a04fc1473d0df51c6d9b89e2310983472191651320833e9ac593ac5542729"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_query_btel::ingest::context::identity (cyclomatic 16): baml_query_btel::ingest::context::identity has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/ingest/context.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d39a9ec1ed41b9a2b4d08c9e8a95ee3031abcdae7a3fae0d2847fddd8f3b71f"}},{"ruleId":"D1","level":"warning","message":{"text":"Id::single_line_width (cyclomatic 16): Id::single_line_width has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This is NOT this file\u0027s highest cyclomatic complexity: AnyExpr::single_line_width (cyclomatic 31) 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":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":2559}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbb45278fe9bc06b00cd2e06723d7d0232b41de0b5c6a09b6877114a8b7c388"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_type::decl_cycles::extract_type_alias_deps::visit (cyclomatic 16): baml_type::decl_cycles::extract_type_alias_deps::visit has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/decl_cycles.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bc444c72b57f50079efab63bc7e68541ba5310a624e6d3bdaeb32afdb4b2d0"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_type_runtime::solve_var (cyclomatic 16): baml_type_runtime::solve_var has cyclomatic complexity 16 (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":"baml_language/crates/baml_type_runtime/src/lib.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"a762843bacb977034b65257d77b46451579e358112ea8a7184917c73e44547a1"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeValue::try_cast (cyclomatic 16): TypeValue::try_cast has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/deserializer/coercer/coerce_primitive.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae1403e8dcd447243c5c21c5b0694f3b2d09712c4c242e043428e011444ba9d"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeCompileArtifactSlot::measure (cyclomatic 16): RuntimeCompileArtifactSlot::measure has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/compile_artifact.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"6feffdedfe2579042c955f31e2d9ce5b5587f61e9e7f49ef7975ecc515b48777"}},{"ruleId":"D1","level":"warning","message":{"text":"Structural::class (cyclomatic 16): Structural::class has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/json/decode.rs"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"b987ada7edf32f4bb26730e55c9e03b5a17dd1188f35d439ee1a2bb2fd9fe7e0"}},{"ruleId":"D1","level":"warning","message":{"text":"BexVm::visit_roots (cyclomatic 16): BexVm::visit_roots has cyclomatic complexity 16 (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. This is NOT this file\u0027s highest cyclomatic complexity: bex_vm::vm::value_type_tag (cyclomatic 30) 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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":12127}}}],"partialFingerprints":{"codehealthFindingId/v1":"240c78ca5766f78e54afd331428b5ac0245a3901e64f0ffaacd68dafa8b78a94"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm::debug::display_bytecode (cyclomatic 16): bex_vm::debug::display_bytecode has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/debug.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6bad78a12ecfdb278093637c81a42ef026be463c2591e28adbac68cb5c362d"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm::package_baml::csv::parse_writer_options (cyclomatic 16): bex_vm::package_baml::csv::parse_writer_options has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"01943b946c14c3689eabb406bf90057d21d8cbd72f71e96f2b55a1552b9168fb"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm::package_baml::csv::value_cell_text (cyclomatic 16): bex_vm::package_baml::csv::value_cell_text has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":1963}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb07ebbd843db8813905320fc09f8a3c2c056726ab32fced3e54ab2d7673c1c"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm::package_reflect::runtime_class_builder::prepare_group (cyclomatic 16): bex_vm::package_reflect::runtime_class_builder::prepare_group has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"a170bf3c8c5fdd458388c588ce4142f36509cf0877aaacffc06b4bb3e50f95ee"}},{"ruleId":"D1","level":"warning","message":{"text":"bex_vm::package_reflect::runtime_class_builder::planned_pending_type (cyclomatic 16): bex_vm::package_reflect::runtime_class_builder::planned_pending_type has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2eda3ed7cdda6b1c02afaaa67b952b71f22b069ce122b888f4c48690ea4548a"}},{"ruleId":"D1","level":"warning","message":{"text":"bridge_cffi::control_projection::clone_outbound (cyclomatic 16): bridge_cffi::control_projection::clone_outbound has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (clone_refs). 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":"baml_language/crates/bridge_cffi/src/control_projection.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c53bf17ebd7e085d34b78dbed42c95bed6f26edc45e15e28a2a69d0ef9b94e"}},{"ruleId":"D1","level":"warning","message":{"text":"bridge_cffi::invocation_protocol::validate_fields (cyclomatic 16): bridge_cffi::invocation_protocol::validate_fields has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_cffi/src/invocation_protocol.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"781ae9f734c8d90e076dd1e1c67e7b9f96d43aab79d372c16c874a68f045380d"}},{"ruleId":"D1","level":"warning","message":{"text":"FieldType::attributes (cyclomatic 16): FieldType::attributes has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: internal_baml_core::ir::repr::annotate_variable (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/ir/repr.rs"},"region":{"startLine":1784}}}],"partialFingerprints":{"codehealthFindingId/v1":"840fa2483aff86dc48c8abc695ca2625b6b503940157bbeaa5137fb58761a41f"}},{"ruleId":"D1","level":"warning","message":{"text":"btel_snapshot::memory::type_bytes (cyclomatic 16): btel_snapshot::memory::type_bytes has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_snapshot/src/memory.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6619f79354dbdec3b6a0eef1a3bc76f362914fd558b7b6404174aee43fe1fdc"}},{"ruleId":"D1","level":"warning","message":{"text":"sys_auth::io_bridge::split_command (cyclomatic 16): sys_auth::io_bridge::split_command has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_auth/src/io_bridge.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89d145a83439fa1eb0fc336465a89f3cd8d8f3b70c4eb49b3d3731fe8691ba4"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_csharp::semantic::collect_functions (cyclomatic 16): sdkgen_csharp::semantic::collect_functions has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: sdkgen_csharp::semantic::render_codec (cyclomatic 25) 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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":1682}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4256c4b04c552ffd9f332c09c1a94da9691d4a088746e120ec8c6b0927e935"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_go::add_function_surface_imports (cyclomatic 16): sdkgen_go::add_function_surface_imports has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: sdkgen_go::baml_type_descriptor_with (cyclomatic 32) 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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":2605}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a12abccb27878a2d3cee2d9e2559675be4ef9d044805f4ddbde36a2a30583a2"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_go::add_projected_surface_imports (cyclomatic 16): sdkgen_go::add_projected_surface_imports has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: sdkgen_go::baml_type_descriptor_with (cyclomatic 32) 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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":2773}}}],"partialFingerprints":{"codehealthFindingId/v1":"495bc675f7aee686a403c29f94aa90771596bc2179ecdee05fca7e84cd0f7c1d"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_go::render_union_codecs (cyclomatic 16): sdkgen_go::render_union_codecs has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: sdkgen_go::baml_type_descriptor_with (cyclomatic 32) 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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":4050}}}],"partialFingerprints":{"codehealthFindingId/v1":"364569ee9b83c3887882814395c9ea90158c0b4fd34e87805fbb95533192c32f"}},{"ruleId":"D1","level":"warning","message":{"text":"bridge_python::host_value::discard_host_call_args (cyclomatic 16): bridge_python::host_value::discard_host_call_args has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (discard). 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":"baml_language/sdks/python/rust/bridge_python/src/host_value.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"f282c0a53c2673fe6bd50fe963f30aded3a6a4b1ad8a10e9d36d32786d8c01ee"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_rust::unions::collect (cyclomatic 16): sdkgen_rust::unions::collect has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: sdkgen_rust::unions::variant_name (cyclomatic 17) 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":"baml_language/sdks/rust/sdkgen_rust/src/unions.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1e1eae7032b36e796392cf3572f9136ef669e76ae9cff99591440e1494d0fb"}},{"ruleId":"D1","level":"warning","message":{"text":"sdkgen_swift::build_translate_ctx (cyclomatic 16): sdkgen_swift::build_translate_ctx has cyclomatic complexity 16 (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":"baml_language/sdks/swift/rust/sdkgen_swift/src/lib.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6801f5e4ae65ae4227afd0e2a920d6f0b81568135484ef7cc5bf17dce064ef"}},{"ruleId":"D1","level":"warning","message":{"text":"UnresolvedAwsBedrock::create_from (cyclomatic 16): UnresolvedAwsBedrock::create_from has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/llm-client/src/clients/aws_bedrock.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"67037d2781053e42e1f7eee2a5f084d25be236e05de3a39890e3772dde10435a"}},{"ruleId":"D1","level":"warning","message":{"text":"AwsClient::chat (cyclomatic 16): AwsClient::chat has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"424b734ce9ba45a73ad38974d540a5856251bcb451cc56e3c62c509eb52256c7"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_runtime::internal::prompt_renderer::render_output_format::find_enum_value (cyclomatic 16): baml_runtime::internal::prompt_renderer::render_output_format::find_enum_value has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5b68659fd29b31968afacecca4c2da0052327db1eba382323f50de220f28f3"}},{"ruleId":"D1","level":"warning","message":{"text":"WasmFunction::run_test_with_expr_events (cyclomatic 16): WasmFunction::run_test_with_expr_events has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":2625}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69d18a0ea67c07f59253d6f2b9d85f54fc7b58a62aa634ef609e5a06beaa439"}},{"ruleId":"D1","level":"warning","message":{"text":"Vm::process_notifications (cyclomatic 16): Vm::process_notifications has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-vm/src/vm.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"56913f81a297e74954e7b2ca40b18ff5357dfec425f4ad9cedaffc3708e66031"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_vm::native::deep_copy_value_recursive (cyclomatic 16): baml_vm::native::deep_copy_value_recursive has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-vm/src/native.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cacdb099883c1e35f26ace3e5fec79c77b98debc092248e4ef958e1211687d2"}},{"ruleId":"D1","level":"warning","message":{"text":"TypeGo::zero_value (cyclomatic 16): TypeGo::zero_value has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: TypeGo::default_name_within_union (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/go/src/type.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03d618f270c6892599f40da61b2efb349e0bcd0d632a63415d2db609dec50a9"}},{"ruleId":"D1","level":"warning","message":{"text":"WithIr::encode (cyclomatic 16): WithIr::encode has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (get_type_ir). 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":"engine/language_client_cffi/src/ctypes/object_response_encode.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2f878b71b9029503082b39ef961a70452c6946eef10c4058ec5de899fd7f6e"}},{"ruleId":"D1","level":"warning","message":{"text":"runner._save (cyclomatic 16): runner._save has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/src/speedtest/runner.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"f114ce65a5400c3d6bbc8c20a364c55629aefd2da24e850d0e1ea885fd2ca02b"}},{"ruleId":"D1","level":"warning","message":{"text":"telemetry_resource_report._reference_metrics (cyclomatic 16): telemetry_resource_report._reference_metrics has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/scripts/telemetry_resource_report.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d1bdd757d6347a1bb9f05b1780928ff7ec4112e6e751ca49326cd50a9dee98"}},{"ruleId":"D1","level":"warning","message":{"text":"baml_go.jsonLiteralTypeMatchesWire (cyclomatic 16): baml_go.jsonLiteralTypeMatchesWire has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/json.go"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ec8f00fb53c65489063ed11fbb0db44023b4eb5de35d00724ec218ef523079"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlUnion2._bamlDecode (cyclomatic 16): BamlUnion2._bamlDecode has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (BamlUnion2._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"054559af0b37c4ba933039c0534775718878c11ea1876b01c33d873690301773"}},{"ruleId":"D1","level":"warning","message":{"text":"BamlUnion2._bamlDecode (cyclomatic 16): BamlUnion2._bamlDecode has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (BamlUnion2._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"449798c3b9f81b7919d6a1fcc62572327bbea2f270bc62096d16192dd0127286"}},{"ruleId":"D1","level":"warning","message":{"text":"main.decode (cyclomatic 16): main.decode has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/programs/agent-loop-300/main.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"5630b6badd2cc9f55e6a8e0d1083d75283f32bfbbd62833e0c1898e2a338e2bf"}},{"ruleId":"D1","level":"warning","message":{"text":"elk-mermaid.layoutELKMermaid.edges (cyclomatic 16): elk-mermaid.layoutELKMermaid.edges has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. 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":"typescript/packages/playground-common/src/features/graph/layout/node/algorithms/elk-mermaid.ts"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcde3c7190d10dc354e297018a91c1c9482fd3c56239b1d0dfbf4c4c8074a729"}},{"ruleId":"D1","level":"warning","message":{"text":"render-text.HighlightedText (cyclomatic 16): render-text.HighlightedText has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 117, 47, 106, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/render-text.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f1171d40a808b4f5f55ff4fd3f0fbcd28235235e95486f44b595f635ef28bf"}},{"ruleId":"D1","level":"warning","message":{"text":"prompt-preview-content.PromptPreviewContent (cyclomatic 16): prompt-preview-content.PromptPreviewContent has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. 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":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/prompt-preview-content.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a82abbce9f4c974e657caac5cdf47670119eb7207412d5671a1f11831b04ed4"}},{"ruleId":"D1","level":"warning","message":{"text":"prompt-search-bar.PromptSearchBar (cyclomatic 16): prompt-search-bar.PromptSearchBar has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 31, handleKeyDown, a function literal at line 51, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/prompt-search-bar.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"651b1d573a0c6585a2c90a19968a286d3b66c2023ccff34414bfe5323c12ab02"}},{"ruleId":"D1","level":"warning","message":{"text":"route.POST (cyclomatic 16): route.POST has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/beps/[number]/comments/reply/route.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"e135497686c30ff7897289c2ad7378d85664c4a9ecbc8efb5bc19db9526d5a71"}},{"ruleId":"D1","level":"warning","message":{"text":"route.GET (cyclomatic 16): route.GET has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/beps/route.ts"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ea41083d4b21c6b508ec5ed6899dc91a84c5a4534bd33d9ed26f33549bb9b6"}},{"ruleId":"D1","level":"warning","message":{"text":"page.BcsIssues (cyclomatic 16): page.BcsIssues has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/issues/page.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"585cc194c85f1825e1c5153d804c125e5d0237edc0f663c4def1f56f4ec10a9e"}},{"ruleId":"D1","level":"warning","message":{"text":"decision-card.DecisionCard (cyclomatic 16): decision-card.DecisionCard has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 belong to 4 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/decisions/decision-card.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"246728bdb3b4d3764fc734d995a5d9ac6ff886b5de2da99e105ae377fd3190dd"}},{"ruleId":"D1","level":"warning","message":{"text":"docs-toc.DocsToc (cyclomatic 16): docs-toc.DocsToc has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 34, 70, 27, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/components/docs-toc.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca58331234dca87e32cb26475d1893792f08e0c3af6ea263ad7feb885f6eecf1"}},{"ruleId":"D1","level":"warning","message":{"text":"no-widen-then-assert.isBroadRecordType (cyclomatic 16): no-widen-then-assert.isBroadRecordType has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-widen-then-assert.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"476c0932989434d2954f9e83dca758a1478968aada0bb4b397e232cc6f7abd43"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime.createSolveRuntime.runOne (cyclomatic 16): runtime.createSolveRuntime.runOne has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"typescript2/app-website/app/(home)/bamlcode/_lib/runtime.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b65baa2b9ac29d597cfd3c0d9d78c72ac6fcda04005518d8ae2bbb66775848"}},{"ruleId":"D1","level":"warning","message":{"text":"webview-media.WebviewMedia (cyclomatic 16): webview-media.WebviewMedia has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd0fa8ce5edd31dc474048d14b39cd0db24cf1ce42fe531019235a5a48bdc21"}},{"ruleId":"D1","level":"warning","message":{"text":"render-part.RenderPart (cyclomatic 16): render-part.RenderPart has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 16, a function literal at line 44, extractStringValues). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/render-part.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6c16fbd3ca004d31cec633c45d6ff0ab5e85ca73f47b67c1ea6a39f20152aa"}},{"ruleId":"D1","level":"warning","message":{"text":"rehype-highlight-code.rehypeHighlightCode.\u003Creturned closure\u003E (cyclomatic 16): rehype-highlight-code.rehypeHighlightCode.\u003Creturned closure\u003E has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 22, 30, 49). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/rehype-highlight-code.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6258c6c0b4bf6237ed5928c088c7c5634d733f6091582be8e1a78905882f0b9"}},{"ruleId":"D1","level":"warning","message":{"text":"page.BlogIndex (cyclomatic 16): page.BlogIndex has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 belong to 4 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/blog/page.tsx"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f1a1e388b018027101d986c73b3ad329a85e5a06aabac817088c61744c0b52"}},{"ruleId":"D1","level":"warning","message":{"text":"tracker.Reveal (cyclomatic 16): tracker.Reveal has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1821, 1808, 1799). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/tracker.tsx"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"79106365fad1d5710d89af930724e19a6d4b0d85ee4c49d9533001245e8e44d7"}},{"ruleId":"D1","level":"warning","message":{"text":"tracker.Journeys (cyclomatic 16): tracker.Journeys has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 1961, 1901, 1878, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/tracker.tsx"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee6314b41f9810fc52c68a3bb01ea050c6574916a98b1e856f41b8bb1509a99"}},{"ruleId":"D1","level":"warning","message":{"text":"index.searchSymbols (cyclomatic 16): index.searchSymbols has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. 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":"typescript2/app-website/lib/baml-docs/index.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef08be3ebbf0d8a89453fe6d0766851833aae88fbce9bf81603e46b27e54da30"}},{"ruleId":"D1","level":"warning","message":{"text":"baml-worker.onPlaygroundNotification (cyclomatic 16): baml-worker.onPlaygroundNotification has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"typescript2/app-website/playground/baml-worker.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"e006cc6a5bbaafdd4549d4c54d656e092c91b800076c15237eb826b88b22f936"}},{"ruleId":"D1","level":"warning","message":{"text":"new-post.generatePost (cyclomatic 16): new-post.generatePost has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 4 belong to 4 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/scripts/new-post.ts"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"093ea6643e93e7970fe316a2a3cfa629307a5959da0c8ee02a075782f7cbef03"}},{"ruleId":"D1","level":"warning","message":{"text":"TelemetryView.TraceTab (cyclomatic 16): TelemetryView.TraceTab has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1864, 1945, 1931). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":1851}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e48706165a715b065ec7c8c324c602ac7102d65766a8db4970501e6ba939cb"}},{"ruleId":"D1","level":"warning","message":{"text":"WebSocketRuntimePort.postMessage (cyclomatic 16): WebSocketRuntimePort.postMessage has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: WebSocketRuntimePort.toServer (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ports/WebSocketRuntimePort.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92025f49d427151a76cbe3986dbd145e8792c8b98e00d08ecd5dd9ea61ffe76"}},{"ruleId":"D2","level":"warning","message":{"text":"BexVm::run_compact (cognitive 607): BexVm::run_compact has cognitive complexity 607 (threshold 15). Drivers by points: if/else 172 (472 pts), match/switch 39 (115 pts), boolean chains 13, loops 3 (7 pts) (nesting depth added 380). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":9408}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b69c8835b074a7e5069c67f4a47083b7d9a67a399e4ca3919270dce5ea0d33"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler::thir::typecheck::typecheck_expression (cognitive 412): baml_compiler::thir::typecheck::typecheck_expression has cognitive complexity 412 (threshold 15). Drivers by points: if/else 86 (242 pts), match/switch 43 (137 pts), loops 6 (21 pts), boolean chains 12 (nesting depth added 265). 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":"engine/baml-compiler/src/thir/typecheck.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f78aa53fb37ac100f44f15892d6ac80f01a886be6732034de1e5be6af861fe"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplArgs::run (cognitive 317): ReplArgs::run has cognitive complexity 317 (threshold 15). Drivers by points: if/else 68 (237 pts), loops 11 (33 pts), match/switch 7 (25 pts), boolean chains 22 (nesting depth added 209). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/cli/repl.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f27af3b8ddb009b6325ab341b5c903700499ca3d72bbd4fe2d55dc485d34b4"}},{"ruleId":"D2","level":"warning","message":{"text":"Vm::exec (cognitive 242): Vm::exec has cognitive complexity 242 (threshold 15). Drivers by points: if/else 49 (164 pts), match/switch 22 (66 pts), loops 4 (10 pts), boolean chains 2 (nesting depth added 165). 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":"engine/baml-vm/src/vm.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a6087b0ad38da480f132686d106161b510a7262730c843cc854b179c54a892"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::finish (cognitive 217): InferenceContext::finish has cognitive complexity 217 (threshold 15). Drivers by points: if/else 51 (121 pts), match/switch 17 (44 pts), loops 21 (33 pts), boolean chains 19 (nesting depth added 109). 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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":12717}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fdfce49fc0cd78e375f8ba61fb78b8aad58242726f729fe62dbd729e0ec3a6d"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_stow::generate_dependency_graph_svg (cognitive 214): cargo_stow::generate_dependency_graph_svg has cognitive complexity 214 (threshold 15). Drivers by points: if/else 70 (147 pts), loops 31 (43 pts), boolean chains 13, match/switch 5 (11 pts) (nesting depth added 95). Of this number, 211 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"07279807b35858ee79da0bf47aa6d5e1ea8fbb8dc526fe29f4ed753f6efa6f1a"}},{"ruleId":"D2","level":"warning","message":{"text":"BexEngine::run_thread_event_loop_inner (cognitive 197): BexEngine::run_thread_event_loop_inner has cognitive complexity 197 (threshold 15). Drivers by points: if/else 42 (135 pts), match/switch 15 (49 pts), boolean chains 9, loops 2 (4 pts) (nesting depth added 129). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":6074}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94d54ce2b9f30279d9e879c4a6f8cce4cd2195c351fe5e6ad7ebf7890cbfd4f"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlAsyncVmRuntime::call_function (cognitive 186): BamlAsyncVmRuntime::call_function has cognitive complexity 186 (threshold 15). Drivers by points: if/else 24 (103 pts), match/switch 20 (65 pts), loops 5 (17 pts), boolean chains 1 (nesting depth added 136). 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":"engine/baml-runtime/src/async_vm_runtime.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f804632bb29aed8882beae75f96a65b9d5cbed297e3c033fdf114bdabbc194e"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_cffi_macros::export_baml_fn (cognitive 185): baml_cffi_macros::export_baml_fn has cognitive complexity 185 (threshold 15). Drivers by points: if/else 78 (170 pts), match/switch 4 (13 pts), boolean chains 1, loops 1 (nesting depth added 101). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3af62f096c3450e006dd73a446695232bc2d24ef48b8490e54465128151740"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_runtime::internal::prompt_renderer::render_output_format::relevant_data_models (cognitive 183): baml_runtime::internal::prompt_renderer::render_output_format::relevant_data_models has cognitive complexity 183 (threshold 15). Drivers by points: if/else 38 (143 pts), loops 10 (37 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 133). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90e8dbd135a2589c2cbf4cb649176cd058b2c80c48ead530b65f6d2bf9f193a"}},{"ruleId":"D2","level":"warning","message":{"text":"ArgCoercer::coerce_arg (cognitive 180): ArgCoercer::coerce_arg has cognitive complexity 180 (threshold 15). Drivers by points: if/else 35 (112 pts), match/switch 15 (35 pts), loops 9 (30 pts), boolean chains 3 (nesting depth added 118). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/ir/ir_helpers/to_baml_arg.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf001a0ec90bd91c94440315dbee407eff8765d18bf7e04f86050f879f9889a1"}},{"ruleId":"D2","level":"warning","message":{"text":"baml-lsp-worker.onmessage (cognitive 162): baml-lsp-worker.onmessage has cognitive complexity 162 (threshold 15). Drivers by points: if/else 38 (75 pts), ternaries 17 (49 pts), error handling 16 (32 pts), boolean chains 5, match/switch 1 (nesting depth added 85). Of this number, 131 points are the body\u0027s own statements and 31 belong to 8 function literals inside it that branch. 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":"typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c0d406d48a8f7658dc4b3997651e6a206c1837ee4aac169ccf6d296b0749dc"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler::thir::interpret::evaluate_block_with_control_flow::handle_statement (cognitive 161): baml_compiler::thir::interpret::evaluate_block_with_control_flow::handle_statement has cognitive complexity 161 (threshold 15). Drivers by points: if/else 20 (76 pts), match/switch 27 (76 pts), loops 4 (9 pts) (nesting depth added 110). 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":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68317f9970af5acf727a57e158b336171605aa5e75992b1d3fc0a37085ef9e3"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_call_with_callee (cognitive 151): LoweringContext::lower_call_with_callee has cognitive complexity 151 (threshold 15). Drivers by points: if/else 61 (102 pts), match/switch 15 (38 pts), boolean chains 11 (nesting depth added 64). 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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":8326}}}],"partialFingerprints":{"codehealthFindingId/v1":"005540df410792de28b411d47c3a5b7a507d22abd074f44792b22eb358a4b703"}},{"ruleId":"D2","level":"warning","message":{"text":"PropertyHandler::ensure_http_config (cognitive 147): PropertyHandler::ensure_http_config has cognitive complexity 147 (threshold 15). Drivers by points: if/else 33 (99 pts), match/switch 8 (36 pts), loops 2 (7 pts), boolean chains 5 (nesting depth added 99). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/llm-client/src/clients/helpers.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5ad7ebfb976766e1b78a5566df8d0bdb25c178db0a801955e4415d4a5b351f"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_go.validateBAMLTypeAt (cognitive 136): baml_go.validateBAMLTypeAt has cognitive complexity 136 (threshold 15). Drivers by points: if/else 54 (117 pts), boolean chains 11, loops 3 (5 pts), match/switch 2 (3 pts) (nesting depth added 66). Of this number, 133 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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":"baml_language/sdks/go/baml_go/value.go"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97dd1e333ab5457d60fa1697ba9dd40c006b95ea4ed590caa1705465df2a243"}},{"ruleId":"D2","level":"warning","message":{"text":"baml-worker.onmessage (cognitive 135): baml-worker.onmessage has cognitive complexity 135 (threshold 15). Drivers by points: if/else 24 (46 pts), ternaries 15 (44 pts), error handling 15 (30 pts), boolean chains 8, loops 3 (6 pts), match/switch 1 (nesting depth added 69). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/playground/baml-worker.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"70307dd46a9225d66249c0bc80251c8b870ca94489dc190198e384d1be05c82d"}},{"ruleId":"D2","level":"warning","message":{"text":"Program::validate (cognitive 132): Program::validate has cognitive complexity 132 (threshold 15). Drivers by points: if/else 33 (81 pts), loops 17 (34 pts), match/switch 5 (13 pts), boolean chains 4 (nesting depth added 73). 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":"baml_language/crates/bex_vm_types/src/types.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4e13e82805792e7a145e060a02b88a2bd90197a79d47cc4818fd4960ecbc3a"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_mir::optimize::verify_definite_assignment (cognitive 129): baml_compiler2_mir::optimize::verify_definite_assignment has cognitive complexity 129 (threshold 15). Drivers by points: if/else 25 (65 pts), loops 17 (37 pts), match/switch 11 (26 pts), boolean chains 1 (nesting depth added 75). Of this number, 127 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"baml_language/crates/baml_compiler2_mir/src/optimize.rs"},"region":{"startLine":1943}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd822ff03ed874ba44c825b8bd127f7c19de73acf23cd3598fdbb9807f55e09b"}},{"ruleId":"D2","level":"warning","message":{"text":"compare._render_md (cognitive 128): compare._render_md has cognitive complexity 128 (threshold 15). Drivers by points: ternaries 16 (55 pts), if/else 21 (48 pts), boolean chains 13, loops 7 (12 pts) (nesting depth added 71). 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":"baml_language/tools/speedtest/src/speedtest/compare.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85e5792852a6476df1d7816a0a6327f06bfc43c12c1efcedaef3e91cc6eec27"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler::thir::interpret::evaluate_expr_with_context (cognitive 119): baml_compiler::thir::interpret::evaluate_expr_with_context has cognitive complexity 119 (threshold 15). Drivers by points: if/else 25 (50 pts), match/switch 16 (42 pts), loops 9 (27 pts) (nesting depth added 69). 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":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":1639}}}],"partialFingerprints":{"codehealthFindingId/v1":"08134c44615577fc41e27fdd58bb4f1d6587265ba4394da9f747d2ce617ecf37"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_expr (cognitive 115): InferenceContext::infer_expr has cognitive complexity 115 (threshold 15). Drivers by points: if/else 28 (60 pts), match/switch 11 (27 pts), loops 7 (22 pts), boolean chains 6 (nesting depth added 63). 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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":2907}}}],"partialFingerprints":{"codehealthFindingId/v1":"5375a20698ab65c0e15197294a8614474dbe405d2117a7c5402ccb0b3fb3e7cc"}},{"ruleId":"D2","level":"warning","message":{"text":"OptimizeArgs::run (cognitive 115): OptimizeArgs::run has cognitive complexity 115 (threshold 15). Drivers by points: if/else 48 (91 pts), loops 4 (12 pts), match/switch 4 (8 pts), boolean chains 4 (nesting depth added 55). 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":"engine/baml-runtime/src/cli/optimize.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"779f287201d124ce7d0e4c79bd785c587fb123a5cad820e93d73277af0763b60"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::try_lower_as_switch (cognitive 114): LoweringContext::try_lower_as_switch has cognitive complexity 114 (threshold 15). Drivers by points: if/else 32 (69 pts), match/switch 12 (28 pts), loops 5 (11 pts), boolean chains 6 (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":12735}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1cbbf1ee05f7889bd13b7734257fd3f900125c69fa25a0acbd7efa198b73df4"}},{"ruleId":"D2","level":"warning","message":{"text":"HirCompiler::compile_expression (cognitive 111): HirCompiler::compile_expression has cognitive complexity 111 (threshold 15). Drivers by points: if/else 26 (65 pts), match/switch 12 (27 pts), loops 8 (18 pts), boolean chains 1 (nesting depth added 64). 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":"engine/baml-compiler/src/codegen.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6fc6a1ea4f066144641c20d5f5d1f1e805a44aaa6b64abcc7ab899bb410731"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::interfaces::impl_rules::validate_impl_signatures (cognitive 110): baml_compiler2_hir_ty::interfaces::impl_rules::validate_impl_signatures has cognitive complexity 110 (threshold 15). Drivers by points: if/else 30 (71 pts), loops 12 (27 pts), match/switch 4 (8 pts), boolean chains 4 (nesting depth added 60). 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":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd43560012f3d99ef4e3ba397bf6887014ade7511ca4c41ad76c6d608886308"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_cffi_macros::is_result_option_vec_rawptrtype (cognitive 105): baml_cffi_macros::is_result_option_vec_rawptrtype has cognitive complexity 105 (threshold 15). Drivers by points: if/else 14 (105 pts) (nesting depth added 91). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"b566ba9ba9bc345fa20be53007b63b0c435e60a3e5b3b83f1a9e3a86a74f620f"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_cpp::to_source_code_with_optional_metadata (cognitive 103): sdkgen_cpp::to_source_code_with_optional_metadata has cognitive complexity 103 (threshold 15). Drivers by points: if/else 22 (56 pts), loops 14 (28 pts), match/switch 6 (16 pts), boolean chains 3 (nesting depth added 58). 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":"baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35b7fdc1d5426e8f36530befc52923439b7d3c2834196a8e905143478cfea1f"}},{"ruleId":"D2","level":"warning","message":{"text":"App.App (cognitive 101): App.App has cognitive complexity 101 (threshold 15). Drivers by points: if/else 21 (39 pts), boolean chains 35, ternaries 15 (17 pts), loops 6 (9 pts), error handling 1 (nesting depth added 23). Of this number, 62 points are the body\u0027s own statements and 39 belong to 21 function items inside it that branch. 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":"typescript2/app-speedtest/src/App.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bedcae24f680b2fa25264b45c7e757cea4f85c865605ebdd0d8abbf67c4775"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_baml::csv::scan_record (cognitive 100): bex_vm::package_baml::csv::scan_record has cognitive complexity 100 (threshold 15). Drivers by points: if/else 31 (85 pts), boolean chains 11, match/switch 1 (3 pts), loops 1 (nesting depth added 56). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9362069508f99b872a340c95d0ebf5a75fea186dd43ba179ef2e058071a022"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_runtime::internal::llm_client::orchestrator::stream::orchestrate_stream (cognitive 100): baml_runtime::internal::llm_client::orchestrator::stream::orchestrate_stream has cognitive complexity 100 (threshold 15). Drivers by points: if/else 22 (62 pts), match/switch 11 (33 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 64). 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":"engine/baml-runtime/src/internal/llm_client/orchestrator/stream.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"0948866c2cdb08e87ea3cf02a4fa5b91590b0e5f74ba90072d7327c69e68d832"}},{"ruleId":"D2","level":"warning","message":{"text":"jsonish::helpers::relevant_data_models (cognitive 99): jsonish::helpers::relevant_data_models has cognitive complexity 99 (threshold 15). Drivers by points: if/else 23 (72 pts), loops 7 (25 pts), match/switch 1 (2 pts) (nesting depth added 68). 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":"engine/baml-lib/jsonish/src/helpers/mod.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebb7363ba0ab1de9d63fa8ea1f39e15d1a41d34aa4b746a1c1fb6c9d17450c7"}},{"ruleId":"D2","level":"warning","message":{"text":"MonacoEditor.MonacoEditor (cognitive 99): MonacoEditor.MonacoEditor has cognitive complexity 99 (threshold 15). Drivers by points: if/else 45 (63 pts), error handling 6 (13 pts), boolean chains 10, loops 8 (9 pts), ternaries 3, match/switch 1 (nesting depth added 26). Most of this is not in the body itself: 2 of the 99 points are its own statements and the rest belongs to 18 function literals inside it that branch (lines 354, 1083, 1351, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-editor/src/MonacoEditor.tsx"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bef4dbf23edf06a58a01d4d3ce96102f2184d6b75034383c08776cc503ecd8"}},{"ruleId":"D2","level":"warning","message":{"text":"compare.cmd_compare (cognitive 94): compare.cmd_compare has cognitive complexity 94 (threshold 15). Drivers by points: if/else 20 (40 pts), ternaries 14 (38 pts), boolean chains 11, loops 4 (5 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/src/speedtest/compare.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb97e4ef54a1e356a7eaae35d9c33ff116db094dd12ef7feacea5ecde1dd0c3"}},{"ruleId":"D2","level":"warning","message":{"text":"comment-sidebar.CommentSidebar (cognitive 93): comment-sidebar.CommentSidebar has cognitive complexity 93 (threshold 15). Drivers by points: if/else 35 (42 pts), boolean chains 38, loops 4 (5 pts), ternaries 5, error handling 3 (nesting depth added 8). Most of this is not in the body itself: 10 of the 93 points are its own statements and the rest belongs to 28 function items inside it that branch (a function literal at line 332, a function literal at line 541, a function literal at line 839, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-sidebar.tsx"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2cfe6a3367a2f54c7d7439e78ff2252aa1c259e5745d545d0780b6e1d690bc5"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::annotations::process_body (cognitive 92): baml_ide::annotations::process_body has cognitive complexity 92 (threshold 15). Drivers by points: if/else 25 (81 pts), loops 5 (11 pts) (nesting depth added 62). 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":"baml_language/crates/baml_ide/src/annotations.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea401ec7493e4f38b0d78bf7d2c007f6b137a50d3370378986e9cc72cb332015"}},{"ruleId":"D2","level":"warning","message":{"text":"webview-media.WebviewMedia (cognitive 92): webview-media.WebviewMedia has cognitive complexity 92 (threshold 15). Drivers by points: boolean chains 41, if/else 30 (39 pts), error handling 2 (5 pts), ternaries 3 (4 pts), match/switch 2, loops 1 (nesting depth added 13). Of this number, 37 points are the body\u0027s own statements and 55 belong to 15 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30524a124bea5698f192d844c5770010dba46d2293fad1348d263631e33000c"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_mir::optimize::verify_mir (cognitive 91): baml_compiler2_mir::optimize::verify_mir has cognitive complexity 91 (threshold 15). Drivers by points: loops 21 (59 pts), if/else 8 (18 pts), match/switch 5 (13 pts), boolean chains 1 (nesting depth added 56). 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":"baml_language/crates/baml_compiler2_mir/src/optimize.rs"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"de75cb5d93fbe1693336e9eebc587e81c4d9418111b12bbab609cc5a3e732e39"}},{"ruleId":"D2","level":"warning","message":{"text":"CandidateApplier::update_field_attributes (cognitive 91): CandidateApplier::update_field_attributes has cognitive complexity 91 (threshold 15). Drivers by points: if/else 19 (91 pts) (nesting depth added 72). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/applier.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e3c3ffee9793437250a57108dd52a97326b34bc2079ecd5369133abbca9e5c"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_runtime::tracingv2::publisher::rpc_converters::extract_blobs_from_trace_data (cognitive 91): baml_runtime::tracingv2::publisher::rpc_converters::extract_blobs_from_trace_data has cognitive complexity 91 (threshold 15). Drivers by points: if/else 11 (57 pts), loops 5 (20 pts), match/switch 4 (14 pts) (nesting depth added 71). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/tracingv2/publisher/rpc_converters/mod.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a75836d5682f150e2d0c85124557169c7cf7517cc55c75fa3991c83bb79d37"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_emit::stack_carry::is_stack_carry_use_safe (cognitive 90): baml_compiler2_emit::stack_carry::is_stack_carry_use_safe has cognitive complexity 90 (threshold 15). Drivers by points: if/else 24 (68 pts), loops 4 (11 pts), match/switch 4 (9 pts), boolean chains 2 (nesting depth added 56). 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":"baml_language/crates/baml_compiler2_emit/src/stack_carry.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"56674bf7fff32519ba2ca1dbbe2d8287cfcf3d7842e7c2c197b0e4d473e75e11"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_query_btel::ingest::reconcile (cognitive 90): baml_query_btel::ingest::reconcile has cognitive complexity 90 (threshold 15). Drivers by points: if/else 18 (42 pts), match/switch 8 (21 pts), boolean chains 16, loops 6 (11 pts) (nesting depth added 42). 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":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b82e6dfd7dad6238d63c7168466e140a7c56446467c2bbaa078b21327d3011"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_go::render_functions (cognitive 90): sdkgen_go::render_functions has cognitive complexity 90 (threshold 15). Drivers by points: if/else 33 (59 pts), loops 15 (26 pts), boolean chains 5 (nesting depth added 37). 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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":1960}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1d1bbd8f16c26c9b232bfb6a71e2984ddbd9351271c13b5d4c2772790bd167"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonParseState::process_token (cognitive 90): JsonParseState::process_token has cognitive complexity 90 (threshold 15). Drivers by points: if/else 18 (44 pts), match/switch 12 (36 pts), loops 2 (10 pts) (nesting depth added 58). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d974b0e8bebb18f1de866300b6bb197e824306fc9410fc3067b60e2594b18b"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonParseState::should_close_unescaped_string (cognitive 89): JsonParseState::should_close_unescaped_string has cognitive complexity 89 (threshold 15). Drivers by points: match/switch 9 (35 pts), if/else 10 (30 pts), loops 6 (20 pts), boolean chains 4 (nesting depth added 60). 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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0624e47b84d6cb856f76526f59807738189f3f9130b53961ffc8e3a2cecf5b"}},{"ruleId":"D2","level":"warning","message":{"text":"HashDriver::drive (cognitive 89): HashDriver::drive has cognitive complexity 89 (threshold 15). Drivers by points: if/else 17 (58 pts), match/switch 6 (22 pts), loops 3 (9 pts) (nesting depth added 63). 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":"baml_language/crates/bex_vm/src/package_baml/hashing.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"560c84c5315d73541385d78050104d018a502aedf8a8434392ca0ea413f32ddd"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonParseState::should_close_unescaped_string (cognitive 89): JsonParseState::should_close_unescaped_string has cognitive complexity 89 (threshold 15). Drivers by points: match/switch 9 (35 pts), if/else 10 (30 pts), loops 6 (20 pts), boolean chains 4 (nesting depth added 60). 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":"engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e79d3fddcaac5e8145a847ca707e6e5ba45f24ab65825edf598f85b262dcfd4"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_derive::derive_baml_hash (cognitive 88): baml_derive::derive_baml_hash has cognitive complexity 88 (threshold 15). Drivers by points: if/else 40 (81 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (nesting depth added 42). 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":"engine/baml-lib/baml-derive/src/lib.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cac50577a58ada7a9f85fe17c2d3d9842df8cd57590e465ea6a0cdffa9b5382"}},{"ruleId":"D2","level":"warning","message":{"text":"TirTypeError::render (cognitive 87): TirTypeError::render has cognitive complexity 87 (threshold 15). Drivers by points: if/else 45 (67 pts), match/switch 11 (20 pts) (nesting depth added 31). 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":"baml_language/crates/baml_compiler2_hir_ty/src/diagnostics.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ad9649c386f3215c45bdbde70c2a7ea02b14dc216df6aa3d2b325863d8100c"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_pattern_test_with_catch_policy (cognitive 87): LoweringContext::lower_pattern_test_with_catch_policy has cognitive complexity 87 (threshold 15). Drivers by points: if/else 37 (74 pts), loops 4 (9 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 43). 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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":13930}}}],"partialFingerprints":{"codehealthFindingId/v1":"d669f9c176f0bffe1692ac7c341d5399e93e041990da0dee7cc2dad786ad0250"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonParseState::process_token (cognitive 86): JsonParseState::process_token has cognitive complexity 86 (threshold 15). Drivers by points: if/else 18 (44 pts), match/switch 11 (32 pts), loops 2 (10 pts) (nesting depth added 55). 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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d1d14975b606ebec5fc0107a89f682aad925ea146228253e30cf93eab5c49d"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::interfaces::impl_rules::impl_data (cognitive 85): baml_compiler2_hir_ty::interfaces::impl_rules::impl_data has cognitive complexity 85 (threshold 15). Drivers by points: if/else 23 (53 pts), loops 8 (18 pts), boolean chains 9, match/switch 3 (5 pts) (nesting depth added 42). 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":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccef2a6e0e90ef4fa6661bf19afa1252fb0877b6b3de4616a155a1b6067db0e0"}},{"ruleId":"D2","level":"warning","message":{"text":"Bulk::apply (cognitive 85): Bulk::apply has cognitive complexity 85 (threshold 15). Drivers by points: if/else 15 (38 pts), match/switch 5 (24 pts), loops 9 (19 pts), boolean chains 4 (nesting depth added 52). 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":"baml_language/crates/baml_query_btel/src/ingest/bulk.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"9186de317982f0f37ba7e8b6c4643f42d29c95cdb3299c50cd5b6190ece3fd1d"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_db::check::check_file (cognitive 84): baml_db::check::check_file has cognitive complexity 84 (threshold 15). Drivers by points: loops 27 (44 pts), if/else 15 (31 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 34). 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":"baml_language/crates/baml_db/src/check.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8e9752ba283608637db6d2a0f3c466352b95905250d79329db8375fa846bb3"}},{"ruleId":"D2","level":"warning","message":{"text":"BexVm::unwind_exception_frames (cognitive 84): BexVm::unwind_exception_frames has cognitive complexity 84 (threshold 15). Drivers by points: if/else 28 (67 pts), match/switch 5 (13 pts), boolean chains 3, loops 1 (nesting depth added 47). 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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":6733}}}],"partialFingerprints":{"codehealthFindingId/v1":"5061322b274d21f1a499bcec468e21d46d796827dc2199b73c3e6a21dbfc3553"}},{"ruleId":"D2","level":"warning","message":{"text":"ProtoWriter.encodeInboundValue (cognitive 84): ProtoWriter.encodeInboundValue has cognitive complexity 84 (threshold 15). Drivers by points: if/else 37 (47 pts), ternaries 11 (23 pts), boolean chains 13, loops 1 (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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoWriter.java"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee71939a70ec68f46b485d5f42dea62bd0095546a19b2b4896a25ac50ce233c"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::check_call_args (cognitive 82): InferenceContext::check_call_args has cognitive complexity 82 (threshold 15). Drivers by points: if/else 22 (44 pts), loops 9 (15 pts), match/switch 7 (13 pts), boolean chains 10 (nesting depth added 34). 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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":6349}}}],"partialFingerprints":{"codehealthFindingId/v1":"18263827471990e7fdf2d88de262bfec20b98790fcffb3578689207f1759ea22"}},{"ruleId":"D2","level":"warning","message":{"text":"bep-import-dialog.BepImportDialog (cognitive 82): bep-import-dialog.BepImportDialog has cognitive complexity 82 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 25, ternaries 14 (23 pts), error handling 2 (3 pts), loops 1 (nesting depth added 24). Of this number, 25 points are the body\u0027s own statements and 57 belong to 9 function literals inside it that branch. 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":"typescript2/app-beps/src/components/bep/bep-import-dialog.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0afc8ba3f51ee9ea2b6cfb6fa76a81ec3b174df946e01ee899ff8ed4599dc6c"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecutionPanel.ExecutionPanel (cognitive 82): ExecutionPanel.ExecutionPanel has cognitive complexity 82 (threshold 15). Drivers by points: if/else 144 (202 pts), ternaries 64 (177 pts), boolean chains 141, loops 16 (21 pts), error handling 7 (9 pts), match/switch 2 (3 pts) (nesting depth added 179). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (ExecutionPanel.ExecutionPanel::handleCursorContext) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3972a045b041253434b80ea729ceba7f957d2927d04bb762c85d9269524cc7"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::package_interface::validate_row_identities (cognitive 81): baml_compiler2_hir_ty::package_interface::validate_row_identities has cognitive complexity 81 (threshold 15). Drivers by points: if/else 22 (48 pts), match/switch 7 (18 pts), loops 9 (12 pts), boolean chains 3 (nesting depth added 40). 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":"baml_language/crates/baml_compiler2_hir_ty/src/package_interface.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"e032811f2b695e933c97b734ba3da675d2ba3f49bc98c5bdcf52510b843b67d8"}},{"ruleId":"D2","level":"warning","message":{"text":"walkLibFile (cognitive 81): walkLibFile has cognitive complexity 81 (threshold 15). Drivers by points: if/else 15 (47 pts), loops 5 (15 pts), ternaries 6 (10 pts), boolean chains 7, other 2 (nesting depth added 46). 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":"tools/stdlib-matrix/extractors/ts-surface.mjs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd1da0d79e78c490ec9691dadd9f7dcf7eb1143d6255277d6e8837da681eb26"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf-viewer.PdfViewer (cognitive 80): pdf-viewer.PdfViewer has cognitive complexity 80 (threshold 15). Drivers by points: if/else 31 (37 pts), ternaries 7 (21 pts), boolean chains 18, error handling 2 (3 pts), loops 1 (nesting depth added 21). Of this number, 24 points are the body\u0027s own statements and 56 belong to 21 function items inside it that branch. 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":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/pdf-viewer.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a14d8ca65239cffbf054492e0aea3c41808fd2a01950cdb34261ea3e0b02f3"}},{"ruleId":"D2","level":"warning","message":{"text":"bep-route-shell.BepRouteShell (cognitive 79): bep-route-shell.BepRouteShell has cognitive complexity 79 (threshold 15). Drivers by points: if/else 69 (93 pts), boolean chains 58, ternaries 38 (48 pts), loops 3, error handling 2 (nesting depth added 34). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (bep-route-shell.BepRouteShell::handleConfirmSubmit) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-route-shell.tsx"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c121705c22082e60bcc29634d0b7ba77182fcd3df5801d592c12fff6c4023f"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::symbol_pool::build_symbol_pool (cognitive 78): baml_ide::symbol_pool::build_symbol_pool has cognitive complexity 78 (threshold 15). Drivers by points: if/else 12 (34 pts), loops 15 (33 pts), boolean chains 8, match/switch 1 (3 pts) (nesting depth added 42). 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":"baml_language/crates/baml_ide/src/symbol_pool.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d473ff7ab68db66a8b9c770c6d62b01bc2b69a6e6366b574a852db6e1fd7fa"}},{"ruleId":"D2","level":"warning","message":{"text":"BexHeap::fixup_object_references (cognitive 78): BexHeap::fixup_object_references has cognitive complexity 78 (threshold 15). Drivers by points: if/else 21 (48 pts), loops 12 (27 pts), boolean chains 2, match/switch 1 (nesting depth added 42). 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":"baml_language/crates/bex_heap/src/gc.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"e388b504f4a5b8f1dcf158f39e980d35ec7586687815dfcaea89f1127575d381"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_project::runtime_compile::lower_session_submission (cognitive 78): bex_project::runtime_compile::lower_session_submission has cognitive complexity 78 (threshold 15). Drivers by points: if/else 31 (56 pts), match/switch 5 (12 pts), boolean chains 5, loops 4 (5 pts) (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":"baml_language/crates/bex_project/src/runtime_compile.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e4bae097b2b7e7aa97a13b46c53b904756d8bbff2b2940e638c03b71aa01d0"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_baml::root::render_to_sink (cognitive 77): bex_vm::package_baml::root::render_to_sink has cognitive complexity 77 (threshold 15). Drivers by points: if/else 28 (62 pts), loops 3 (7 pts), match/switch 5 (7 pts), boolean chains 1 (nesting depth added 40). 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":"baml_language/crates/bex_vm/src/package_baml/root.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"137cfcc5145a49735bcf37dff5e10b318b949fa0cdc0ec5845c09b2d9aadffd2"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlUnion8._bamlDecode (cognitive 75): BamlUnion8._bamlDecode has cognitive complexity 75 (threshold 15). Drivers by points: if/else 35 (59 pts), boolean chains 16 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (BamlUnion8._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5398659b373f3c464e99f560cd5d19751f5bc7e34ffd5df511e4e06b959437"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlUnion8._bamlDecode (cognitive 75): BamlUnion8._bamlDecode has cognitive complexity 75 (threshold 15). Drivers by points: if/else 35 (59 pts), boolean chains 16 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (BamlUnion8._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3c834c9958f3212ad0c7ebb1f4d5393f93a8afe7cd2c015f54b4e5fbde4e97"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_python_pydantic2::leaf::render_leaf_body_pyi (cognitive 74): sdkgen_python_pydantic2::leaf::render_leaf_body_pyi has cognitive complexity 74 (threshold 15). Drivers by points: if/else 28 (42 pts), loops 10 (17 pts), boolean chains 11, match/switch 2 (4 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":2653}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05b7eafb1436abd7e84f6b23e591f260d92f475ad1b1744cbb7701437ccb759"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_jinja_types::evaluate_type::expr::tracker_visit_expr (cognitive 74): internal_baml_jinja_types::evaluate_type::expr::tracker_visit_expr has cognitive complexity 74 (threshold 15). Drivers by points: if/else 14 (36 pts), match/switch 12 (32 pts), loops 1 (5 pts), boolean chains 1 (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":"engine/baml-lib/jinja/src/evaluate_type/expr.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"03789752cf910b3a959cd79ab3e905843fe0d499245b9e379a195e64bfb59428"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_db::check::check_interfaces (cognitive 73): baml_db::check::check_interfaces has cognitive complexity 73 (threshold 15). Drivers by points: if/else 16 (41 pts), loops 11 (26 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 41). 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":"baml_language/crates/baml_db/src/check.rs"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee8225cc97e52cf9a52f47d9bec1eb2423c6d507bdf5712a20f7f72b60fe5c4"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::usages::find_member_usages (cognitive 73): baml_ide::usages::find_member_usages has cognitive complexity 73 (threshold 15). Drivers by points: if/else 17 (60 pts), loops 5 (13 pts) (nesting depth added 51). 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":"baml_language/crates/baml_ide/src/usages.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75a9c3ae17e269104487bea385d6e72ff94ee14696f36f0bbba9490691e28af"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::object (cognitive 73): Renderer::object has cognitive complexity 73 (threshold 15). Drivers by points: if/else 27 (54 pts), match/switch 5 (9 pts), loops 3 (7 pts), boolean chains 3 (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":"baml_language/crates/btel_reader/src/value.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"a369dcfebcc21c175d9799f6e5b5bd636b619b734732bc4770f2acd95a4cdf86"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_cffi_macros::generate_param_extraction (cognitive 72): baml_cffi_macros::generate_param_extraction has cognitive complexity 72 (threshold 15). Drivers by points: if/else 18 (69 pts), match/switch 1 (3 pts) (nesting depth added 53). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd39cfee4293ed2d50783521dbe3c47372d3dcc277531f22f333067187bf611c"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_cli::describe_command::write_description (cognitive 70): baml_cli::describe_command::write_description has cognitive complexity 70 (threshold 15). Drivers by points: if/else 23 (42 pts), loops 8 (23 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/describe_command.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"befdcbfbb7cadc66412b171d968b8f0fde8dfaeab8528e0416de750725e863ea"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_catch (cognitive 70): InferenceContext::infer_catch has cognitive complexity 70 (threshold 15). Drivers by points: if/else 24 (50 pts), loops 7 (10 pts), match/switch 3 (6 pts), boolean chains 4 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":11412}}}],"partialFingerprints":{"codehealthFindingId/v1":"106320a877e05fdaf41a1e587af97eeb20088d06f5614449a7e3db2a8aaefc89"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler::thir::interpret::evaluate_method_call (cognitive 70): baml_compiler::thir::interpret::evaluate_method_call has cognitive complexity 70 (threshold 15). Drivers by points: if/else 30 (63 pts), match/switch 4 (7 pts) (nesting depth added 36). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":2797}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a557245c25c00b8a9d8ff798e9dc4f5100fe6f51363c637dc2ee09a8658d9a3"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_emit::stack_carry::simulate_terminator_stack (cognitive 69): baml_compiler2_emit::stack_carry::simulate_terminator_stack has cognitive complexity 69 (threshold 15). Drivers by points: if/else 29 (63 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 35). 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":"baml_language/crates/baml_compiler2_emit/src/stack_carry.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"4370087fde06fdbb62859db9068e522625805a64f8e0df5e1d278611302dcf41"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_path_expr (cognitive 69): LoweringContext::lower_path_expr has cognitive complexity 69 (threshold 15). Drivers by points: if/else 25 (59 pts), match/switch 3 (6 pts), boolean chains 4 (nesting depth added 37). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":6424}}}],"partialFingerprints":{"codehealthFindingId/v1":"3131f760f2f3ac451ec6f00cd353eae5ec9954824cc88dc17a68597fd26136e4"}},{"ruleId":"D2","level":"warning","message":{"text":"proto._fill_wire_ty (cognitive 68): proto._fill_wire_ty has cognitive complexity 68 (threshold 15). Drivers by points: if/else 25 (47 pts), loops 3 (9 pts), ternaries 3 (9 pts), boolean chains 3 (nesting depth added 34). 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":"baml_language/sdks/python/src/baml_bridge/proto.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"c114a64f1a45f5742b578361a002ae2764909fd5924f9c0735f352fab5a5b87b"}},{"ruleId":"D2","level":"warning","message":{"text":"btel_record_smoke.measure (cognitive 68): btel_record_smoke.measure has cognitive complexity 68 (threshold 15). Drivers by points: if/else 9 (36 pts), loops 9 (21 pts), boolean chains 5, ternaries 1 (5 pts), error handling 1 (nesting depth added 43). 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":"baml_language/tools/btel_record_smoke.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"4815075ec33a4508792c19473d6e0dc1901376b8c194c809e8df136ea30c05cc"}},{"ruleId":"D2","level":"warning","message":{"text":"OutputFormatContent::render_impl (cognitive 67): OutputFormatContent::render_impl has cognitive complexity 67 (threshold 15). Drivers by points: if/else 32 (40 pts), loops 7 (15 pts), match/switch 3 (7 pts), boolean chains 5 (nesting depth added 20). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_ops/src/output_format.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb8dce2385b8ab491f1c3ad8f3d6a24b3363306ed2d70d34355fd7698d69455"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_csharp::semantic::render_program (cognitive 67): sdkgen_csharp::semantic::render_program has cognitive complexity 67 (threshold 15). Drivers by points: loops 19 (35 pts), if/else 17 (32 pts) (nesting depth added 31). 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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":3412}}}],"partialFingerprints":{"codehealthFindingId/v1":"5117c969e9e1624701318da68325a58cd955df02b1beb0fdf75e2a677d6d97a2"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_rust::translate_ty::translate_inner (cognitive 67): sdkgen_rust::translate_ty::translate_inner has cognitive complexity 67 (threshold 15). Drivers by points: if/else 21 (42 pts), match/switch 8 (16 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 33). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/rust/sdkgen_rust/src/translate_ty.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"477809d07b6401746de391b936b1e67af6ca71c1855763056b29dd993cb1a076"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parse (cognitive 67): parser.parse has cognitive complexity 67 (threshold 15). Drivers by points: if/else 25 (49 pts), loops 6 (10 pts), boolean chains 5, error handling 2 (3 pts) (nesting depth added 29). 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":"tools/bctl_src/oncall/parser.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a7b8a523709f897da28cdbfcf74b77f4c33a3c9f4899cab7687cc3fc1c1b04"}},{"ruleId":"D2","level":"warning","message":{"text":"Analysis::new (cognitive 66): Analysis::new has cognitive complexity 66 (threshold 15). Drivers by points: if/else 14 (34 pts), loops 19 (27 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 31). 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":"baml_language/crates/baml_compiler2_rust/src/structure.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f205988c96af628bafccff2376bbc225d21e34de6b061f33edb937b1e8fc149"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalState::dispatch_request (cognitive 66): GlobalState::dispatch_request has cognitive complexity 66 (threshold 15). Drivers by points: match/switch 37 (59 pts), if/else 3 (7 pts) (nesting depth added 26). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"baml_language/crates/baml_lsp/src/dispatch/mod.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ef84dcfcae2061506a30fdb71d9e6ee4543819c2091ffeaa95866c50591c61"}},{"ruleId":"D2","level":"warning","message":{"text":"btel_file::reader::check_references (cognitive 66): btel_file::reader::check_references has cognitive complexity 66 (threshold 15). Drivers by points: if/else 10 (32 pts), loops 10 (27 pts), match/switch 2 (7 pts) (nesting depth added 44). 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":"baml_language/crates/btel_file/src/reader.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c718ee6c30456c595a4a7e686e2bf2ae2e1d749dad61c5095d6399dfb5fab90"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_cpp::translate_ty (cognitive 66): sdkgen_cpp::translate_ty has cognitive complexity 66 (threshold 15). Drivers by points: if/else 21 (41 pts), match/switch 10 (21 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 32). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs"},"region":{"startLine":1662}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a351f378aeba65797adcbc5742e77559e48ffbe843e2722a7ae8dea16a98767"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_go.decodeDynamicValue (cognitive 66): baml_go.decodeDynamicValue has cognitive complexity 66 (threshold 15). Drivers by points: if/else 21 (49 pts), match/switch 5 (9 pts), loops 3 (6 pts), boolean chains 2 (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":"baml_language/sdks/go/baml_go/dynamic.go"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"6518ecac586b61a6bbdb3783987b14ab2f1578a36a0b5771b2d9948e2ff21ad4"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlUnion7._bamlDecode (cognitive 66): BamlUnion7._bamlDecode has cognitive complexity 66 (threshold 15). Drivers by points: if/else 31 (52 pts), boolean chains 14 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (BamlUnion7._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"da883e766b5c4a16585b6292ee5dfbfdc50dc98590a48e6fd9be97019408e496"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlUnion7._bamlDecode (cognitive 66): BamlUnion7._bamlDecode has cognitive complexity 66 (threshold 15). Drivers by points: if/else 31 (52 pts), boolean chains 14 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (BamlUnion7._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c15954ad347845a7d4cf0e865fcf04f9c56739e679c1ae0b882e0deabbb7fc6"}},{"ruleId":"D2","level":"warning","message":{"text":"OutputFormatContent::render (cognitive 65): OutputFormatContent::render has cognitive complexity 65 (threshold 15). Drivers by points: if/else 31 (47 pts), loops 6 (9 pts), match/switch 4 (6 pts), boolean chains 3 (nesting depth added 21). 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":"engine/baml-lib/jinja-runtime/src/output_format/types.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62ea77da0ecbb24bc0687c88d7ae2d307fc3cfb8e252baf08184d6174fca652"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::resolve::member_position_at (cognitive 64): baml_ide::resolve::member_position_at has cognitive complexity 64 (threshold 15). Drivers by points: if/else 11 (31 pts), match/switch 6 (14 pts), loops 4 (11 pts), boolean chains 8 (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":"baml_language/crates/baml_ide/src/resolve.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb99fb5427473391745699d226495d448bc2f2f63acb13887b7d7858b859a4e"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_parser::expr::infix (cognitive 64): baml_parser::expr::infix has cognitive complexity 64 (threshold 15). Drivers by points: if/else 27 (49 pts), boolean chains 8, match/switch 2 (6 pts), loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_parser/src/expr.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f1e3fbe5e98e63af0ffdf3c488706a845f149d65e49ab41df3f32ede5615ad"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_sap::deserializer::coercer::array_helper::pick_best (cognitive 64): bex_sap::deserializer::coercer::array_helper::pick_best has cognitive complexity 64 (threshold 15). Drivers by points: if/else 17 (27 pts), match/switch 13 (25 pts), boolean chains 12 (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":"baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9b93023e3c540dc889a188e5d0522846d52aac98c557204c6aced43494040f"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_rust::analyze::analyze (cognitive 64): sdkgen_rust::analyze::analyze has cognitive complexity 64 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 13 (19 pts), match/switch 4 (8 pts), boolean chains 5 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/rust/sdkgen_rust/src/analyze.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"2558fdfbe07efe263a71c31f5d93e4334de13bfaf6b84c1de37d7075f00ec90c"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_csharp::semantic::generate_program_inner (cognitive 63): sdkgen_csharp::semantic::generate_program_inner has cognitive complexity 63 (threshold 15). Drivers by points: loops 21 (35 pts), if/else 11 (24 pts), boolean chains 4 (nesting depth added 27). 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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2818bceb6b40b9b117d9e903565b74ab53591d67f14999369b82d142eb30c28"}},{"ruleId":"D2","level":"warning","message":{"text":"run-store-client.createRunStoreClient (cognitive 63): run-store-client.createRunStoreClient has cognitive complexity 63 (threshold 15). Drivers by points: if/else 20 (45 pts), loops 5 (9 pts), boolean chains 8, match/switch 1 (nesting depth added 29). Most of this is not in the body itself: 2 of the 63 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 244, rejectPending). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/run-store-client.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b17231ef4ab63ce183d1c62738bff41232103b1635b577c9a930258893934a"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::cursor_context::find_source_expr_ids_at (cognitive 62): baml_ide::cursor_context::find_source_expr_ids_at has cognitive complexity 62 (threshold 15). Drivers by points: if/else 15 (41 pts), match/switch 3 (10 pts), loops 3 (8 pts), boolean chains 3 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/cursor_context.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8dcd324a612757f7f24fe5a864c0918e22d27442800f384124fc8c7ebdc58c"}},{"ruleId":"D2","level":"warning","message":{"text":"BexVm::execute_call_from_locals_offset (cognitive 62): BexVm::execute_call_from_locals_offset has cognitive complexity 62 (threshold 15). Drivers by points: if/else 22 (42 pts), match/switch 10 (16 pts), boolean chains 4 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":7473}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9f70d7d534809d32d210a2296f458f36e0738d4e4d0aa0ac05620ec90f6a16"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_runtime::internal::llm_client::traits::process_media (cognitive 62): baml_runtime::internal::llm_client::traits::process_media has cognitive complexity 62 (threshold 15). Drivers by points: if/else 25 (53 pts), match/switch 4 (9 pts) (nesting depth added 33). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/traits/mod.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"79266a7d7767e0eac884a8104121520ffcc2fbe85c1ba12d48bc1d2c9da4f431"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::sub (cognitive 61): InferenceContext::sub has cognitive complexity 61 (threshold 15). Drivers by points: if/else 22 (36 pts), boolean chains 11, loops 4 (8 pts), match/switch 3 (6 pts) (nesting depth added 21). 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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":4559}}}],"partialFingerprints":{"codehealthFindingId/v1":"6413a67b97007125250efbc83f796c7f03903c0cca180ed918b599f92bab1a3e"}},{"ruleId":"D2","level":"warning","message":{"text":"LowerCtx::lower_path (cognitive 61): LowerCtx::lower_path has cognitive complexity 61 (threshold 15). Drivers by points: if/else 21 (42 pts), match/switch 4 (8 pts), boolean chains 6, loops 2 (5 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9060e37df1f69fdddad47bc9d0949f7a2b7b72690f41c77fade8b1c07afb9a5"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_stmt (cognitive 61): LoweringContext::lower_stmt has cognitive complexity 61 (threshold 15). Drivers by points: if/else 29 (48 pts), match/switch 6 (11 pts), loops 1 (2 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":11905}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78df83ab36c8b6e07dcd8094bd26919db27bc94c3285bcdd2ed768758179297"}},{"ruleId":"D2","level":"warning","message":{"text":"Matrix::specialize (cognitive 60): Matrix::specialize has cognitive complexity 60 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 6 (21 pts), match/switch 5 (15 pts), boolean chains 2 (nesting depth added 41). 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":"baml_language/crates/baml_compiler2_hir_ty/src/exhaustiveness.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d716c97e2e1e969edab8fb808b1d3b49bceff139a16241ed3d8e128b97341a3"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_lsp_server::playground_server::handle_ws_in_message (cognitive 60): baml_lsp_server::playground_server::handle_ws_in_message has cognitive complexity 60 (threshold 15). Drivers by points: match/switch 19 (38 pts), if/else 8 (16 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 29). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b8ef2108b156385584b09c41ba8efcbb5740af161f5459b74668e9cdfb6670"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_jinja::render_minijinja (cognitive 60): internal_baml_jinja::render_minijinja has cognitive complexity 60 (threshold 15). Drivers by points: if/else 16 (37 pts), match/switch 6 (14 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 31). 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":"engine/baml-lib/jinja-runtime/src/lib.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f92a2a730c18458a66520dbc18b0f5899718dc01b07c548729ba6f2fcd0e5d8"}},{"ruleId":"D2","level":"warning","message":{"text":"DetailPanel.LLMNodeContent (cognitive 60): DetailPanel.LLMNodeContent has cognitive complexity 60 (threshold 15). Drivers by points: boolean chains 28, if/else 19 (21 pts), ternaries 7 (10 pts), match/switch 1 (nesting depth added 5). Of this number, 26 points are the body\u0027s own statements and 34 belong to 13 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a4a1a00ff1fbfdd33cb0a5009271b36bf5eee411e9587e6dc6162425aea288"}},{"ruleId":"D2","level":"warning","message":{"text":"SmartEdge.mergePoints (cognitive 60): SmartEdge.mergePoints has cognitive complexity 60 (threshold 15). Drivers by points: if/else 18 (36 pts), ternaries 8 (20 pts), boolean chains 4 (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/smart-edge.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"0016143f284cd3d1fd751d0379e99d5b20a4c2f716e951951649a27581b8bae8"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_mir::pretty::write_terminator (cognitive 59): baml_compiler2_mir::pretty::write_terminator has cognitive complexity 59 (threshold 15). Drivers by points: if/else 16 (39 pts), loops 6 (14 pts), match/switch 3 (6 pts) (nesting depth added 34). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/pretty.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"1322186232e896bdf2deba74659a37b888d217c403532d110a7aa2298cbd2464"}},{"ruleId":"D2","level":"warning","message":{"text":"Translator::raw (cognitive 59): Translator::raw has cognitive complexity 59 (threshold 15). Drivers by points: if/else 20 (39 pts), loops 6 (14 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 29). 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":"baml_language/crates/baml_query_btel/src/sql.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f936beb1f59623b4b85e501c3aaebbfc457eb52360fe0b91f4aae6a2fc32410"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler::thir::typecheck::typecheck_statement (cognitive 59): baml_compiler::thir::typecheck::typecheck_statement has cognitive complexity 59 (threshold 15). Drivers by points: if/else 24 (50 pts), match/switch 5 (9 pts) (nesting depth added 30). 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":"engine/baml-compiler/src/thir/typecheck.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"792b96882538850de3caa68046b3f922cbef298ecfc00c5ae1f9dcc87fd54d6b"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassTy::coerce (cognitive 58): ClassTy::coerce has cognitive complexity 58 (threshold 15). Drivers by points: if/else 16 (31 pts), match/switch 6 (15 pts), loops 3 (9 pts), boolean chains 3 (nesting depth added 30). 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":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_class.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"67aa4fe57bbd9bf79c246aceb7fec67148b313c55399f046da775aebb49190d4"}},{"ruleId":"D2","level":"warning","message":{"text":"HirCompiler::compile_statement (cognitive 58): HirCompiler::compile_statement has cognitive complexity 58 (threshold 15). Drivers by points: if/else 13 (33 pts), match/switch 11 (22 pts), loops 1 (3 pts) (nesting depth added 33). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/codegen.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b9639d3c87712317abd5a82930b93bbfafaef896bec9ebeab7361ad089a8ce"}},{"ruleId":"D2","level":"warning","message":{"text":"jsonish::deserializer::coercer::array_helper::pick_best (cognitive 58): jsonish::deserializer::coercer::array_helper::pick_best has cognitive complexity 58 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 11 (23 pts), boolean chains 11 (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":"engine/baml-lib/jsonish/src/deserializer/coercer/array_helper.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0200e8c71a0ec0599109272587fbd4328fc64782424cc707bd4ff5b807c83e41"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::cfg::ast_test_control_flow_graph_impl (cognitive 57): baml_ide::cfg::ast_test_control_flow_graph_impl has cognitive complexity 57 (threshold 15). Drivers by points: if/else 15 (50 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/cfg.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f828277011477915eb8d2c401bf090a79e391ef89dc9896f5baa192a033f9329"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_baml::csv::poll_record (cognitive 57): bex_vm::package_baml::csv::poll_record has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (41 pts), match/switch 3 (9 pts), loops 2 (7 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63b45fe4d1fe18e89d9c45d8bd4cea427c14ecbfe3e307fead47845d6341a51"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm_types::head_walk::visit_object_heads (cognitive 57): bex_vm_types::head_walk::visit_object_heads has cognitive complexity 57 (threshold 15). Drivers by points: loops 22 (53 pts), if/else 1 (3 pts), match/switch 1 (nesting depth added 33). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (bex_vm_types::head_walk::visit_object_heads_mut) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm_types/src/head_walk.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"77edbc25673b4066581ae62bd1bcedee6613e5f0a6ac94fe98d2ff082a8da9d8"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm_types::head_walk::visit_object_heads_mut (cognitive 57): bex_vm_types::head_walk::visit_object_heads_mut has cognitive complexity 57 (threshold 15). Drivers by points: loops 22 (53 pts), if/else 1 (3 pts), match/switch 1 (nesting depth added 33). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (bex_vm_types::head_walk::visit_object_heads) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm_types/src/head_walk.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"99884734d8d16c940c8752fd700bc03cbe1bd8dc63b1cd116c0dda5a4bb15afb"}},{"ruleId":"D2","level":"warning","message":{"text":"btel_bcs::delivery::run_worker (cognitive 57): btel_bcs::delivery::run_worker has cognitive complexity 57 (threshold 15). Drivers by points: if/else 11 (31 pts), match/switch 6 (17 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 34). 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":"baml_language/crates/btel_bcs/src/delivery.rs"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73e8e061fedb9352e4f59147d69cbf93640ed5014ab8793a435a8c133c1b233"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_csharp::semantic::collect_methods (cognitive 57): sdkgen_csharp::semantic::collect_methods has cognitive complexity 57 (threshold 15). Drivers by points: if/else 21 (39 pts), match/switch 4 (9 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"31df32bb6e3e0d2bf61904ac46d5a15a80e6d1081cf352646686bea2b6c29069"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_python_pydantic2::leaf::render_leaf_body (cognitive 57): sdkgen_python_pydantic2::leaf::render_leaf_body has cognitive complexity 57 (threshold 15). Drivers by points: if/else 24 (30 pts), loops 9 (18 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":1737}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6deb83baa6b0e70c0c9fa55066f8bcf53c288f8a215995c85712cd8a5cb028a"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_rust::emit::class::fields_struct (cognitive 57): sdkgen_rust::emit::class::fields_struct has cognitive complexity 57 (threshold 15). Drivers by points: if/else 24 (32 pts), match/switch 6 (14 pts), boolean chains 10, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/rust/sdkgen_rust/src/emit/class.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0f265690affa2a6ff120dc53336b9ad427b99fb1f07576e4fe983ab2b42614"}},{"ruleId":"D2","level":"warning","message":{"text":"Class::coerce (cognitive 57): Class::coerce has cognitive complexity 57 (threshold 15). Drivers by points: if/else 19 (33 pts), match/switch 10 (18 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/deserializer/coercer/ir_ref/coerce_class.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6b73d0dfe63b197d3befa8fda28ef71a52755d8a04b718d55cd3f2f6ecf0c3"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlUnion6._bamlDecode (cognitive 57): BamlUnion6._bamlDecode has cognitive complexity 57 (threshold 15). Drivers by points: if/else 27 (45 pts), boolean chains 12 (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. This shape REPEATS in the file: one other method here (BamlUnion6._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"408e2fb16c62c89b2bceb67a5f0de662a3fd6269e30085f2ad920c128bc6bf9b"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlUnion6._bamlDecode (cognitive 57): BamlUnion6._bamlDecode has cognitive complexity 57 (threshold 15). Drivers by points: if/else 27 (45 pts), boolean chains 12 (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. This shape REPEATS in the file: one other method here (BamlUnion6._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3a50ca08ef5eb70fc0de81263e7814c657074f0903de232cb2a3e211f95289"}},{"ruleId":"D2","level":"warning","message":{"text":"Applier::apply (cognitive 56): Applier::apply has cognitive complexity 56 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 9 (19 pts), match/switch 2 (10 pts), boolean chains 2 (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":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"819a219cb9a85aa8e5cf5354d8f8a9f395d1c0ab81fbcffc61b9322765d66b68"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_sap::jsonish::parser::entry::parse_func (cognitive 56): bex_sap::jsonish::parser::entry::parse_func has cognitive complexity 56 (threshold 15). Drivers by points: match/switch 10 (29 pts), if/else 15 (26 pts), boolean chains 1 (nesting depth added 30). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/entry.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9234a8992dda5cb682af1d9b2952a584ffae12c9669391077803b0408e9a60"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_go.decodeReflected (cognitive 56): baml_go.decodeReflected has cognitive complexity 56 (threshold 15). Drivers by points: if/else 33 (54 pts), boolean chains 1, match/switch 1 (nesting depth added 21). 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":"baml_language/sdks/go/baml_go/dynamic.go"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"f219c7a06fe9222af1c01548a5c55b2d4ad146468a65bb8add1bac70f6692f91"}},{"ruleId":"D2","level":"warning","message":{"text":"page.loadExamples (cognitive 56): page.loadExamples has cognitive complexity 56 (threshold 15). Drivers by points: if/else 13 (35 pts), loops 3 (7 pts), boolean chains 6, error handling 1 (4 pts), ternaries 1 (4 pts) (nesting depth added 32). Of this number, 50 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. 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":"engine/baml-runtime/src/control_flow/mermaid-sandbox/app/page.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"45025a24a6872fefd038d0061dc7249332f8cc4144ad70bcca50ed10b1a27935"}},{"ruleId":"D2","level":"warning","message":{"text":"DetailPanel.StandardNodeContent (cognitive 56): DetailPanel.StandardNodeContent has cognitive complexity 56 (threshold 15). Drivers by points: boolean chains 27, if/else 19 (21 pts), ternaries 5 (7 pts), match/switch 1 (nesting depth added 4). Of this number, 22 points are the body\u0027s own statements and 34 belong to 14 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cf1a46e9de0d976ca429356fce585b948ceca3a31d3ff76d6110cbbf04c6fb"}},{"ruleId":"D2","level":"warning","message":{"text":"ai-assistant-panel.AIAssistantPanel (cognitive 56): ai-assistant-panel.AIAssistantPanel has cognitive complexity 56 (threshold 15). Drivers by points: if/else 18 (30 pts), boolean chains 14, ternaries 9 (10 pts), error handling 1, loops 1 (nesting depth added 13). Most of this is not in the body itself: 12 of the 56 points are its own statements and the rest belongs to 11 function items inside it that branch (a function literal at line 93, handleQuickAction, a function literal at line 201, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ai-assistant/ai-assistant-panel.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9832b17446a40bb6bd8bcd630de58fc8df4220a9ab13255bc36625e53c74a3"}},{"ruleId":"D2","level":"warning","message":{"text":"TelemetryView.OverviewTab (cognitive 56): TelemetryView.OverviewTab has cognitive complexity 56 (threshold 15). Drivers by points: ternaries 22 (40 pts), boolean chains 16 (nesting depth added 18). Of this number, 51 points are the body\u0027s own statements and 5 belong to 6 function literals inside it that branch. 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":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca1ac504b8c1d32e89489ce5130765f59fc46b21abbaa4fe358080eaca88d8f"}},{"ruleId":"D2","level":"warning","message":{"text":"sys_ops::output_format::walk_ty (cognitive 55): sys_ops::output_format::walk_ty has cognitive complexity 55 (threshold 15). Drivers by points: if/else 18 (43 pts), loops 4 (10 pts), boolean chains 1, match/switch 1 (nesting depth added 31). 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":"baml_language/crates/sys_ops/src/output_format.rs"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf27ff3a88507252e882144d7f187cd70829aa3b107c93e95e7ec6dcb2f9fe3"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_cffi_macros::is_result_vec_rawptrtype (cognitive 55): baml_cffi_macros::is_result_vec_rawptrtype has cognitive complexity 55 (threshold 15). Drivers by points: if/else 10 (55 pts) (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 3 other methods here (baml_cffi_macros::is_result_option_rawptrtype, baml_cffi_macros::is_result_option_bamlvalue, baml_cffi_macros::is_result_option_string) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf4b35da136a4038e3b9bab253d71e963328ae6c20822d424f443ecdfb872ed"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_cffi_macros::is_result_option_rawptrtype (cognitive 55): baml_cffi_macros::is_result_option_rawptrtype has cognitive complexity 55 (threshold 15). Drivers by points: if/else 10 (55 pts) (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 3 other methods here (baml_cffi_macros::is_result_vec_rawptrtype, baml_cffi_macros::is_result_option_bamlvalue, baml_cffi_macros::is_result_option_string) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"acfc8a43af797e700a086d2fab5877f75f80f5c7ea52e20b27ab06f18fcb249d"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_cffi_macros::is_result_option_bamlvalue (cognitive 55): baml_cffi_macros::is_result_option_bamlvalue has cognitive complexity 55 (threshold 15). Drivers by points: if/else 10 (55 pts) (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 3 other methods here (baml_cffi_macros::is_result_vec_rawptrtype, baml_cffi_macros::is_result_option_rawptrtype, baml_cffi_macros::is_result_option_string) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52d2f819f3ccf2d5eacaa0714119617b47d8fbddc338b9ddf20d363909cef6a"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_cffi_macros::is_result_option_string (cognitive 55): baml_cffi_macros::is_result_option_string has cognitive complexity 55 (threshold 15). Drivers by points: if/else 10 (55 pts) (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 3 other methods here (baml_cffi_macros::is_result_vec_rawptrtype, baml_cffi_macros::is_result_option_rawptrtype, baml_cffi_macros::is_result_option_bamlvalue) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae9bd36ef8224eb3d98bc27389cb0f420596fd55d4526f937bbd9a77f35aabf"}},{"ruleId":"D2","level":"warning","message":{"text":"audit-site.main (cognitive 54): audit-site.main has cognitive complexity 54 (threshold 15). Drivers by points: if/else 15 (34 pts), loops 6 (9 pts), boolean chains 7, ternaries 2 (4 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/scripts/audit-site.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"28227753b1d1b0ade1f9cc5e8600d2ce2dbc264520a50d63fc3901747aebd788"}},{"ruleId":"D2","level":"warning","message":{"text":"page.BcsProposal (cognitive 54): page.BcsProposal has cognitive complexity 54 (threshold 15). Drivers by points: ternaries 22 (25 pts), boolean chains 21, if/else 7 (8 pts) (nesting depth added 4). Of this number, 49 points are the body\u0027s own statements and 5 belong to 3 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/page.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ccc23c250dd1d95646af077e2d893eafc495224dd58597aa3525d876da59054"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_lambda (cognitive 53): InferenceContext::infer_lambda has cognitive complexity 53 (threshold 15). Drivers by points: if/else 21 (36 pts), match/switch 7 (10 pts), loops 2 (4 pts), boolean chains 3 (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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":8793}}}],"partialFingerprints":{"codehealthFindingId/v1":"24bfe084897c563cd3f2d85587b288ded2ac59da26f8d151c89ba2ef1c493315"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_size_gate::output::render_aggregate_markdown (cognitive 53): cargo_size_gate::output::render_aggregate_markdown has cognitive complexity 53 (threshold 15). Drivers by points: if/else 19 (28 pts), loops 7 (21 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/tools_size_gate/src/output.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8afbf515068e2a7176f550fb20d0a8db30e2ed4a8d38166f75d247197ff69d"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::member_callee (cognitive 52): InferenceContext::member_callee has cognitive complexity 52 (threshold 15). Drivers by points: if/else 23 (44 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":6945}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cce5a6f489e6b9ba91377b3ae455f8e139b177c788c6d9cd76a973e27c733e"}},{"ruleId":"D2","level":"warning","message":{"text":"btel_snapshot::host::add (cognitive 52): btel_snapshot::host::add has cognitive complexity 52 (threshold 15). Drivers by points: if/else 19 (42 pts), match/switch 3 (6 pts), loops 2 (4 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_snapshot/src/host.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7415a3ee88e968fe9670de7ed49c4949deb09211441c724ed40cf9ce77721d"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeExprKind::fmt (cognitive 51): TypeExprKind::fmt has cognitive complexity 51 (threshold 15). Drivers by points: if/else 18 (39 pts), loops 4 (10 pts), boolean chains 1, match/switch 1 (nesting depth added 27). Of this number, 49 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"baml_language/crates/baml_compiler2_ast/src/ast.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb7fecb708ee3faa247b22194012d36a1b1a58423d68187aab94cee16d39694"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeRefDisplay::fmt (cognitive 51): TypeRefDisplay::fmt has cognitive complexity 51 (threshold 15). Drivers by points: if/else 18 (39 pts), loops 4 (10 pts), boolean chains 1, match/switch 1 (nesting depth added 27). Of this number, 49 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"baml_language/crates/baml_compiler2_hir/src/type_ref.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f6c159e91c0c1557507a8c9d1f17a5360776a0eacce36d4a906abb65e0b552"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::method_resolution::lookup_impl_member (cognitive 51): baml_compiler2_hir_ty::method_resolution::lookup_impl_member has cognitive complexity 51 (threshold 15). Drivers by points: match/switch 7 (26 pts), if/else 11 (18 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 27). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"baml_language/crates/baml_compiler2_hir_ty/src/method_resolution.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"c099b576249189fadc4a65a6e731825faa605a7ab2cd806b2a2eeb677053babb"}},{"ruleId":"D2","level":"warning","message":{"text":"Diagnostic::fmt (cognitive 51): Diagnostic::fmt has cognitive complexity 51 (threshold 15). Drivers by points: if/else 18 (31 pts), match/switch 8 (16 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bcs_api/src/diagnostics.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c59fbbd244f0ff222e9c05abf798b99872639e8d69ac8e35a184fe9ff3ada8"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_ast::parser::parse_type_expression_block::parse_type_expression_block (cognitive 51): internal_baml_ast::parser::parse_type_expression_block::parse_type_expression_block has cognitive complexity 51 (threshold 15). Drivers by points: match/switch 9 (37 pts), if/else 4 (9 pts), loops 3 (5 pts) (nesting depth added 35). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"engine/baml-lib/ast/src/parser/parse_type_expression_block.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0775e4610512f088355070170513c85ff8b4e13413dd14da8c7aacd3ba6a17"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_go.validateJSONSelectedPayload (cognitive 51): baml_go.validateJSONSelectedPayload has cognitive complexity 51 (threshold 15). Drivers by points: if/else 20 (40 pts), loops 3 (6 pts), boolean chains 4, match/switch 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/json.go"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa56aa3eb3acfe4bc58e6953cddc3ddf4bbc1f51f9a5a0e7ef0ac75aa749827d"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphView.GraphViewInner (cognitive 51): GraphView.GraphViewInner has cognitive complexity 51 (threshold 15). Drivers by points: ternaries 20 (22 pts), if/else 17 (18 pts), boolean chains 7, loops 4 (nesting depth added 3). Most of this is not in the body itself: 11 of the 51 points are its own statements and the rest belongs to 14 function literals inside it that branch (lines 283, 483, 397, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/graph/GraphView.tsx"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"90fe1bdbc32b27459bcddc153b3f6947b4c46c23c685ed1ec1113897f1220598"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_mir::optimize::eliminate_dead_locals (cognitive 50): baml_compiler2_mir::optimize::eliminate_dead_locals has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 9 (13 pts), match/switch 2 (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":"baml_language/crates/baml_compiler2_mir/src/optimize.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"8afbb38a5c64ed4afc901c596ae4ba7814d1e9eb1a2304e18147679b76e97a4b"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_baml::json::copy_json (cognitive 50): bex_vm::package_baml::json::copy_json has cognitive complexity 50 (threshold 15). Drivers by points: if/else 9 (27 pts), match/switch 6 (18 pts), loops 3 (5 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/json/mod.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e0ded5a8ccdf4645b158d23fa2ffaa4a725365910c1fb0a6b03a9ca9ab0c01"}},{"ruleId":"D2","level":"warning","message":{"text":"btel_file::reader::validate_file (cognitive 50): btel_file::reader::validate_file has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 12, loops 4 (9 pts), match/switch 1 (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":"baml_language/crates/btel_file/src/reader.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbfc1728303b668478eef34b3e2f26dd46a1f4dd66bd1fbe9bb44d383c4b8338"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_stow::main (cognitive 50): cargo_stow::main has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (27 pts), loops 10 (14 pts), match/switch 4 (9 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":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":2577}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2aa676309f2a72a344f335e2edd521df338cfcd9fbe28c10ef6f8d001101e9"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_rust::analyze::compute_sccs (cognitive 50): sdkgen_rust::analyze::compute_sccs has cognitive complexity 50 (threshold 15). Drivers by points: if/else 9 (30 pts), loops 5 (15 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 34). 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":"baml_language/sdks/rust/sdkgen_rust/src/analyze.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0bbbca57b02f21859f7f9832e60c2864bc2431cf425b26883d87d33545d5f0"}},{"ruleId":"D2","level":"warning","message":{"text":"run.main (cognitive 50): run.main has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 5 (8 pts), ternaries 3 (7 pts), boolean chains 3, error handling 1 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/gc_policy/run.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8088dcde9865cff853e8a83ff9d45b0af0cf70934682ea16335752a4126106dd"}},{"ruleId":"D2","level":"warning","message":{"text":"ApiKeysDialog.ApiKeysDialog (cognitive 50): ApiKeysDialog.ApiKeysDialog has cognitive complexity 50 (threshold 15). Drivers by points: boolean chains 19, if/else 8 (13 pts), ternaries 11 (13 pts), loops 5 (nesting depth added 7). Most of this is not in the body itself: 8 of the 50 points are its own statements and the rest belongs to 10 function items inside it that branch (renderRow, handleImport, a function literal at line 92, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/components/ApiKeysDialog.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9bf062b1774a0e8b3ef9cd699e0729f83aafd9777ed3b909c913e258135839"}},{"ruleId":"D2","level":"warning","message":{"text":"WitnessPat::render (cognitive 49): WitnessPat::render has cognitive complexity 49 (threshold 15). Drivers by points: if/else 10 (34 pts), loops 4 (10 pts), match/switch 3 (5 pts) (nesting depth added 32). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/exhaustiveness.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a8ce0fde386379578637a6aacce006fee4ec79c80ada17fc4cd7191c9a45d7"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler::thir::interpret::check_watch_changes (cognitive 49): baml_compiler::thir::interpret::check_watch_changes has cognitive complexity 49 (threshold 15). Drivers by points: loops 9 (21 pts), if/else 6 (18 pts), match/switch 4 (10 pts) (nesting depth added 30). 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":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"54378eff09a3cac552c3e23e19bf556d283fb64f6f87d5597562a2a50b5683e8"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler::thir::interpret::evaluate_binary_op (cognitive 49): baml_compiler::thir::interpret::evaluate_binary_op has cognitive complexity 49 (threshold 15). Drivers by points: match/switch 16 (28 pts), if/else 7 (21 pts) (nesting depth added 26). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":2341}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0077d7ea32cc204eb6fef93b1ef8e8a36403f7406db7dd577e120615f7f00c"}},{"ruleId":"D2","level":"warning","message":{"text":"GenerateUnionSource (cognitive 48): GenerateUnionSource has cognitive complexity 48 (threshold 15). Of this number, 45 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.UnionGenerator/Program.cs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02330b50702d12b3b4b9d9dcacb81964198d79e0b8c1cbc194290abd2e543e6"}},{"ruleId":"D2","level":"warning","message":{"text":"Facts::project (cognitive 48): Facts::project has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 6 (13 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/facts.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a0cfe55d47948aaef187e475b9c840078ac170f81ded8702430c8b8f739142"}},{"ruleId":"D2","level":"warning","message":{"text":"BexVm::set_entry_point_with_type_args (cognitive 48): BexVm::set_entry_point_with_type_args has cognitive complexity 48 (threshold 15). Drivers by points: if/else 17 (28 pts), match/switch 7 (15 pts), boolean chains 5 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":5114}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43c771a97a2a379edfb92f37823e79172d23dbb2ba2925645b3629927cfd726"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_go::render_callback_codecs (cognitive 48): sdkgen_go::render_callback_codecs has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 6 (14 pts), match/switch 5 (11 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":4444}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a11b700d175ca124543622863aab2e915c84016f6fa98094fedb41b25021ea"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_ast::parser::parse_value_expression_block::parse_value_expression_block (cognitive 48): internal_baml_ast::parser::parse_value_expression_block::parse_value_expression_block has cognitive complexity 48 (threshold 15). Drivers by points: match/switch 8 (28 pts), if/else 7 (12 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 27). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"engine/baml-lib/ast/src/parser/parse_value_expression_block.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ee60d84bbf1233f45db4e78e6935d2d0302d79d553f4a4a586c51015b4294d"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_core::ir::ir_helpers::get_dummy_value (cognitive 48): internal_baml_core::ir::ir_helpers::get_dummy_value has cognitive complexity 48 (threshold 15). Drivers by points: if/else 22 (39 pts), match/switch 5 (9 pts) (nesting depth added 21). Of this number, 47 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"e886c2a03c1b37abe061178865ebbb73737cd25610b538160033dca98a4bc9cc"}},{"ruleId":"D2","level":"warning","message":{"text":"jsonish::jsonish::parser::entry::parse_func (cognitive 48): jsonish::jsonish::parser::entry::parse_func has cognitive complexity 48 (threshold 15). Drivers by points: match/switch 12 (34 pts), if/else 9 (13 pts), boolean chains 1 (nesting depth added 26). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"engine/baml-lib/jsonish/src/jsonish/parser/entry.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12834dd0b8ff1fdc80290d9c2af986d1081d46ab57e0abdc2b85e8230fdcfdb"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlUnion5._bamlDecode (cognitive 48): BamlUnion5._bamlDecode has cognitive complexity 48 (threshold 15). Drivers by points: if/else 23 (38 pts), boolean chains 10 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (BamlUnion5._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"421cce08d712df5bc31c9f549fb26cc275bb031afd24401aea12b4fdce48e0bf"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlUnion5._bamlDecode (cognitive 48): BamlUnion5._bamlDecode has cognitive complexity 48 (threshold 15). Drivers by points: if/else 23 (38 pts), boolean chains 10 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (BamlUnion5._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7e77a3e69cbfeb4c0f60afaeecfbe8b3b61468cefc193ae6a1967b2211e36a"}},{"ruleId":"D2","level":"warning","message":{"text":"Workbench.Workbench (cognitive 48): Workbench.Workbench has cognitive complexity 48 (threshold 15). Drivers by points: ternaries 19 (36 pts), if/else 6 (7 pts), boolean chains 4, loops 1 (nesting depth added 18). Most of this is not in the body itself: 15 of the 48 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 226, 58, 107, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_components/Workbench.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"92520799c62c5ef4e2f93bf57b98d0104a78bd669e0de9d1af61828e6a4f3e49"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::infer::trace_hooks::checked_declaration (cognitive 47): baml_compiler2_hir_ty::infer::trace_hooks::checked_declaration has cognitive complexity 47 (threshold 15). Drivers by points: if/else 21 (32 pts), match/switch 5 (9 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer/trace_hooks.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d59937caba1edaad92d6b93d4a5eeda816f5b97341e0a0872f983b1c8215bd3"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_go::render_union_codecs (cognitive 47): sdkgen_go::render_union_codecs has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (37 pts), loops 4 (9 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":4050}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a58c3d9f5e29381160671c580f6f9894b3cd74ac51dd136c36b5227260c64f6"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_java::to_source_code_internal (cognitive 47): sdkgen_java::to_source_code_internal has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 15 (17 pts), match/switch 4 (9 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/sdkgen_java/src/lib.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a6869d4acfadd0567ea4de54fb4914732fc78f47b300610244b325a979b663"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_jinja::minijinja_value_to_json (cognitive 47): internal_baml_jinja::minijinja_value_to_json has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (38 pts), loops 2 (8 pts), match/switch 1 (nesting depth added 28). 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":"engine/baml-lib/jinja-runtime/src/lib.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"24eeab8525abfc16007b561e826b5f70f22885bbf48df80b12eedddc9f7e0903"}},{"ruleId":"D2","level":"warning","message":{"text":"WasmRuntime::run_tests (cognitive 47): WasmRuntime::run_tests has cognitive complexity 47 (threshold 15). Drivers by points: if/else 9 (24 pts), match/switch 3 (12 pts), loops 4 (11 pts) (nesting depth added 31). 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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":2027}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7777752898ccf4793625140ad5539bfafe3cbffde581fcf042dadcfb94a165"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_go.encodeAny (cognitive 47): baml_go.encodeAny has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (38 pts), loops 3 (7 pts), boolean chains 1, match/switch 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/dynamic.go"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c98112fd6c8455855b2c3883b7d201f8052226fdcb4f14beb98466b5602b64d"}},{"ruleId":"D2","level":"warning","message":{"text":"http.createRequestHandler.\u003Creturned closure\u003E (cognitive 47): http.createRequestHandler.\u003Creturned closure\u003E has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (16 pts), error handling 8 (15 pts), boolean chains 10, ternaries 2 (6 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/http.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c26f3b6498c5416306def090205f65e97494dfe3f4ced03be41904fc3aead9d"}},{"ruleId":"D2","level":"warning","message":{"text":"loadRuns (cognitive 47): loadRuns has cognitive complexity 47 (threshold 15). Drivers by points: if/else 10 (31 pts), error handling 2 (7 pts), loops 3 (7 pts), boolean chains 1, other 1 (nesting depth added 30). Of this number, 46 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/api-server.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"00eb35dcea16cd073bcc960598a0f37d5e92bba6019e50457e468b939744658a"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_emit::analysis::collect_uses_in_terminator (cognitive 46): baml_compiler2_emit::analysis::collect_uses_in_terminator has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (39 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 26). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/analysis.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6790e5f8ad74ef3e0cef16f36c4f893847b14ec3d8e83173af557a1e2d637e7"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::lower_array_pattern (cognitive 46): InferenceContext::lower_array_pattern has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (26 pts), match/switch 5 (8 pts), boolean chains 7, loops 4 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"23771b04ef3f664bb7b299afc6995b4a48ed522fc17e5c2c1e3cbbe5534cb562"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::defaults::collect_default_expr_forward_references (cognitive 46): baml_compiler2_hir_ty::defaults::collect_default_expr_forward_references has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 11 (22 pts), boolean chains 1, match/switch 1 (nesting depth added 23). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/defaults.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"65283e5e11e9f8512193b343c4c32f7acfdc8b36fd9fe568f4b0ebe933103e1a"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_mir::pretty::write_rvalue (cognitive 46): baml_compiler2_mir::pretty::write_rvalue has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 6 (13 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":"baml_language/crates/baml_compiler2_mir/src/pretty.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3a4f1054a458d51ea1ee45d04f9da9c548b71c6997145bfc80b20eb68d1ccd"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_type::normalize::mu::algebra_pass (cognitive 46): baml_type::normalize::mu::algebra_pass has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (33 pts), loops 3 (8 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/normalize/mu.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f3ad42756682fb63c30eb752d0795a37aab02ae71a76bcc8a2b3802bd9157b"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_baml::json::path::select (cognitive 46): bex_vm::package_baml::json::path::select has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (32 pts), loops 4 (9 pts), boolean chains 5 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/json/path.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"85947547d46c165f98f554309fc3f759ced64838d3d1d8de83c5408bbc8ecbe5"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_baml::toml::reconcile (cognitive 46): bex_vm::package_baml::toml::reconcile has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 4 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 29). 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":"baml_language/crates/bex_vm/src/package_baml/toml.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f2e5e0f93cc2a8293b985c528ad9041cdc8ca087c45f1fac0c91e9445cde33"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_jinja_types::evaluate_type::expr::handle_enum_binary_operation (cognitive 46): internal_baml_jinja_types::evaluate_type::expr::handle_enum_binary_operation has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (39 pts), match/switch 4 (7 pts) (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jinja/src/evaluate_type/expr.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba9dc48c833c3491f98d3bab2138246f98426c4992bf95752d22fd348b787f1"}},{"ruleId":"D2","level":"warning","message":{"text":"OutputFormat::call (cognitive 46): OutputFormat::call has cognitive complexity 46 (threshold 15). Drivers by points: match/switch 12 (26 pts), if/else 20 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jinja-runtime/src/output_format/mod.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf75f0b8b89c6942aef084e580dfe6c2d0cac53cbded165cdbec52d35337d53"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_mir::optimize::collect_place_bound_locals (cognitive 45): baml_compiler2_mir::optimize::collect_place_bound_locals has cognitive complexity 45 (threshold 15). Drivers by points: loops 11 (29 pts), match/switch 5 (9 pts), if/else 4 (7 pts) (nesting depth added 25). Of this number, 27 points are the body\u0027s own statements and 18 belong to 4 function items inside it that branch. 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":"baml_language/crates/baml_compiler2_mir/src/optimize.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fbc6019c02dd865cc68cf29763b0760fed0b31ea7d5a944a90307812a7b255"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_mir::optimize::values::fold_constants (cognitive 45): baml_compiler2_mir::optimize::values::fold_constants has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (32 pts), loops 4 (7 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/optimize/values.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b8505f0374755273b9733009f26b93a5182868acdd6c26d99a2c681a76f045"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonInhabitance::solve (cognitive 45): JsonInhabitance::solve has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 9 (17 pts), boolean chains 4 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/json_inhabit.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"4433c7b463d563deca983505619c185d7dd70af2afa02a2d912c0045efe649d6"}},{"ruleId":"D2","level":"warning","message":{"text":"BexHeap::add_references_to_worklist (cognitive 45): BexHeap::add_references_to_worklist has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (33 pts), loops 5 (10 pts), boolean chains 1, match/switch 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_heap/src/gc.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"c297a68a7c862c876c7509601d18face74ec3ca097dc077e49b7962991e88502"}},{"ruleId":"D2","level":"warning","message":{"text":"Processor::process_available (cognitive 45): Processor::process_available has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (30 pts), loops 2 (9 pts), match/switch 1 (5 pts), boolean chains 1 (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_processor/src/lib.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"461f5c0bcfecdb3e52d70e196d782695848a49e7fc5e25cdb4b0b3ecde7b53b9"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_cpp::render_header (cognitive 45): sdkgen_cpp::render_header has cognitive complexity 45 (threshold 15). Drivers by points: loops 13 (27 pts), if/else 6 (11 pts), match/switch 4 (7 pts) (nesting depth added 22). 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":"baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs"},"region":{"startLine":2176}}}],"partialFingerprints":{"codehealthFindingId/v1":"7021429688f6e219d6161e3f3bbc3c56cfa8fe69cbb53754a3b1c860488a6f52"}},{"ruleId":"D2","level":"warning","message":{"text":"UnresolvedAwsBedrock::resolve (cognitive 45): UnresolvedAwsBedrock::resolve has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (26 pts), match/switch 12 (19 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/llm-client/src/clients/aws_bedrock.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"176db3df77f020ea2e1ca3aa646e199b17b6fe45003fa88f30e357a65ec73435"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_cffi_macros::is_result_vec_convertible_to_rawptr (cognitive 45): baml_cffi_macros::is_result_vec_convertible_to_rawptr has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (45 pts) (nesting depth added 36). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"217bd5bc6b2ff4aa6329933d93d1932b63f3239317e38e9ab424c2be9537335b"}},{"ruleId":"D2","level":"warning","message":{"text":"page.ProfilePage (cognitive 45): page.ProfilePage has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 10 (16 pts), boolean chains 15, if/else 10 (12 pts), error handling 2 (nesting depth added 8). Of this number, 31 points are the body\u0027s own statements and 14 belong to 5 function items inside it that branch. 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":"typescript2/app-beps/src/app/profile/page.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e85cb530625f3d4240376faa7ca1912aebe87c87f4456f701ca7b0542e5a383"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_query_btel::query::run (cognitive 44): baml_query_btel::query::run has cognitive complexity 44 (threshold 15). Drivers by points: if/else 22 (31 pts), match/switch 3 (8 pts), loops 4 (5 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/query.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f3e3f746e859f1113aee0069ec1e1cd60f085e2c7267149dd427dd434c1819"}},{"ruleId":"D2","level":"warning","message":{"text":"Code::group (cognitive 44): Code::group has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 7 (15 pts), match/switch 2 (4 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_reader/src/value/code.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0839cdd683bdd86eec467e05356a46a91e9237a6054d23bfc651202c041bc47"}},{"ruleId":"D2","level":"warning","message":{"text":"Blob::logical_bytes_approx_v1 (cognitive 44): Blob::logical_bytes_approx_v1 has cognitive complexity 44 (threshold 15). Drivers by points: match/switch 8 (18 pts), loops 5 (14 pts), if/else 5 (9 pts), boolean chains 3 (nesting depth added 23). Of this number, 38 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. 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":"baml_language/crates/btel_snapshot/src/logical_bytes.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6caa70dd0302c8f1fd2741e98af5bd0934c3d0edaa9a9976ca6dfe6838e906c"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_ast::parser::parse::parse (cognitive 44): internal_baml_ast::parser::parse::parse has cognitive complexity 44 (threshold 15). Drivers by points: match/switch 9 (29 pts), if/else 4 (13 pts), loops 1 (2 pts) (nesting depth added 30). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/parser/parse.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c083531b90093edf8b6bdcfe4aa809fc7665fbc4b7698c3fc2cd699b6076133f"}},{"ruleId":"D2","level":"warning","message":{"text":"verify.verifyGeneratedRelease (cognitive 44): verify.verifyGeneratedRelease has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (21 pts), ternaries 5 (11 pts), loops 4 (7 pts), boolean chains 5 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/generated-content/verify.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"742870c2781e5f68d60fd260c49681109134243f8d0c9da3dcfa5c4433821fbf"}},{"ruleId":"D2","level":"warning","message":{"text":"CapturedValueCard.CapturedValueCard (cognitive 44): CapturedValueCard.CapturedValueCard has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 22 (42 pts), boolean chains 2 (nesting depth added 20). Of this number, 37 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. 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":"typescript2/pkg-playground/src/CapturedValueCard.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"e764f47066289adc0aa075234815ac695c8eeda225389be4c3fee6dd4ed8849b"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_match (cognitive 43): InferenceContext::infer_match has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (29 pts), loops 7 (12 pts), boolean chains 1, match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b359ecb19d51191b380f856c552d1bfd79d463a7b55c54bc69ef1e2d57c0a149"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_callee (cognitive 43): InferenceContext::infer_callee has cognitive complexity 43 (threshold 15). Drivers by points: if/else 19 (34 pts), boolean chains 8, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":6684}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a01b13b1e3132521bcce331d84ed8190cdc207eb54444dffd551816d531339"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::describe::describe_locals (cognitive 43): baml_ide::describe::describe_locals has cognitive complexity 43 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 5 (13 pts), match/switch 1 (5 pts), boolean chains 3 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/describe.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64a95a0ca72d8d5b6cbdf1f49c58b4e6a89f43f6a848c43cf3239b310db3ffd"}},{"ruleId":"D2","level":"warning","message":{"text":"TraceSnapshotBuilder::copy_object (cognitive 43): TraceSnapshotBuilder::copy_object has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 5 (14 pts), loops 4 (11 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/trace_heap.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e95303016490d03c294048e32c0c9ff0f1f88d55975e7af2f82295fa2fa2ea"}},{"ruleId":"D2","level":"warning","message":{"text":"BexVm::exec_compact (cognitive 43): BexVm::exec_compact has cognitive complexity 43 (threshold 15). Drivers by points: if/else 8 (24 pts), match/switch 4 (14 pts), loops 3 (5 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":9242}}}],"partialFingerprints":{"codehealthFindingId/v1":"81bd26a31ed6a25ae0b544589fd397eae518e7ec18d8312459ceff021332fd5f"}},{"ruleId":"D2","level":"warning","message":{"text":"GoNames::for_pool (cognitive 43): GoNames::for_pool has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (28 pts), loops 4 (8 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/sdkgen_go/src/names.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"4320bb154dfd090acaeb523b8c8725703b7eba0dfe5d08910ad4414ef9161752"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_log::logger::log_event_internal (cognitive 43): baml_log::logger::log_event_internal has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (31 pts), match/switch 3 (8 pts), loops 1 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-log/src/logger.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"2823456e475cb606e9bbaadd9f9bede9839570cc044ebff75d93c3d306b3879d"}},{"ruleId":"D2","level":"warning","message":{"text":"generators_rust::ir_to_rust::stream_type_to_rust (cognitive 43): generators_rust::ir_to_rust::stream_type_to_rust has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (29 pts), match/switch 7 (14 pts) (nesting depth added 21). 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":"engine/generators/languages/rust/src/ir_to_rust/mod.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfde62c0d4f88c583838aeaa64fd073bf6a970d6a2475375ca066fd5434b6ca"}},{"ruleId":"D2","level":"warning","message":{"text":"RubyToJson::serialize_baml (cognitive 43): RubyToJson::serialize_baml has cognitive complexity 43 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 5 (15 pts), loops 3 (9 pts), boolean chains 3 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_ruby/ext/ruby_ffi/src/ruby_to_json.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b396b5b6a5e3eb28b6517edd3998865f3b2e6455df617fa4c0418709f45489a"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_go.appendOutboundHandles (cognitive 43): baml_go.appendOutboundHandles has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (30 pts), loops 3 (9 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/media.go"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e174c73c248a87bdfee03b28e06013aff6395b1ae02a24454db076b73c59979a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.testKitchenSink (cognitive 43): index.testKitchenSink has cognitive complexity 43 (threshold 15). Drivers by points: if/else 29, boolean chains 14. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/mixed_complex_types/typescript/index.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8c49cf7d99960a1a747687d85f3fa3007ec506cac08b47d3669c75b981fc58"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::resolve_value_path (cognitive 42): InferenceContext::resolve_value_path has cognitive complexity 42 (threshold 15). Drivers by points: if/else 22 (30 pts), boolean chains 10, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":7459}}}],"partialFingerprints":{"codehealthFindingId/v1":"8249797c02856609daf33db300823f2ccc03297f230e929efb283364d6961e48"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::lower::interface_lowering_diagnostics (cognitive 42): baml_compiler2_hir_ty::lower::interface_lowering_diagnostics has cognitive complexity 42 (threshold 15). Drivers by points: loops 15 (20 pts), if/else 9 (18 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 16). 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":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":2901}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e278230b7ff60be919a3a33b3b2e298b34a6122cacfd0d73644ec5cd29f1386"}},{"ruleId":"D2","level":"warning","message":{"text":"Walk::word (cognitive 42): Walk::word has cognitive complexity 42 (threshold 15). Drivers by points: if/else 31 (35 pts), boolean chains 7 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/tokens.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d0cdb6b222eb145246db948c062e904385793f35c7a09b781358ad6601500c"}},{"ruleId":"D2","level":"warning","message":{"text":"IngressScheduler::admit_message_with_policy (cognitive 42): IngressScheduler::admit_message_with_policy has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (29 pts), match/switch 5 (9 pts), boolean chains 4 (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":"baml_language/crates/baml_lsp_server/src/lsp_ingress.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8656e4b3e966d1bae76898609d72eec399304c86232dd703c40636927cb0166"}},{"ruleId":"D2","level":"warning","message":{"text":"BexVm::bigint_binop (cognitive 42): BexVm::bigint_binop has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (29 pts), match/switch 7 (13 pts) (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":5768}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f19bd8fbb9fd4c1a6761587d66abb69f5b840bb7e85a8ec7b487489f343db55"}},{"ruleId":"D2","level":"warning","message":{"text":"serde.convertFieldTypeToGoType (cognitive 42): serde.convertFieldTypeToGoType has cognitive complexity 42 (threshold 15). Drivers by points: if/else 29 (40 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/baml_go/serde/decode.go"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"2044f491749f4a85fb1188e645a67900ab9ebefaa0b1686f6548b734f84ad490"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::completion::context::classify (cognitive 41): baml_ide::completion::context::classify has cognitive complexity 41 (threshold 15). Drivers by points: if/else 26 (35 pts), boolean chains 5, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/completion/context.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"c417d85aaabc7b1e05aa7f3d1f7f4d05d09fb26f204357e70ed73a9f9b20d583"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_cffi_macros::is_convertible_to_rawptr (cognitive 41): baml_cffi_macros::is_convertible_to_rawptr has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (40 pts), boolean chains 1 (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"141ff2f46a24e5fefd6783f34dc092cdb1cf05683adeb2ba7a392116ff74e994"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.cmd_run (cognitive 41): runner.cmd_run has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (26 pts), boolean chains 8, loops 5 (6 pts), ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/src/speedtest/runner.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"badfccf20c5573d441a919f76eb6bfad57424a14f19be7fcc7cfb479d1daefbc"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder.build_target (cognitive 41): Builder.build_target has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (26 pts), error handling 3 (5 pts), ternaries 3 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_cffi/build.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"062bd09c38a99250fc9d7a1c8e26de442d5e3b95122d2dbdc1dd6bed49e4df79"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_go.findOrDownloadLibrary (cognitive 41): baml_go.findOrDownloadLibrary has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (31 pts), loops 3 (8 pts), match/switch 1 (2 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":"engine/language_client_go/baml_go/lib_common.go"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc96a6fde3772485c4b89581b5882e5e85b9876db4d240dea7e7348dfe20857c"}},{"ruleId":"D2","level":"warning","message":{"text":"MetadataBadges.extractMetadata (cognitive 41): MetadataBadges.extractMetadata has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (27 pts), boolean chains 10, error handling 1 (3 pts), 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":"typescript2/pkg-playground/src/components/MetadataBadges.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17b4917e725df3d3e455d3486744ad784f0364ae420cc9f32cfac924b79337f"}},{"ruleId":"D2","level":"warning","message":{"text":"walkNodeModuleFile::visitModuleBody (cognitive 41): walkNodeModuleFile::visitModuleBody has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 5 (16 pts), boolean chains 3, other 1 (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":"tools/stdlib-matrix/extractors/ts-surface.mjs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cff911b3b8f6db744c44caadb204f6b6c2253c7c9acb5b7521ce49f854376b"}},{"ruleId":"D2","level":"warning","message":{"text":"Hir2Diagnostic::to_diagnostic (cognitive 40): Hir2Diagnostic::to_diagnostic has cognitive complexity 40 (threshold 15). Drivers by points: loops 8 (18 pts), if/else 9 (15 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir/src/diagnostic.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f86f0fec2ef72579f9791501992ca1daff3a5f8aba0d8e3780b2c2a9a5721a9"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::attempt (cognitive 40): InferenceContext::attempt has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 5 (11 pts), boolean chains 4, loops 1 (4 pts) (nesting depth added 20). 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":"baml_language/crates/baml_compiler2_hir_ty/src/infer/obligations.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bfba50c74e872b781a7c24288551636e930f4956f7bd8bd1cf3aa2ad9db9c5"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_mir::optimize::propagate_copies (cognitive 40): baml_compiler2_mir::optimize::propagate_copies has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 7 (10 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 21). 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":"baml_language/crates/baml_compiler2_mir/src/optimize.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d900c59f89ab426e42d8fdeab176dbd43b302dce2617a8a2a3deeefba35d490"}},{"ruleId":"D2","level":"warning","message":{"text":"TriviaInfo::from_scan (cognitive 40): TriviaInfo::from_scan has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 5 (8 pts), match/switch 3 (8 pts), boolean chains 1 (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":"baml_language/crates/baml_fmt/src/trivia_classifier.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e784f0d013de0072bd34b26c5a3b49d6ed274fe1f6e897c2f9c3a840e25a541a"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::cfg::expand_user_function_calls_in_graph (cognitive 40): baml_ide::cfg::expand_user_function_calls_in_graph has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (37 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/cfg.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb01491d9dcff14c99aab5f7b4b2219f0f7e4fed34791dd9f4fd3f7bae84c30"}},{"ruleId":"D2","level":"warning","message":{"text":"BexEngine::shutdown_with_deadline (cognitive 40): BexEngine::shutdown_with_deadline has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 4 (6 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":2843}}}],"partialFingerprints":{"codehealthFindingId/v1":"800fbcc3a7a135ed2b4b1cc885b83c4a17b1e9f0c27fbd331b6cb696fdf97e4c"}},{"ruleId":"D2","level":"warning","message":{"text":"BexEngine::call_callable_with_outcome_impl (cognitive 40): BexEngine::call_callable_with_outcome_impl has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 11 (18 pts), loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":4141}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f6246b5ddcabc5efddae36d42bd7f3596751e9ec2a380bc1a3c27d3f309aee"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_rust::to_source_code_with_optional_metadata (cognitive 40): sdkgen_rust::to_source_code_with_optional_metadata has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 5 (13 pts), loops 7 (8 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/rust/sdkgen_rust/src/lib.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7688b6d24f9d380605f2c065444a25b5489d92c9fc4542b7aa51605b02da99"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_jinja_types::evaluate_type::stmt::narrow_attr_access_on_union_var (cognitive 40): internal_baml_jinja_types::evaluate_type::stmt::narrow_attr_access_on_union_var has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (28 pts), match/switch 5 (11 pts), loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jinja/src/evaluate_type/stmt.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1392f2282edd8e1983ecb2a4c0683d4ecba5c3d2b8c25879387d45c03956b7"}},{"ruleId":"D2","level":"warning","message":{"text":"generators_go::ir_to_go::stream_type_to_go (cognitive 40): generators_go::ir_to_go::stream_type_to_go has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (26 pts), match/switch 7 (14 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":"engine/generators/languages/go/src/ir_to_go/mod.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"13416f7f411a86fc61130a59f4fae899cdac7fd83163844d947aaabb56280e89"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_go.releaseOutboundOpaqueHostValues (cognitive 40): baml_go.releaseOutboundOpaqueHostValues has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (27 pts), loops 4 (10 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/media.go"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d1914bd3dde903d76cec7069b16b26ab2c3ee6ab8f15675648d278f3773948"}},{"ruleId":"D2","level":"warning","message":{"text":"HostCallables.swift.restate (cognitive 40): HostCallables.swift.restate has cognitive complexity 40 (threshold 15). Drivers by points: loops 6 (17 pts), if/else 5 (10 pts), error handling 3 (6 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 21). 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":"baml_language/sdks/swift/Sources/BamlBridge/HostCallables.swift"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"70557b50c71d87af20082ff5ed1c0adac4900dae4c8332bc896ec2bc0f67b84e"}},{"ruleId":"D2","level":"warning","message":{"text":"DebugPanel.buildNodesByFile (cognitive 40): DebugPanel.buildNodesByFile has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 6 (11 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 17). Of this number, 31 points are the body\u0027s own statements and 9 belong to 2 function items inside it that branch. 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":"typescript/packages/playground-common/src/features/debug-panel/components/DebugPanel.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"7044972333a408a2fd3ff61c3a20be6247f32a732eca08c9e112832aebf176f4"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_stmt (cognitive 39): InferenceContext::infer_stmt has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 4 (8 pts), match/switch 3 (6 pts), boolean chains 4 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":3458}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd006b738b900dbd2d603178f2e7d0dce166c193c62fc904d89b1d89326c73e"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::structural (cognitive 39): Renderer::structural has cognitive complexity 39 (threshold 15). Drivers by points: loops 8 (20 pts), match/switch 5 (10 pts), if/else 3 (8 pts), boolean chains 1 (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/normalize/mu.rs"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1213f10d588ee52d42f562808bb3ff2a5c978af472081e29fa9a53013b3c1de"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_csharp::semantic::require_supported_type_inner (cognitive 39): sdkgen_csharp::semantic::require_supported_type_inner has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 5 (10 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":1885}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b9412e56c183afcc3ba8ab27e11ebb3fd52737fcabcb38817165180730743f"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_swift::emit::render_callable (cognitive 39): sdkgen_swift::emit::render_callable has cognitive complexity 39 (threshold 15). Drivers by points: if/else 22 (27 pts), loops 5 (6 pts), match/switch 5, boolean chains 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/rust/sdkgen_swift/src/emit.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c406ce4f38e0d138bdedf4933c37b58c2a0025702f6bd8354a3677c9cb7cd4"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_core::validate_type_builder_entries (cognitive 39): internal_baml_core::validate_type_builder_entries has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (29 pts), match/switch 3 (9 pts), loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/lib.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b66b86019d1bc4d2ef0878c15cb1ac0b6e72a47fa563b01d8c25518db526856"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_jinja_types::evaluate_type::stmt::track_walk (cognitive 39): internal_baml_jinja_types::evaluate_type::stmt::track_walk has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (24 pts), match/switch 7 (15 pts) (nesting depth added 24). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jinja/src/evaluate_type/stmt.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb71263e20e627cdae118980ecac176e81c46336f1fa0e0b60a58b230fa3de6"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlUnion4._bamlDecode (cognitive 39): BamlUnion4._bamlDecode has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (31 pts), boolean chains 8 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (BamlUnion4._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"2064475ff459793b60817b9f698b1780129d83d4b31e60e1a68dcd561c40b7b9"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlUnion4._bamlDecode (cognitive 39): BamlUnion4._bamlDecode has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (31 pts), boolean chains 8 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (BamlUnion4._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"2973bf72ff6163fb7938d1131c82ffab816c4abcc3d5ebcdbe8d14b12edc839b"}},{"ruleId":"D2","level":"warning","message":{"text":"Encode.swift.encodeCallArgs (cognitive 39): Encode.swift.encodeCallArgs has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (30 pts), error handling 2 (4 pts), loops 2 (4 pts), boolean chains 1 (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":"baml_language/sdks/swift/Sources/BamlBridge/Encode.swift"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2463651ccae61d99f914d0b830a2cfd5f8dc02f0ad5c225197471e7abe6d558"}},{"ruleId":"D2","level":"warning","message":{"text":"StackifyCodegen::emit_terminator (cognitive 38): StackifyCodegen::emit_terminator has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (26 pts), match/switch 5 (11 pts), boolean chains 1 (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/emit.rs"},"region":{"startLine":2393}}}],"partialFingerprints":{"codehealthFindingId/v1":"616185e2ef59ad1b021f1fd67ea4f54cc7f62aa79a4810bd108da64adcdc357d"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::interfaces::impl_rules::first_failing_impl_bound (cognitive 38): baml_compiler2_hir_ty::interfaces::impl_rules::first_failing_impl_bound has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (27 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs"},"region":{"startLine":2081}}}],"partialFingerprints":{"codehealthFindingId/v1":"45192899972b2376e8960b2b2dc2aac274eaaa9379ee28cfc9e6a3d35962e9a4"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::info::generic_type_parameter_info_at (cognitive 38): baml_ide::info::generic_type_parameter_info_at has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (25 pts), match/switch 2 (7 pts), loops 5 (6 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":"baml_language/crates/baml_ide/src/info.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"555fdeda6b9eda49d8c64af40984d491e94c024f29230b7c4cdafc48edb53886"}},{"ruleId":"D2","level":"warning","message":{"text":"WasmHost::call_registered_callable_with_context (cognitive 38): WasmHost::call_registered_callable_with_context has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (28 pts), match/switch 5 (9 pts), boolean chains 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":"baml_language/crates/sys_wasm/src/host_value.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff60568bc945cf2f69e7514bb33bd744ce2c76eedd8aef716ec131f3a3949a9"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_stow::check_workspace_dependencies (cognitive 38): cargo_stow::check_workspace_dependencies has cognitive complexity 38 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 5 (16 pts) (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d86c061ffd993c852e6ac9766f591f6f5fc7858685dd609a18653c67aebefc4"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_go::render_types (cognitive 38): sdkgen_go::render_types has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 8 (14 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":5136}}}],"partialFingerprints":{"codehealthFindingId/v1":"43cccfd7c7265b43dc820ab3e648a8ef5f7439b774c9868c9e61551661b5289f"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionMetadata::analyze_statement (cognitive 38): FunctionMetadata::analyze_statement has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (25 pts), match/switch 3 (7 pts), loops 3 (6 pts) (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/watch.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"f814bbbbff4fedb3b10946a95dd3f705f2deeabd028c46e38ec281d34e6c1eff"}},{"ruleId":"D2","level":"warning","message":{"text":"generators_python::watchers::build_notification_collectors (cognitive 38): generators_python::watchers::build_notification_collectors has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 4 (5 pts), match/switch 1 (3 pts), boolean chains 1 (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":"engine/generators/languages/python/src/watchers.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f2696bd38fdcd3be83bb48b28eebd34d8cd2e22924a26af17a2479d868bb80"}},{"ruleId":"D2","level":"warning","message":{"text":"language_server::server::api::diagnostics::project_diagnostics (cognitive 38): language_server::server::api::diagnostics::project_diagnostics has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 6 (11 pts), loops 4 (7 pts) (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":"engine/language_server/src/server/api/diagnostics.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e185d4dc100c405bc97c46c94fe9f4ae59b361ea9251cc6b8e7df716cc1ce6"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetry_resources.monitor (cognitive 38): telemetry_resources.monitor has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 4 (7 pts), error handling 1 (4 pts), ternaries 1 (3 pts), boolean chains 2 (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":"baml_language/scripts/telemetry_resources.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d352eddfff33a1ff9f17e249de33c2be7f2c23e4c4adbeb1cefd2009358ee5"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder.build_all (cognitive 38): Builder.build_all has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (23 pts), ternaries 2 (4 pts), error handling 1 (3 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_cffi/build.py"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"334a403f179bb2571a66b4cedd5a151ac075d59eb022afaf27ac3dd4915ed1bc"}},{"ruleId":"D2","level":"warning","message":{"text":"BAMLSDK.parseWatchValue (cognitive 38): BAMLSDK.parseWatchValue has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 8 (24 pts), if/else 4 (8 pts), boolean chains 3, match/switch 1 (2 pts), error handling 1 (nesting depth added 21). 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":"typescript/packages/playground-common/src/sdk/sdk.ts"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f796cbb5d94ac52faca4020fbffc3378436b1859ba2ae1159ebc6733107603"}},{"ruleId":"D2","level":"warning","message":{"text":"function-item.FunctionItem (cognitive 38): function-item.FunctionItem has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 9 (16 pts), if/else 10 (15 pts), boolean chains 6, loops 1 (nesting depth added 12). Most of this is not in the body itself: 14 of the 38 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 36, handleClick). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/function-item.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4adb8364c234bdc1c79d2fabcab9253437fd623d41abbd35d600c8f90365f68"}},{"ruleId":"D2","level":"warning","message":{"text":"App.App (cognitive 38): App.App has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15, boolean chains 13, ternaries 7 (10 pts) (nesting depth added 3). Most of this is not in the body itself: 12 of the 38 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 85, 140, 178, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-vscode-webview/src/App.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"794ec23f6917d8abd8ff7aa456e0672ff2e0c4aad1a6ca0489582aac1fc0bbee"}},{"ruleId":"D2","level":"warning","message":{"text":"args-form-model.reconcileValue (cognitive 38): args-form-model.reconcileValue has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (26 pts), ternaries 4 (8 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 21). Of this number, 36 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"typescript2/pkg-playground/src/args-form-model.ts"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0cbce7ab6cc32f8265e5ea60ef6de420923a66a83c7d184bb457256770c335"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::lower_interface_pattern (cognitive 37): InferenceContext::lower_interface_pattern has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 5 (8 pts), boolean chains 7, loops 4 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3f50c545749ad622a6d55be0d59fb7dc854afe610927be86a619b18abc5e54"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_multi_segment_path_as_field_chain (cognitive 37): LoweringContext::lower_multi_segment_path_as_field_chain has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (30 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":6810}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ceb7172ea4e9324b2c2b2649984aecccba9c5d090bbd595fed3e0b319d5334"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_mir::memory::spawn_shared_cells (cognitive 37): baml_compiler2_mir::memory::spawn_shared_cells has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 7 (12 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/memory.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"127b9b94103b4f67739b76e8f82ee1fa39ae77267f5398989bf0137134c286ae"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler_diagnostics::render::apply_message_styles (cognitive 37): baml_compiler_diagnostics::render::apply_message_styles has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (32 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler_diagnostics/src/render.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"564951407dd1fde9e3d4d714099b9941420cd6ea4895ad0e444b69b3277f3942"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::tokens::index::index_function (cognitive 37): baml_ide::tokens::index::index_function has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (24 pts), match/switch 3 (8 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/tokens/index.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d5d6eae2d0b21f38eb9a766340dbfed9241aa6bb14365f86419d9bdda1328b"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_parser::expr::primary (cognitive 37): baml_parser::expr::primary has cognitive complexity 37 (threshold 15). Drivers by points: if/else 24 (29 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_parser/src/expr.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"b273b6b8e08956edd9bc56fd199a787733d20f50cacefeb61ea28735d1ec0f50"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_baml::sap::empty_value (cognitive 37): bex_vm::package_baml::sap::empty_value has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (26 pts), match/switch 3 (6 pts), loops 2 (5 pts) (nesting depth added 20). 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":"baml_language/crates/bex_vm/src/package_baml/sap.rs"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9d6209686432f9e8d53928ffb968dee697f3e846f0b368208bf57956fad821"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_rust::emit::function::emit_binding (cognitive 37): sdkgen_rust::emit::function::emit_binding has cognitive complexity 37 (threshold 15). Drivers by points: if/else 24 (30 pts), loops 3, match/switch 3, boolean chains 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/rust/sdkgen_rust/src/emit/function.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d5d239b6a0b516a7d7d9294de1f263db451ca10c3cd7dce91a256b57ddfa00"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphBuilder::build_header (cognitive 37): GraphBuilder::build_header has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 6 (14 pts), match/switch 1 (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/baml_vis/graph.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"626aaadd7a7d60d801b0ba5f1da66492581ace59c2c6d6ad425e0036acc77726"}},{"ruleId":"D2","level":"warning","message":{"text":"TestResponse::status (cognitive 37): TestResponse::status has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 3 (11 pts), boolean chains 2 (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":"engine/baml-runtime/src/types/response.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"e383903850f2d26bbd4aaf0911b6c5f4144945b45164c0bc8a864b94a2d1198d"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_go.decodeJSON (cognitive 37): baml_go.decodeJSON has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 2 (4 pts), boolean chains 1, match/switch 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":"baml_language/sdks/go/baml_go/json.go"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"2690f27cc9407bb1325ac7f4ccd97a142fa6b4b1cdb617d550a39760e638ebd8"}},{"ruleId":"D2","level":"warning","message":{"text":"signup.submitSignup (cognitive 37): signup.submitSignup has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (19 pts), boolean chains 10, ternaries 7, error handling 1 (nesting depth added 1). Of this number, 33 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/actions/signup.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7826c31422763699ebc0737196a741584bd83e8e445cc8d67a771b3f2b1a55"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlGeneratedCodecContext.ReadUnionCore (cognitive 36): BamlGeneratedCodecContext.ReadUnionCore has cognitive complexity 36 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedCodec.cs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb28617ba24e1d1c023d1283ea87402548324c2a1718fb5b2a15813aabd7224"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticIndexBuilder::collect_pattern_names (cognitive 36): SemanticIndexBuilder::collect_pattern_names has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 6 (15 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 20). 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":"baml_language/crates/baml_compiler2_hir/src/builder.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"26582d387d97d1cca9ae8a94f7f34afe23d3d57c15dd8b93abf3d7ff3d00e00d"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_visualization::control_flow::flatten::compute_required_nodes (cognitive 36): baml_compiler2_visualization::control_flow::flatten::compute_required_nodes has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 7 (8 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"484e6fdc05640d75529142d6a6d341b38daef3187c3511f277bf9395099902e3"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_db::check::validate_ambiguous_typevar_associated_projection_in_type_expr (cognitive 36): baml_db::check::validate_ambiguous_typevar_associated_projection_in_type_expr has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 4 (8 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 21). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_db/src/check.rs"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"0521a392c4144b7f2d0e65d9e5962c7c7b0bd41f66b6a68306834d125c086cbd"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_sap::jsonish::parser::multi_json_parser::parse (cognitive 36): bex_sap::jsonish::parser::multi_json_parser::parse has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (27 pts), match/switch 4 (8 pts), loops 1 (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":"baml_language/crates/bex_sap/src/jsonish/parser/multi_json_parser.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"77935cb6417eceabd110d1a09a61d63b748bd0dff4206404843711f1fbc01dc0"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeCompileArtifactSlot::measure (cognitive 36): RuntimeCompileArtifactSlot::measure has cognitive complexity 36 (threshold 15). Drivers by points: loops 10 (26 pts), if/else 4 (9 pts), boolean chains 1 (nesting depth added 21). 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":"baml_language/crates/bex_vm/src/compile_artifact.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"406d22841662fb61f06f82673c85f18166592e51ed56e5f12afe9b7cdd5785bc"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderDefinitionValidator::visit (cognitive 36): RenderDefinitionValidator::visit has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 21). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/type_class.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9c968c016467e9d6b57a25eaec2302d9292c42904e6945ea41478323bb2d39"}},{"ruleId":"D2","level":"warning","message":{"text":"TelemetryState::enter_bytecode_with_trace (cognitive 36): TelemetryState::enter_bytecode_with_trace has cognitive complexity 36 (threshold 15). Drivers by points: if/else 20 (23 pts), boolean chains 13 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/telemetry.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3fdcda869d9cc388e9c118b418549129437d441c1f5b9968d466db25e992fe"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_reflect::runtime_class_builder::prepare_group (cognitive 36): bex_vm::package_reflect::runtime_class_builder::prepare_group has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 3 (11 pts), loops 2 (3 pts), boolean chains 1 (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":"baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"276718b710149291c2435f7bc4a3d99d556ec612eaa0b46a8356ae68a2c91bd4"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_reflect::type_class::expanded_type_value_nominals (cognitive 36): bex_vm::package_reflect::type_class::expanded_type_value_nominals has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 7 (14 pts), match/switch 1 (nesting depth added 21). 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":"baml_language/crates/bex_vm/src/package_reflect/type_class.rs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"2364f09c1793cc458453c35a2c1adbe7a157a1857f4b9be27345781f49e80e27"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_swift::to_source_code_with_optional_metadata (cognitive 36): sdkgen_swift::to_source_code_with_optional_metadata has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 6 (7 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/rust/sdkgen_swift/src/lib.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"06825823309a6e52ca4b3d51a26ff36afa7d2706557efd0ce947a7efad9d8cbb"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_ast::parser::parse_expr::parse_expr_block (cognitive 36): internal_baml_ast::parser::parse_expr::parse_expr_block has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 4 (8 pts), loops 5 (7 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/parser/parse_expr.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c159fae2ea3d5713ccb1f3c116d8eeb8ffa8981665ff8f65630e700592f986"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_jinja_types::evaluate_type::stmt::predicate_implications (cognitive 36): internal_baml_jinja_types::evaluate_type::stmt::predicate_implications has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 5 (11 pts), loops 2 (8 pts) (nesting depth added 21). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jinja/src/evaluate_type/stmt.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48921b4fd96ad48ad3829bcc3479fdc655159f90b3181ebe259e0a88801d162"}},{"ruleId":"D2","level":"warning","message":{"text":"jsonish::jsonish::parser::multi_json_parser::parse (cognitive 36): jsonish::jsonish::parser::multi_json_parser::parse has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (25 pts), match/switch 5 (10 pts), loops 1 (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":"engine/baml-lib/jsonish/src/jsonish/parser/multi_json_parser.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"49585f9e97ea3bf05cacb91688d6979813818ef9f6303b07b11b23c6beccb689"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_runtime::cli::dotenv::expand_value (cognitive 36): baml_runtime::cli::dotenv::expand_value has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (9 pts), match/switch 2 (5 pts), boolean chains 3 (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":"engine/baml-runtime/src/cli/dotenv/mod.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33cae28f3f43d4ba114acab86e090bcdfe0d5804ebec78663343187eac7266a"}},{"ruleId":"D2","level":"warning","message":{"text":"generators_typescript::watchers::build_event_collectors (cognitive 36): generators_typescript::watchers::build_event_collectors has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 4 (5 pts), match/switch 1 (3 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":"engine/generators/languages/typescript/src/watchers.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5578068bf1af23359ecfd15dd1e54130c257273b390ee459abbbd5a0123b6cb"}},{"ruleId":"D2","level":"warning","message":{"text":"summarize.main (cognitive 36): summarize.main has cognitive complexity 36 (threshold 15). Drivers by points: loops 11 (20 pts), if/else 5 (12 pts), ternaries 2 (4 pts) (nesting depth added 18). 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":"baml_language/tools/gc_policy/summarize.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a4f71eb9648ebbbca0ef788f822c6a208c03795c28d79364f1538bbfee8cd7"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_go.encodeJSON (cognitive 36): baml_go.encodeJSON has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (30 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/json.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d4f631b17e5d3342fc67fa60ca6c16b9dcc61eac70130061d9e82e340cebd7"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeCli::run (cognitive 35): RuntimeCli::run has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 17 (28 pts), if/else 4 (5 pts), loops 1 (2 pts) (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/cli/src/commands.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee1a25ae475fc5d073322e86e6de46cbec53f412bceebd2c81857a73c24f543"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_emit::analysis::classify_locals (cognitive 35): baml_compiler2_emit::analysis::classify_locals has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 9, loops 1, 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":"baml_language/crates/baml_compiler2_emit/src/analysis.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4126aab0e769b683ca263712b4d1ccce54147ab961c60b0289a15f01d56569c"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_emit::pull_semantics::walk_rvalue_pull (cognitive 35): baml_compiler2_emit::pull_semantics::walk_rvalue_pull has cognitive complexity 35 (threshold 15). Drivers by points: loops 12 (29 pts), if/else 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 20). 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":"baml_language/crates/baml_compiler2_emit/src/pull_semantics.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b272b5c1dc54ac45eb123100c06c1381f587cf93eb42f97d40aaadcb2ba3dd1"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::lower_class_pattern (cognitive 35): InferenceContext::lower_class_pattern has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (12 pts), match/switch 6 (12 pts), boolean chains 6, loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a0dcf3bbab5f82e62c300a7a40aac33cf0317c2cd2c2465fd64bdfd428cd66"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_mir::escape::coverage (cognitive 35): baml_compiler2_mir::escape::coverage has cognitive complexity 35 (threshold 15). Drivers by points: loops 7 (16 pts), if/else 3 (9 pts), match/switch 4 (9 pts), boolean chains 1 (nesting depth added 20). 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":"baml_language/crates/baml_compiler2_mir/src/escape.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8900d15a8038ff69e310bc4db504b2fb4d2f05d9ffe8fdbcfcc442318c03e3"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_rust::admit::recursive_functions (cognitive 35): baml_compiler2_rust::admit::recursive_functions has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 7 (12 pts), boolean chains 2 (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":"baml_language/crates/baml_compiler2_rust/src/admit.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d24d1e93824af18cc00a37d0e3a79de395c8fb07733cf5356282090ff10919f"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_parser::items::unattributed_item (cognitive 35): baml_parser::items::unattributed_item has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17, boolean chains 9, match/switch 3 (7 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":2356}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb77a34741b77a22694cf83cf86f1b0558732261c276cbccb9dd104e483bf94"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_reflect::graft::relocate (cognitive 35): bex_vm::package_reflect::graft::relocate has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 7 (13 pts), loops 4 (8 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/graft.rs"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"4061e6b96517ac956e31f4ce478cc336b1dcf8e1f4c118cdddfbbcfef13ab05a"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeSysOps::_send_sse (cognitive 35): NativeSysOps::_send_sse has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 4 (8 pts), loops 3 (4 pts) (nesting depth added 16). Of this number, 32 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. 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":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":3428}}}],"partialFingerprints":{"codehealthFindingId/v1":"5935fed0ac27b7056ea2c0ad941b8ee680eadd711196a45aabe152a6506c8011"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_cpp::emit_callable (cognitive 35): sdkgen_cpp::emit_callable has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 8 (18 pts), if/else 11 (16 pts), loops 1 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f1ce7d31464886d52312a2e2c812068ad9ec5cbdbeeaceff63f150d27d44d9"}},{"ruleId":"D2","level":"warning","message":{"text":"jsonish::deserializer::coercer::match_string::string_match_strategy (cognitive 35): jsonish::deserializer::coercer::match_string::string_match_strategy has cognitive complexity 35 (threshold 15). Drivers by points: loops 10 (19 pts), if/else 10 (15 pts), match/switch 1 (nesting depth added 14). 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":"engine/baml-lib/jsonish/src/deserializer/coercer/match_string.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81f96d9879931f5820406f686f70999e28ed8056e6a7350bc3a2cc4650df955"}},{"ruleId":"D2","level":"warning","message":{"text":"VertexClient::build_request (cognitive 35): VertexClient::build_request has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (22 pts), match/switch 6 (9 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/vertex/vertex_client.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6627d649a6049e4b7328890323e8942857d50490c21f45dcf2bf5c1f8d0d21c"}},{"ruleId":"D2","level":"warning","message":{"text":"WithIr::encode (cognitive 35): WithIr::encode has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (28 pts), match/switch 5 (7 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_cffi/src/ctypes/baml_value_with_meta_encode.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb993552111a26460f201c27887710ae978f9612ceeb082f17f6d326f76849f"}},{"ruleId":"D2","level":"warning","message":{"text":"language_server::baml_project::file_utils::gather_files (cognitive 35): language_server::baml_project::file_utils::gather_files has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (29 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/baml_project/file_utils.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa3c6ad49623e57f8f26266e1b87b29f67496165b42c8db52eb6216394fa84d"}},{"ruleId":"D2","level":"warning","message":{"text":"kpis.build (cognitive 35): kpis.build has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 6 (14 pts), loops 5 (8 pts), boolean chains 7, if/else 4 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/src/speedtest/kpis.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19f56b42968ff6d0b083754c9088d2e74e9e94fbe775310dfd4f7149ba4c6f2"}},{"ruleId":"D2","level":"warning","message":{"text":"index.testLargeStructure (cognitive 35): index.testLargeStructure has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 13, loops 4 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/edge_cases/typescript/index.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8174d9e9442bc8cb041983b1699b3e76b28bcca944d22397174380c4f299e2ba"}},{"ruleId":"D2","level":"warning","message":{"text":"simulator.simulateExecution (cognitive 35): simulator.simulateExecution has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (27 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/runtime/simulator.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf780346b5bd586b2856b0a835bc17a31e708505ba44cca9461cb1f780de326"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionSidebar.TestTreeNode (cognitive 35): FunctionSidebar.TestTreeNode has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 10 (19 pts), boolean chains 12, if/else 3 (4 pts) (nesting depth added 10). Of this number, 30 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. 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":"typescript2/pkg-playground/src/FunctionSidebar.tsx"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3b639804e26b57d8c41dc11391a71e7f790c6e58647bd3543105dde8ec554d"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_binary (cognitive 34): InferenceContext::infer_binary has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (25 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":5251}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c02e59f4a2f92018954db67eca31b1307d9a59fc7ba8b4bb5bcd27f55f6c70a"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_mir::escape::array_walks (cognitive 34): baml_compiler2_mir::escape::array_walks has cognitive complexity 34 (threshold 15). Drivers by points: loops 8 (17 pts), if/else 6 (10 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 17). 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":"baml_language/crates/baml_compiler2_mir/src/escape.rs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea243ab5ce7404a9e9302c75a7519dacdf5142e0157bca8481330b359edb3be6"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_visualization::control_flow::flatten::prepare_control_flow_graph_for_visualization (cognitive 34): baml_compiler2_visualization::control_flow::flatten::prepare_control_flow_graph_for_visualization has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 10 (16 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8950541fdffb0505d97be36e0b59cf7e3ca4d5f93e59e1bc0188efded59839f2"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_parser::types::collect_ambiguous_pipes (cognitive 34): baml_parser::types::collect_ambiguous_pipes has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (7 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 20). 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":"baml_language/crates/baml_parser/src/types.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"3760e5cff15d1ba80e9c1a6e9cb5e9b8da83f3c9070334d36a48017c7c812d71"}},{"ruleId":"D2","level":"warning","message":{"text":"Translator::navigation (cognitive 34): Translator::navigation has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 8 (26 pts), if/else 3 (5 pts), loops 2 (3 pts) (nesting depth added 21). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"baml_language/crates/baml_query_btel/src/sql.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c64256a6fee77d1160ba7ebaf0ccb13f676ee5a6050d6b523dc23c691e18fc"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_type_runtime::collect (cognitive 34): baml_type_runtime::collect has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 6 (12 pts), boolean chains 4, match/switch 1 (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type_runtime/src/lib.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"6618fd1c7f2434f15e45d701cb5b37f4ec306a63ddc104231e3036a22534d6b6"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_engine::host_instrumentation::capture_callback_inputs::copy (cognitive 34): bex_engine::host_instrumentation::capture_callback_inputs::copy has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/host_instrumentation.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"886e580f276455155401d2cb4b7bd2e24ddb206787bdd31ffa0c138db4bd4acf"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_project::runtime_compile::projected_interface (cognitive 34): bex_project::runtime_compile::projected_interface has cognitive complexity 34 (threshold 15). Drivers by points: loops 12 (21 pts), match/switch 4 (8 pts), if/else 3 (4 pts), boolean chains 1 (nesting depth added 14). 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":"baml_language/crates/bex_project/src/runtime_compile.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd80c1eb7b6f90ee2924073c887aefacf377a5fc4922e16e50aa8feb9559d4f"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonParseState::should_close_string (cognitive 34): JsonParseState::should_close_string has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 10 (14 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c45abc195d3552c9faf70e0242654fe444b95e6456124e2ad19935c57c1dbf2"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_baml::csv::decode_record_to_instance (cognitive 34): bex_vm::package_baml::csv::decode_record_to_instance has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (23 pts), match/switch 5 (10 pts), 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":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":1560}}}],"partialFingerprints":{"codehealthFindingId/v1":"277d10301df6670d34bbf0c02d91852b9866d5fb9ab89ae0fc44d53a5d11c15f"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_reflect::type_class::render_type_value_source (cognitive 34): bex_vm::package_reflect::type_class::render_type_value_source has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 5 (7 pts), match/switch 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/type_class.rs"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"25246c62373dd0f9e79be247189d80b55c55c44d8cb96edc47629c1de5cab507"}},{"ruleId":"D2","level":"warning","message":{"text":"btel_bcs::plan::validate_response (cognitive 34): btel_bcs::plan::validate_response has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 5 (7 pts), boolean chains 6 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_bcs/src/plan.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec260f34c0c02ef99fcff1dfa06c7f0eea8e940fc52a0831c888067e6185dd7"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_csharp::semantic::collect_functions (cognitive 34): sdkgen_csharp::semantic::collect_functions has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (30 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":1682}}}],"partialFingerprints":{"codehealthFindingId/v1":"6573387512b8eae8e7576db94058463a6f0dba33f456410a4f47a96233f5650b"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_csharp::semantic::render_functions (cognitive 34): sdkgen_csharp::semantic::render_functions has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":2467}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd075282712cb84a6ac9ad73d74543846ff2d63cf4978cddeca4e55f2673350"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeContext::infer_type (cognitive 34): TypeContext::infer_type has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 7 (16 pts), boolean chains 1 (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/thir/typecheck.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"867852dbebe37f02f6a5d4150150fccaeb60af42fb11b35c7bd90fbedf8a46e0"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler::codegen::compile_thir_to_bytecode (cognitive 34): baml_compiler::codegen::compile_thir_to_bytecode has cognitive complexity 34 (threshold 15). Drivers by points: loops 19 (24 pts), if/else 2 (5 pts), match/switch 2 (5 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/codegen.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0236ed539be244b8a44d6f65fc2062655d7b6002335fb7fda7b258c3410d16"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler::hir::lowering::lower_stmt_with_options (cognitive 34): baml_compiler::hir::lowering::lower_stmt_with_options has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (29 pts), match/switch 3 (5 pts) (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/hir/lowering.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af617d0cc41ddb595b51f5362c2da6f25c1169dd0857fc88dbbfd589433a064"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonParseState::should_close_string (cognitive 34): JsonParseState::should_close_string has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 10 (14 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81c67c2aa8b9e40a3f60bf871f09e4b8da7c8d6574b5d740a2bc5fbb9a40c04"}},{"ruleId":"D2","level":"warning","message":{"text":"jsonish::jsonish::parser::markdown_parser::parse (cognitive 34): jsonish::jsonish::parser::markdown_parser::parse has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 2 (4 pts), match/switch 2 (4 pts) (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":"engine/baml-lib/jsonish/src/jsonish/parser/markdown_parser.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc313304b7d0e25b77246b0258d637ac590231dce910b0fb1ba320f94578d73"}},{"ruleId":"D2","level":"warning","message":{"text":"InitUI::render (cognitive 34): InitUI::render has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (26 pts), match/switch 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/cli/init_ui.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"054856fc16cd9a5efcf1831b35380deca9b5811623b358fed473ae388520c10c"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_runtime::cli::init::install_extension_manually (cognitive 34): baml_runtime::cli::init::install_extension_manually has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (22 pts), match/switch 3 (8 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/cli/init.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a3ce8f89a49d87ba61732142021bf0e6f3a550119121296db6bb2c1c5c969e"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_runtime::optimize::tui::display_pareto_and_select (cognitive 34): baml_runtime::optimize::tui::display_pareto_and_select has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 3 (6 pts), match/switch 1 (5 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/tui.rs"},"region":{"startLine":1683}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9676fbfcf618d33869be9407d2e5c90df9b5d8c6cfe9d3febfdb0ec0f2555a6"}},{"ruleId":"D2","level":"warning","message":{"text":"schedule.validate (cognitive 34): schedule.validate has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 4, loops 2 (3 pts), error handling 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bctl_src/oncall/schedule.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"85acb8d92864b0cfdf6f498c87babc235f37787fe1bec78eca94cac3505c80b2"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_go.prepareInvocation (cognitive 34): baml_go.prepareInvocation has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (29 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/invocation.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3c2ccb327d767142a0a868c6847cb9bfa4e211b9d54d1226db6ef4d554081a"}},{"ruleId":"D2","level":"warning","message":{"text":"SmartEdge.splitPoints (cognitive 34): SmartEdge.splitPoints has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (24 pts), ternaries 5 (7 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/smart-edge.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"449255e824cb4c9303ed12899cb60d0dccbdc476de0d96e7dd2048f7b271bbb1"}},{"ruleId":"D2","level":"warning","message":{"text":"route.POST (cognitive 34): route.POST has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 6, ternaries 2 (4 pts), error handling 3, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/beps/route.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f595bff5c2dfacde9d4d877973a0f6b9baba004e72801a8aa679ec419eacfe"}},{"ruleId":"D2","level":"warning","message":{"text":"route.PUT (cognitive 34): route.PUT has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 5, ternaries 2 (4 pts), error handling 3, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/beps/route.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"731361f56340f0973a5009955dee460fafb98ab2cfb3c8d7144387b4406d1aec"}},{"ruleId":"D2","level":"warning","message":{"text":"search-menu.SearchMenu (cognitive 34): search-menu.SearchMenu has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (15 pts), ternaries 6 (14 pts), boolean chains 5 (nesting depth added 9). Most of this is not in the body itself: 11 of the 34 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 67, onInputKeyDown, a function literal at line 50, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/components/search-menu.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10ef31f2e48b240703985eb31287a983c477c863c58b223ff2de46cd30448c8"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_lvalue (cognitive 33): LoweringContext::lower_lvalue has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (27 pts), match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":12365}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d857b1b886ccbcdd1485fb4f847a5d394186f1b6554f1a9cc0a607793f84910"}},{"ruleId":"D2","level":"warning","message":{"text":"Translator::projection (cognitive 33): Translator::projection has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 2 (5 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/sql.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce65813525364f183c851040933d7beaaf86726b5eb7f8c5c02384fbd55333d"}},{"ruleId":"D2","level":"warning","message":{"text":"Id::single_line_width (cognitive 33): Id::single_line_width has cognitive complexity 33 (threshold 15). Drivers by points: loops 9 (21 pts), if/else 8 (12 pts) (nesting depth added 16). 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":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":2559}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3eb4d0700a1d40a4a8e85a57888073a4b432cc7fe0a451faa8282369ac565fe"}},{"ruleId":"D2","level":"warning","message":{"text":"BexVm::value_matches_type_constant_with_type_args (cognitive 33): BexVm::value_matches_type_constant_with_type_args has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 5 (13 pts), loops 1 (4 pts) (nesting depth added 21). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":4041}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94ab7b8b554f3f2e2d184a4ad3ad051b8a384fcfd65ae49ca2d4f4e5a6cb690"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::call_specialize::specialize_calls (cognitive 33): bex_vm::call_specialize::specialize_calls has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (21 pts), match/switch 3 (5 pts), loops 3 (4 pts), boolean chains 3 (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":"baml_language/crates/bex_vm/src/call_specialize.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"396b79e17c045587121af6eceb5fff63c4dcd0c6f3b360aeba49f529b05ed913"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_baml::csv::parse_reader_options (cognitive 33): bex_vm::package_baml::csv::parse_reader_options has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20 (23 pts), match/switch 5 (10 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"66540ba77405b944f2a4952876439f6daa8a2fabc99c79b27c4591b903267587"}},{"ruleId":"D2","level":"warning","message":{"text":"GoTypeProjection::project_inner (cognitive 33): GoTypeProjection::project_inner has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 9 (19 pts), if/else 8 (14 pts) (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/sdkgen_go/src/types.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec9040db1e90c28f03a3e15d1f9a640774de09c7882be8c5b4f4f73a568ca44"}},{"ruleId":"D2","level":"warning","message":{"text":"CandidateApplier::update_class_attributes (cognitive 33): CandidateApplier::update_class_attributes has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/applier.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3478707011fdacfe774f67842f62537e232fb2f183be7a448270625c5132b27"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_runtime::tracingv2::storage::storage::build_function_log (cognitive 33): baml_runtime::tracingv2::storage::storage::build_function_log has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 5 (11 pts), loops 5 (9 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/tracingv2/storage/storage.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb99fc8cfc179eb8516d9646100a86065f130184c371bf9ac0bc557587f782d"}},{"ruleId":"D2","level":"warning","message":{"text":"index.testSimpleNested (cognitive 33): index.testSimpleNested has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18, boolean chains 15. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/nested_structures/typescript/index.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d52774e203fa2f1050a48c09691ff661ffdb94b0ebd9f12e7ecdda044561b6"}},{"ruleId":"D2","level":"warning","message":{"text":"package-generator.buildReferencePages (cognitive 33): package-generator.buildReferencePages has cognitive complexity 33 (threshold 15). Drivers by points: loops 11 (15 pts), if/else 6 (14 pts), boolean chains 3, ternaries 1 (nesting depth added 12). Of this number, 29 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. 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":"typescript2/app-developer-docs/lib/generated-content/package-generator.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"92760737f54a1f592f222d9eb79f0c915fee786145efbe54065ad203c7984a23"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_assign (cognitive 32): InferenceContext::infer_assign has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 5 (9 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":4317}}}],"partialFingerprints":{"codehealthFindingId/v1":"34dee1bcaebd19194e0c5590752177e6b7b6cc3f8110ea52895616a60d4a056b"}},{"ruleId":"D2","level":"warning","message":{"text":"LowerCtx::lower_definition (cognitive 32): LowerCtx::lower_definition has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 3 (9 pts), boolean chains 1, match/switch 1 (nesting depth added 20). 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":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d1b7127c1822f72a3d4ce587898fc771ae044f5f760a1e95e2b178bbbc642f"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::infer::reachability::add_diagnostics (cognitive 32): baml_compiler2_hir_ty::infer::reachability::add_diagnostics has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 3, boolean chains 2, match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer/reachability.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd9287f4114e415b2e93e8de9e727987f7552864654ea0e59518748aec00362"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator::rvalue (cognitive 32): Generator::rvalue has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (31 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_rust/src/codegen/expr.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc95b459eaaa10d01f4b4d6d008060ad3fdef6ec5f53838e885e8dd213b8af49"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_visualization::control_flow::from_ast::collect_callee_names_expr (cognitive 32): baml_compiler2_visualization::control_flow::from_ast::collect_callee_names_expr has cognitive complexity 32 (threshold 15). Drivers by points: loops 9 (18 pts), if/else 5 (11 pts), match/switch 2 (3 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"415588bb9bd4988bdf42703927590c0e40a30bdb977558dd1d8a939db6073789"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_type::normalize::mu::epsilon_close (cognitive 32): baml_type::normalize::mu::epsilon_close has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 4 (8 pts), match/switch 1 (4 pts) (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":"baml_language/crates/baml_type/src/normalize/mu.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e1fa38043db7643cf1cc3a68141cad40da42a8e355db188ad358fa387be37f"}},{"ruleId":"D2","level":"warning","message":{"text":"TyResolvedRef::coerce (cognitive 32): TyResolvedRef::coerce has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 6 (13 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_ty.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdaf5838dcc10f4d22ab4f73730e16f9bbace22c072f529cce8f76b976bc4e8b"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_sap::deserializer::coercer::match_string::string_match_strategy (cognitive 32): bex_sap::deserializer::coercer::match_string::string_match_strategy has cognitive complexity 32 (threshold 15). Drivers by points: loops 8 (17 pts), if/else 11 (14 pts), match/switch 1 (nesting depth added 12). 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":"baml_language/crates/bex_sap/src/deserializer/coercer/match_string.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"0255e8e7eb79fc8cb67e7f4f51421c69809d7f4d2c5b85c352d0b9278c53c489"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_sap::jsonish::parser::markdown_parser::parse (cognitive 32): bex_sap::jsonish::parser::markdown_parser::parse has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/markdown_parser.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fb42b0cfc680a8b6c6498c5eeb986ee0d9a87610ec447bca12e9bb80976c4a"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::debug::display_bytecode_textual (cognitive 32): bex_vm::debug::display_bytecode_textual has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 3 (6 pts), match/switch 1 (2 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":"baml_language/crates/bex_vm/src/debug.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"70821f99bc3875423076b28b6a9543ea57492edb6d4660342a3a7c6c42c3bcae"}},{"ruleId":"D2","level":"warning","message":{"text":"sys_glob::glob_to_regex (cognitive 32): sys_glob::glob_to_regex has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 6, loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_glob/src/lib.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec7f1645965575f15eb01f98d737adbe168ca62d3ad97e1c71038c2446d6fb3"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_cpp::collect_requests (cognitive 32): sdkgen_cpp::collect_requests has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (11 pts), match/switch 2 (5 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":"baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5f23647268856a9d3f994413503fce536a3976839493430a04e92d29a12221"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_java::emit::render_callable_pair (cognitive 32): sdkgen_java::emit::render_callable_pair has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (20 pts), match/switch 4 (6 pts), boolean chains 4, loops 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/sdkgen_java/src/emit.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebad3502becee6d245f589a42ea0436f42a3e9455e825f4b736a0883749fdd40"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_rust::unions::collect (cognitive 32): sdkgen_rust::unions::collect has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 7 (14 pts), match/switch 1 (2 pts) (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":"baml_language/sdks/rust/sdkgen_rust/src/unions.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd39324a9f9913934af6d866c46fdb9c872e607c7fa134ace7e392f8adc9eb5"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_parser_database::names::resolve_names (cognitive 32): internal_baml_parser_database::names::resolve_names has cognitive complexity 32 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 4 (10 pts), match/switch 4 (10 pts) (nesting depth added 21). 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":"engine/baml-lib/parser-database/src/names/mod.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"528d5ea4144840afff09b537ac577e76a8edb9aa7a5ed57ffd7adb8bccdc807b"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_parser_database::types::prompt::process_prompt_ast (cognitive 32): internal_baml_parser_database::types::prompt::process_prompt_ast has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 4 (13 pts), loops 1 (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":"engine/baml-lib/parser-database/src/types/prompt.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"949f361ec82a227d10bd7dc90e5710d28bd682683e3f1a9831025a1a1e6baa6a"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_cffi_macros::export_baml_new_fn (cognitive 32): baml_cffi_macros::export_baml_new_fn has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1de9f7c49827821cce42a6c346c82ea7660c3658f2778c837980f62a6bf4b31"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetry_resource_report.render_report (cognitive 32): telemetry_resource_report.render_report has cognitive complexity 32 (threshold 15). Drivers by points: loops 10 (20 pts), if/else 4 (6 pts), ternaries 2 (4 pts), error handling 1 (2 pts) (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":"baml_language/scripts/telemetry_resource_report.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed1ce2caea3f7307ffdb25b309cd13e688bc2c619eea1a95c2580f4ac1dbd64"}},{"ruleId":"D2","level":"warning","message":{"text":"emit-sublime.renderYaml (cognitive 32): emit-sublime.renderYaml has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (20 pts), loops 4 (9 pts), match/switch 1 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar/scripts/emit-sublime.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77c226d17fe166df349b3092aa84f08bd8fd13aa4f1429794818bd6502d463e"}},{"ruleId":"D2","level":"warning","message":{"text":"top-level statements (cognitive 31): top-level statements has cognitive complexity 31 (threshold 15). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdk_tests/crates/csharp/generics/Program.cs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"4934dd8d682ecd9b739cd898f6d0595aea5f587fb4b20d760520bcb2eab159b7"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_cli::generate::discover_generators (cognitive 31): baml_cli::generate::discover_generators has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 3 (8 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/generate.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"683da3908a27501120939fcf2b16a397b26d0956c088e5e831f0544941206968"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_ast::lower_tree::body::object_literal (cognitive 31): baml_compiler2_ast::lower_tree::body::object_literal has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 5 (12 pts), loops 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b0ac34456391e0177a16efc13bd1a6863d1680896fed70665ce2b04d993403"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::impls::hash_eligible_within_depth::visit (cognitive 31): baml_compiler2_hir_ty::impls::hash_eligible_within_depth::visit has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 8, 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":"baml_language/crates/baml_compiler2_hir_ty/src/impls.rs"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"675f5e129672d776d4b40dc9d89bfdb90cc51c04c3c9ee0a3b4b6851ba8f696e"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::resolve::template_position_at (cognitive 31): baml_ide::resolve::template_position_at has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 6, match/switch 3 (4 pts), loops 2 (3 pts) (nesting depth added 10). Of this number, 26 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. 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":"baml_language/crates/baml_ide/src/resolve.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e1da58127766b891a0f29afa46194f9b53b46bde94ce1d6c4100cc221d1fcf"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_query_btel::functions::register (cognitive 31): baml_query_btel::functions::register has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18, match/switch 9 (10 pts), boolean chains 2, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/functions.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ff4b3bf88c411402b0efba52d623b3c6b4cb886e2af14adb53457300171e83"}},{"ruleId":"D2","level":"warning","message":{"text":"IntTy::coerce (cognitive 31): IntTy::coerce has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 2, match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d9ec98d910c171e1c9f916ab3999b54dd0aa02a0fe3b7fa48206bac122510d"}},{"ruleId":"D2","level":"warning","message":{"text":"bridge_ctypes::ty_decode::live_keys (cognitive 31): bridge_ctypes::ty_decode::live_keys has cognitive complexity 31 (threshold 15). Drivers by points: loops 9 (18 pts), if/else 6 (12 pts), match/switch 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":"baml_language/crates/bridge_ctypes/src/ty_decode.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c288eb6e61250057854c16e14a067a72e1e671035d2af2a723a5fa11991402"}},{"ruleId":"D2","level":"warning","message":{"text":"OutputFormatContent::render_type_hoisted (cognitive 31): OutputFormatContent::render_type_hoisted has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 5 (8 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_ops/src/output_format.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0714a1f48821d721baa52bf15161c089699689fc8635dc4221dccb0e2a840d"}},{"ruleId":"D2","level":"warning","message":{"text":"LeafBody::root_imports_py (cognitive 31): LeafBody::root_imports_py has cognitive complexity 31 (threshold 15). Drivers by points: loops 9 (29 pts), match/switch 1 (2 pts) (nesting depth added 21). 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. This shape REPEATS in the file: one other method here (LeafBody::all_rel_imports_from) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"06049284b0a53a5912e3e92c0c44706c6963626aaa89234044a9e84d08a98bb9"}},{"ruleId":"D2","level":"warning","message":{"text":"LeafBody::all_rel_imports_from (cognitive 31): LeafBody::all_rel_imports_from has cognitive complexity 31 (threshold 15). Drivers by points: loops 9 (29 pts), match/switch 1 (2 pts) (nesting depth added 21). 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. This shape REPEATS in the file: one other method here (LeafBody::root_imports_py) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"304aaaa6bbdefe2ffd486a265708b93902b1f81f66888e82541799b41b4ff589"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_swift::emit::render_class (cognitive 31): sdkgen_swift::emit::render_class has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (21 pts), loops 5 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/rust/sdkgen_swift/src/emit.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe58552cdb346301130929697f2b9d340ef2f664586f8ea85518cfda24abddc"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_core::validate::validation_pipeline::validations::classes::assert_no_field_name_collisions (cognitive 31): internal_baml_core::validate::validation_pipeline::validations::classes::assert_no_field_name_collisions has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 4 (6 pts), match/switch 2 (5 pts) (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":"engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/classes.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"987ea9f9f18d7ef9f4e38e328e1daf2697fa12be7f1e6d941b77ecbd16130c2c"}},{"ruleId":"D2","level":"warning","message":{"text":"ProtoReader.decodeUnionVariant (cognitive 31): ProtoReader.decodeUnionVariant has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (21 pts), ternaries 2 (7 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c67be446141e65cfbdfd3c99dde33cb625935d71f5a50aef084a12020cc2284"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_go.decodeMedia (cognitive 31): baml_go.decodeMedia has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (27 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/media.go"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81c2fc1edc8e4b1f913909a431fc23080ddd52b185a7c3af7755ea3c0a2b12e"}},{"ruleId":"D2","level":"warning","message":{"text":"bcs.checkPages (cognitive 31): bcs.checkPages has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 3 (4 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 12). Of this number, 30 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"typescript2/app-beps/convex/bcs.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"792fb959d9800e23c0c82671bd841cc6e721bf07166bb805d8a1c817ef6c46c1"}},{"ruleId":"D2","level":"warning","message":{"text":"bep-nav.BepNav (cognitive 31): bep-nav.BepNav has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 15, if/else 8 (9 pts), loops 4, ternaries 3 (nesting depth added 1). Most of this is not in the body itself: 12 of the 31 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 150, a function literal at line 128, appendSubtree, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-nav.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"65540e6c38be78fa5bf98559696ffe6c9a829457ba955450089454338aad9545"}},{"ruleId":"D2","level":"warning","message":{"text":"comment-feed-view.FeedCommentCard (cognitive 31): comment-feed-view.FeedCommentCard has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 23, if/else 6, error handling 1, ternaries 1. Of this number, 18 points are the body\u0027s own statements and 13 belong to 8 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65cdb8afc869686409c2ddcf10aeb4340ea174796bd1887505cbd0bcc90dc49"}},{"ruleId":"D2","level":"warning","message":{"text":"comment-thread.SingleComment (cognitive 31): comment-thread.SingleComment has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 21, if/else 6, ternaries 3, error handling 1. Of this number, 18 points are the body\u0027s own statements and 13 belong to 7 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-thread.tsx"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"2630b62c706df136707a0c2765228dcd73247c198e8111d2be7406d92d434b56"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_emit::analysis::collect_def_use (cognitive 30): baml_compiler2_emit::analysis::collect_def_use has cognitive complexity 30 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 4 (8 pts), match/switch 2 (7 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":"baml_language/crates/baml_compiler2_emit/src/analysis.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb503abf31571b21ad344ed1cb47048a9bdd9a67a372809130fd24ee549cd8f6"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::json_attrs::class_errors (cognitive 30): baml_compiler2_hir_ty::json_attrs::class_errors has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/json_attrs.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a234a1383f03bca17885fa3a29c84d6b3343d4fb7cd447b9fe2b6a6ee96dc757"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::method_resolution::union_arm_interfaces (cognitive 30): baml_compiler2_hir_ty::method_resolution::union_arm_interfaces has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 5 (10 pts), match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/method_resolution.rs"},"region":{"startLine":2013}}}],"partialFingerprints":{"codehealthFindingId/v1":"a851f30372e30e6fa740c3ac4dce9dd4e67c07153d2e99500ce7c61269e32966"}},{"ruleId":"D2","level":"warning","message":{"text":"Analysis::new (cognitive 30): Analysis::new has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 4 (6 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/optimize/effects.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"565b3627c434bf32c60fb0b9273340e5a1dc48a9f027d517047d4cdbb99a6741"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_mir::optimize::values::materialize_operand_prefixes (cognitive 30): baml_compiler2_mir::optimize::values::materialize_operand_prefixes has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 4 (7 pts), boolean chains 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":"baml_language/crates/baml_compiler2_mir/src/optimize/values.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a81c47fbbfb38318caba16d8b3bc7d851a1d5265325f7b5750e54b49aa3707"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::body (cognitive 30): Collector::body has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (23 pts), match/switch 1 (4 pts), loops 2 (3 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":"baml_language/crates/baml_compiler2_rust/src/reach.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"12119f11bf6f01ae325a614f139ed09b819eff73519b67a34e728fdcc8fa55ed"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_rust::admit::mask_bits (cognitive 30): baml_compiler2_rust::admit::mask_bits has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (19 pts), loops 4 (10 pts), boolean chains 1 (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":"baml_language/crates/baml_compiler2_rust/src/admit.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"3996d61dc5bf8a7b9c31d10ada5d5ad4190fb811a0150b93aba898943423a1d4"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_linker::space::relocate (cognitive 30): baml_linker::space::relocate has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 4 (9 pts), match/switch 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_linker/src/space.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f11d69b3b9f88cf7d9fc09e228c22207c46fb171a3605a881b68071dde5624a"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_lsp_server::playground_server::playground_ws_session (cognitive 30): baml_lsp_server::playground_server::playground_ws_session has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 4 (12 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecc789c4f523935c26d1c869dc7acab3b8dde4ae35abcf963ee5c6dc04e728e"}},{"ruleId":"D2","level":"warning","message":{"text":"Shared::take (cognitive 30): Shared::take has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_chunkedringbuffer/src/lib.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7e768c249a761dda4e30ef94c2716f7718bcb326c1d6041f000e5a9768919f"}},{"ruleId":"D2","level":"warning","message":{"text":"BexEngine::new_with_config (cognitive 30): BexEngine::new_with_config has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 7 (12 pts), loops 3 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":1857}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d662847b03ba4ee9a44e3f0b7ae733dcd9381bc157407fe8f0567d2e3c4987"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_reflect::type_kinds::validate_witness_states (cognitive 30): bex_vm::package_reflect::type_kinds::validate_witness_states has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 5 (7 pts), match/switch 3 (7 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b91fdc63bc525791da70097bc89488275c33d799f5fd5ba8af52a2120551d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Planner::fields (cognitive 30): Planner::fields has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 3 (8 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_encode/src/plan.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bcb416d8939c9494590c045555aebbdbb0d17101a9099bf4ce5cf3c9857ba6"}},{"ruleId":"D2","level":"warning","message":{"text":"Solution::learn (cognitive 30): Solution::learn has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 4 (7 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_encode/src/plan.rs"},"region":{"startLine":1344}}}],"partialFingerprints":{"codehealthFindingId/v1":"8afae4d048ae436f923d80f2e2f98fc89926ccb43a15fb1d74c9118fdc3de3d4"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldType::repr (cognitive 30): FieldType::repr has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 4 (9 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/ir/repr.rs"},"region":{"startLine":1885}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d05344367520e2cc2fcbf52b97a0ea2d5f5d979d1bef398b05d66d98b17b95e"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_stow::extract_features_from_dep (cognitive 30): cargo_stow::extract_features_from_dep has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 2 (8 pts) (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"faad016a2502bda37bec6905cd8980a469d1f918db71a49247a3bf2446f03a05"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_stow::check_dependencies_sorted (cognitive 30): cargo_stow::check_dependencies_sorted has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 2 (5 pts) (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8efba06f73860281a00a99dfd7cf4b83bd69a4c7ecf4322f9b19cedd504eef"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlValueWithFlags::explanation_impl (cognitive 30): BamlValueWithFlags::explanation_impl has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/deserializer/types.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa0560c36e8cf4f54710a6580d688fa5876c0e15371adbc4005ce8d5230299e"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_runtime::optimize::tui::render_prompt_panel (cognitive 30): baml_runtime::optimize::tui::render_prompt_panel has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 5 (12 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/tui.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"63833971be47724632fac67d1b2f7b0f59da7ef9825e3078645c5e5a54ab0ad2"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_runtime::optimize::tui::syntax_highlight (cognitive 30): baml_runtime::optimize::tui::syntax_highlight has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/tui.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"7296ce43fdfef53873987da1ddad9086457148530603e5b9865443667967d1b7"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_go.decodeGeneratedClass (cognitive 30): baml_go.decodeGeneratedClass has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 3, loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/dynamic.go"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ad78b45b2d19829d8fa82a3f89c0d4a20de39d6bbdc6fa65188a2b4f0a233a"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlUnion3._bamlDecode (cognitive 30): BamlUnion3._bamlDecode has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 6 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (BamlUnion3._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead1238670d55811a7b37f38de917cdb9fc27e28c0b530be86203916a4f5fd69"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlUnion3._bamlDecode (cognitive 30): BamlUnion3._bamlDecode has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 6 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (BamlUnion3._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5e582bccf43423e779654af706efae3525511fdac3e04cccbf2f462a4fc77f"}},{"ruleId":"D2","level":"warning","message":{"text":"bep-route-shell.BepRouteShell::handleConfirmSubmit (cognitive 30): bep-route-shell.BepRouteShell::handleConfirmSubmit has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 5, loops 2, error handling 1, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (bep-route-shell.BepRouteShell) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-route-shell.tsx"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"f854cc73ddd476d8a4483722beeabcf232ec46e1f7c983522ef0c7bbc27d6ab5"}},{"ruleId":"D2","level":"warning","message":{"text":"deployment-status.DeploymentStatus (cognitive 30): deployment-status.DeploymentStatus has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 20, if/else 8, match/switch 1, ternaries 1. Most of this is not in the body itself: 3 of the 30 points are its own statements and the rest belongs to 9 function items inside it that branch (a function literal at line 254, getProviderStatus, a function literal at line 117, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/magicui/deployment-status.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89c0a6e73ead1a11e2fabeac85879d0900336ccc98f69d68487d68400811362"}},{"ruleId":"D2","level":"warning","message":{"text":"TelemetryView.ContextInspector (cognitive 30): TelemetryView.ContextInspector has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 16 (19 pts), boolean chains 10, if/else 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":3192}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c24a6e55e990819338cbe6ff664d61a5765e3d6b2b48e055094ec9766aa6cbc"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_cli::describe_command::write_interface_body (cognitive 29): baml_cli::describe_command::write_interface_body has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (22 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 7). Of this number, 25 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. 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":"baml_language/crates/baml_cli/src/describe_command.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"141fcf8297e3ce5dc450147219d65e13cc5369d108ccee07ba14ceb4db830d9a"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::field_access_resolved (cognitive 29): InferenceContext::field_access_resolved has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 2, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":10054}}}],"partialFingerprints":{"codehealthFindingId/v1":"321277162d606221927ec25b3307b140ec3c8f06490ecb8813766740cab9f518"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::infer::const_fold_binary (cognitive 29): baml_compiler2_hir_ty::infer::const_fold_binary has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 8 (15 pts), if/else 5 (12 pts), boolean chains 2 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e703d49ec35a917964506d3ff14aa8f47d66169065e9ddfd542f61523282b99"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::infer::infer_body_impl (cognitive 29): baml_compiler2_hir_ty::infer::infer_body_impl has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 8 (13 pts), loops 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":1774}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca189d1f8252435e1232a8cfda49545be374f5a9c0ea8ca726a744cfa72b3234"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::check_intrinsic (cognitive 29): LoweringContext::check_intrinsic has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 3 (9 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":9322}}}],"partialFingerprints":{"codehealthFindingId/v1":"a355ede3f2d96d3626d751c6bae97d578a3e93f11d03a0a255d3455e1c929034"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_match_chain (cognitive 29): LoweringContext::lower_match_chain has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":13168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e956409a3d4d0b5fdc759f4612d8caf8b3dbb7b4dab3d6ea0d9f52239bf7eba8"}},{"ruleId":"D2","level":"warning","message":{"text":"ProgramIndex::index_objects (cognitive 29): ProgramIndex::index_objects has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 4 (12 pts), 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":"baml_language/crates/baml_compiler2_rust/src/index.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"843de97d71bd8aa97bf7982a26bcd2117a94a0ec920e35e0180ef22ca81efabd"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_rust::admit::lower_program (cognitive 29): baml_compiler2_rust::admit::lower_program has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 2 (6 pts), loops 3 (5 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_rust/src/admit.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca41856e0fe80be2360a73ad939b88ca5089ee669069540048f150e62c4d618"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_lsp_server::playground_server::lsp_ws_session (cognitive 29): baml_lsp_server::playground_server::lsp_ws_session has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 4 (12 pts), boolean chains 3, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ba48d8b100032632855b8b8b0a17c6611099c02e9950987e5f0eeda24c1bdf"}},{"ruleId":"D2","level":"warning","message":{"text":"Consumer::drain_chunks (cognitive 29): Consumer::drain_chunks has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 5 (9 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_chunkedringbuffer/src/lib.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be6801ed76fdf3e54d4e7e390b51bc767384902f4d324c91d941e129426c18f"}},{"ruleId":"D2","level":"warning","message":{"text":"BigintTy::coerce (cognitive 29): BigintTy::coerce has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (28 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"75665717608af3801b6768df80c07c8cd0789a08ff000ca0ba01e653a7582495"}},{"ruleId":"D2","level":"warning","message":{"text":"BexVm::handler_contexts (cognitive 29): BexVm::handler_contexts has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":3304}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e8f15da404c593d94fa46f95c667fc7662c46f6eec0cdeaff31777154f067c"}},{"ruleId":"D2","level":"warning","message":{"text":"bridge_cffi::baml_to_host::decode_invocation_request (cognitive 29): bridge_cffi::baml_to_host::decode_invocation_request has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 5 (10 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_cffi/src/baml_to_host.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10f8418819b89c81f27e0ff00cbb3c4070dfd3616f8177100f25f2bdf5beff2"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_csharp::semantic::collect_type_closure (cognitive 29): sdkgen_csharp::semantic::collect_type_closure has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 5 (10 pts), boolean chains 1, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":2359}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b610afce6c088af30ea7c0d3997008c6fa71dd125edc7abc5537495b16e7ce6"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_go::names::project_base (cognitive 29): sdkgen_go::names::project_base has cognitive complexity 29 (threshold 15). Drivers by points: loops 13 (25 pts), if/else 3, match/switch 1 (nesting depth added 12). 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":"baml_language/sdks/go/sdkgen_go/src/names.rs"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a4c08c009c5964c697e62551b54bf2106440bef1c80d8b7a1caf3e4dff0414"}},{"ruleId":"D2","level":"warning","message":{"text":"CandidateApplier::update_enum_attributes (cognitive 29): CandidateApplier::update_enum_attributes has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (27 pts), loops 1 (2 pts) (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/applier.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"1973c94c40edde531e5f673d6863e476e04a63adacd2ca6c2ba7b71f4beb42f4"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_runtime::cli::dotenv::load_env_from_string (cognitive 29): baml_runtime::cli::dotenv::load_env_from_string has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (9 pts), boolean chains 6 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/cli/dotenv/mod.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e64a308f3df85138ed705b42160205c930c6fadc7cc1e9e83da8a0e915620b"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_vm::debug::display_bytecode (cognitive 29): baml_vm::debug::display_bytecode has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 5 (9 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-vm/src/debug.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ca6e883a7558382ea82e51d96983d77e3850e5f67558b9634e7a1ef5261630"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_derive::is_option_of_float (cognitive 29): baml_derive::is_option_of_float has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (28 pts), boolean chains 1 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-derive/src/lib.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cca018b315339d0c792729503baefc9825bbd0bfbaea32cb5bbb41d843a9705"}},{"ruleId":"D2","level":"warning","message":{"text":"Bench.run_query (cognitive 29): Bench.run_query has cognitive complexity 29 (threshold 15). Drivers by points: loops 6 (17 pts), if/else 3 (12 pts) (nesting depth added 20). 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":"baml_language/tools/btel_query_bench.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04e5d391f5f2335fd73bd4bd6c327ca59d8783f7b6c275bdcd3ea058b4ecea8"}},{"ruleId":"D2","level":"warning","message":{"text":"btel_query_summary.query_section (cognitive 29): btel_query_summary.query_section has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 7 (14 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/btel_query_summary.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d28f168f9eee215ea100b76c79d41c5f5ccf1f06b8e5c1fbf9d98d1ee6c62c"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_go.outboundToInbound (cognitive 29): baml_go.outboundToInbound has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/thrown.go"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33e0cffc04638712e78e9e2b1c5a0fcdf427c066778864f369cd43c25614f15"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlRuntime.executeTests (cognitive 29): BamlRuntime.executeTests has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 7, loops 4 (5 pts), error handling 1 (3 pts), ternaries 1 (nesting depth added 6). Most of this is not in the body itself: 10 of the 29 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 914, 846, 885). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/runtime/BamlRuntime.ts"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b63b875d547cb558aec00cbfa1ee77b0d77a72286cd30bacb2f1895c3e2bb7"}},{"ruleId":"D2","level":"warning","message":{"text":"annotation-svg.renderAnnotatedSnippet (cognitive 29): annotation-svg.renderAnnotatedSnippet has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 8, ternaries 5, loops 4 (nesting depth added 1). Most of this is not in the body itself: 8 of the 29 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 94, a function literal at line 167, pos, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/snippets/annotation-svg.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bd591485d056529f8d8438e621de86bc52e6c091dec751e0310ad4c546df90"}},{"ruleId":"D2","level":"warning","message":{"text":"dictionary-types.unsafeDirectValue (cognitive 29): dictionary-types.unsafeDirectValue has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (15 pts), ternaries 5 (10 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"33aa5b7721d5595e35bfe601c7073f0bc2908e260ef94e0eead0274d942d10d8"}},{"ruleId":"D2","level":"warning","message":{"text":"types.buildGroups (cognitive 29): types.buildGroups has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 4 (6 pts), ternaries 3 (6 pts) (nesting depth added 12). Of this number, 25 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. 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":"typescript2/app-stdlib-matrix/src/types.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de9fab332175566a175d35d14005596204d2e89cfde677540aace513a075f45"}},{"ruleId":"D2","level":"warning","message":{"text":"top-level statements (cognitive 28): top-level statements has cognitive complexity 28 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdk_tests/crates/csharp/stdlib_resources/Program.cs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1284d2fcb4449f7f70703316cf5eb9d2c97cec1ab56628d025808286859c47"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_builtins2_codegen::codegen::receiver_input_type_with_vm_usage (cognitive 28): baml_builtins2_codegen::codegen::receiver_input_type_with_vm_usage has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_builtins2_codegen/src/codegen.rs"},"region":{"startLine":2235}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c310c6a0b7f4b1ccd0a0070a05a4ec79b129b75e1492bf62f6f56794b25e1b9"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_cli::describe_command::truncate_body (cognitive 28): baml_cli::describe_command::truncate_body has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 7 (10 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/describe_command.rs"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"93413c4cc60b8e02fa08ca619794631884c4d4253e4274e357a6483629b88e9b"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_ast::lower_tree::templates::alone_on_line (cognitive 28): baml_compiler2_ast::lower_tree::templates::alone_on_line has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 2, boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/lower_tree/templates.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"a034e238a966a6fc36f52a9597a36b764a53cbfd953848bebf216e9e9ad2044a"}},{"ruleId":"D2","level":"warning","message":{"text":"StackifyCodegen::emit_statement (cognitive 28): StackifyCodegen::emit_statement has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 6 (14 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/emit.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81b170aef5fdf16b1d05c404d859f0d421569738f5400c5058e2f8c731f7aed"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir::resolve::names_in_scope_at (cognitive 28): baml_compiler2_hir::resolve::names_in_scope_at has cognitive complexity 28 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 5 (11 pts), boolean chains 1 (nesting depth added 16). 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":"baml_language/crates/baml_compiler2_hir/src/resolve.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4cf894cb8e28b9f30ddd25f0571a509522bdb06ff0b990806b89a9ce6a009d"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::take_unresolved_infer_diagnostics (cognitive 28): InferenceContext::take_unresolved_infer_diagnostics has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 3 (7 pts), loops 4, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":12294}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d54445c812a58a89706db00cb2861c7a9c3c45b6c2d9c3a9b56f55557425109"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::globals::strongly_connected_components (cognitive 28): baml_compiler2_hir_ty::globals::strongly_connected_components has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 3 (7 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/globals.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dfdbd90701299eb5310ad78809513d51877f31ada23daae9069057c6a910a16"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_member_access (cognitive 28): LoweringContext::lower_member_access has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":10524}}}],"partialFingerprints":{"codehealthFindingId/v1":"836a881f5d7255d7b1b1c93ae7deb232f7366af234ab5c86ecde4b22d3936c2c"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_rust::analysis::type_locals (cognitive 28): baml_compiler2_rust::analysis::type_locals has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 2 (9 pts), loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_rust/src/analysis.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"24660824463b19913fe8fd822be75101b7f5a524054b8a57728e1704c11f34d7"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::completion::members::complete (cognitive 28): baml_ide::completion::members::complete has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 3 (6 pts), boolean chains 2, match/switch 1 (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/completion/members.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d808f8e08a8e003bbd193b245a7ea37767f118deb87014961822a8995ac7fd6e"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::resolve::receiver_at_dot (cognitive 28): baml_ide::resolve::receiver_at_dot has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/resolve.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c972e91fb5bd84a375ded201f55166cb9d5ffa1e6b2f2d9672247cf3a0bc2d"}},{"ruleId":"D2","level":"warning","message":{"text":"Id::single_line_width (cognitive 28): Id::single_line_width has cognitive complexity 28 (threshold 15). Drivers by points: loops 9 (21 pts), if/else 4 (7 pts) (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":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a4a01f5c422c77904d9131c15c1af96e4281455aa5242423084f006814ec35"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonInhabitance::discover (cognitive 28): JsonInhabitance::discover has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/json_inhabit.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4fe20522af6e0ecafe54140370c9a70f5ae2dc7c75377ce32638525dfa172f7"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::debug::display_bytecode (cognitive 28): bex_vm::debug::display_bytecode has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 5 (9 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/debug.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28bc86113d9d6ab66fc4503d79330d9516eceadb6219d54dd4283ea984248ed"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_baml::csv::convert_cell (cognitive 28): bex_vm::package_baml::csv::convert_cell has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 9 (17 pts), if/else 6 (10 pts), boolean chains 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c6b5ada393e78a1cfc85fd4661f740a6311fab55c564d96615be623451d5e9"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_size_gate::compare::check_policy (cognitive 28): cargo_size_gate::compare::check_policy has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (27 pts), match/switch 1 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/tools_size_gate/src/compare.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bce288614af29a7ef8a2dde176232883b320d1785ae10911c033a4cc2c6dff9"}},{"ruleId":"D2","level":"warning","message":{"text":"IRSignature::new_from_ir (cognitive 28): IRSignature::new_from_ir has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 12 (13 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/ir/ir_hasher/mod.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb68dc4cc98cf1a049924b92eecfe7f83e98a6592862634baca5812c25d1e4d6"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_core::validate::validation_pipeline::validations::types::validate_type_constraints (cognitive 28): internal_baml_core::validate::validation_pipeline::validations::types::validate_type_constraints has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 5 (13 pts), loops 1 (nesting depth added 17). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/types.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"644cdbafb06d7ddc0c76948f59729aaf49e4147c017f942125f9a3ec23bb4e97"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_types::ir_type::converters::streaming::from_type_ir::partialize_helper (cognitive 28): baml_types::ir_type::converters::streaming::from_type_ir::partialize_helper has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-types/src/ir_type/converters/streaming.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f034d75ab50e737e2e632e46abeffb3d65209450bf4a04d508f9da6eb84d30bc"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_jinja_types::evaluate_type::expr::infer_const_type (cognitive 28): internal_baml_jinja_types::evaluate_type::expr::infer_const_type has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 5 (11 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jinja/src/evaluate_type/expr.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c70264e7a3843f2cbcbc46f4bae54023f46ef1362e21c814d268a24a3d838e5"}},{"ruleId":"D2","level":"warning","message":{"text":"GEPAOrchestrator::run (cognitive 28): GEPAOrchestrator::run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 4, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/orchestrator.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"7076f3e55960a40bad085eb0e0c2590176fbd99e715ceaaad99513e378ddedec"}},{"ruleId":"D2","level":"warning","message":{"text":"Vm::process_notifications (cognitive 28): Vm::process_notifications has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 4 (10 pts), loops 2 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-vm/src/vm.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"970c4f6330780f2d2b59b1294fb897b0926df4cacd8497d080819aa5b6732bff"}},{"ruleId":"D2","level":"warning","message":{"text":"Watch::track_dependencies (cognitive 28): Watch::track_dependencies has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 4 (10 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-vm/src/watch.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c41353107e9f6958e1c3c6a882967c354aeb0dd73d466f3749ea3623112eec"}},{"ruleId":"D2","level":"warning","message":{"text":"proto._ty_to_python_type (cognitive 28): proto._ty_to_python_type has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (21 pts), ternaries 2 (4 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/src/baml_bridge/proto.py"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4ea649bde83a600cc91b4b8c6e6c34f5d8391fe8afffd3a32422581d751304"}},{"ruleId":"D2","level":"warning","message":{"text":"Run.fixture (cognitive 28): Run.fixture has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 5 (7 pts), boolean chains 5, ternaries 3 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/btel_query_smoke.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2af565aa5d174682ae484f5c10c5b068be5ab3f571f511ee3963c68006eaff"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_go.resolveRuntime (cognitive 28): baml_go.resolveRuntime has cognitive complexity 28 (threshold 15). Drivers by points: if/else 21 (28 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":"baml_language/sdks/go/baml_go/runtime_artifact.go"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be6e70a36e964e290043a5e32d4557a1dd504f9c2f2bb3c867ab6d6ca2f784c"}},{"ruleId":"D2","level":"warning","message":{"text":"index.testRecursiveComplexity (cognitive 28): index.testRecursiveComplexity has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 9 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/mixed_complex_types/typescript/index.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc5f9cebd1ec886eb28d772409d31fcdbb843a7a4ce211509947fa6ce0937b7"}},{"ruleId":"D2","level":"warning","message":{"text":"index.TestingSidebar (cognitive 28): index.TestingSidebar has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 18, if/else 6 (7 pts), ternaries 3 (nesting depth added 1). Most of this is not in the body itself: 5 of the 28 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 109, a function literal at line 205, a function literal at line 265, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/index.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5927d4433359688cbb4c448d1d31b0ea757750a0686aec43cb63de9db74d528"}},{"ruleId":"D2","level":"warning","message":{"text":"board.BcsBoard (cognitive 28): board.BcsBoard has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 13 (20 pts), if/else 5, boolean chains 3 (nesting depth added 7). Most of this is not in the body itself: 11 of the 28 points are its own statements and the rest belongs to 9 function items inside it that branch (setParam, a function literal at line 172, a function literal at line 150, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/board.tsx"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"002bf0fb71c37c982d216a8fdc115a65c84a5518afe31786be2b2c39a040dba0"}},{"ruleId":"D2","level":"warning","message":{"text":"dictionary-types.dictionaryValueTypes (cognitive 28): dictionary-types.dictionaryValueTypes has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 10, boolean chains 6 (nesting depth added 6). Of this number, 25 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c1a7cbc54b1ea04a1e991435ec52818b69db1dde551b9f95772ec95a158a25"}},{"ruleId":"D2","level":"warning","message":{"text":"scene-player.ScenePlayer (cognitive 28): scene-player.ScenePlayer has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 15 (17 pts), if/else 6 (7 pts), boolean chains 4 (nesting depth added 3). Most of this is not in the body itself: 12 of the 28 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 41, a function literal at line 81, go, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/scene-player.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d22149c97d5ea816869e79466eaf12b30e0fa2645383a14981909f500e61e7"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_builtins2_codegen::codegen::call_arg_list (cognitive 27): baml_builtins2_codegen::codegen::call_arg_list has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (8 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_builtins2_codegen/src/codegen.rs"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d77f1d777a4f63e346e08999288a8755fe4654da762de7372fddd50facaf69d"}},{"ruleId":"D2","level":"warning","message":{"text":"RunArgs::validate_scripts (cognitive 27): RunArgs::validate_scripts has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2 (5 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/run_command.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3de7467d48e54f0f8882f76c535c77bee42bb8a50542c446eeb82e0d1448547"}},{"ruleId":"D2","level":"warning","message":{"text":"RunArgs::write_list (cognitive 27): RunArgs::write_list has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/run_command.rs"},"region":{"startLine":1517}}}],"partialFingerprints":{"codehealthFindingId/v1":"6290d1a9c412ea9fc0f6672cdcfce42f00932e0b50c3bfee5cbc1e3a719b9cd1"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_emit::analysis::compute_dominators (cognitive 27): baml_compiler2_emit::analysis::compute_dominators has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/analysis.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"533be7bef52b9b308ea76a48f234442f1bac740abc6b2fdb4647ed343855a69c"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir::resolve::type_names_in_scope_at (cognitive 27): baml_compiler2_hir::resolve::type_names_in_scope_at has cognitive complexity 27 (threshold 15). Drivers by points: loops 5 (16 pts), if/else 4 (8 pts), match/switch 1 (3 pts) (nesting depth added 17). 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":"baml_language/crates/baml_compiler2_hir/src/resolve.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f27a8fbc48fad81bcab13a4801c551aeef97239d24aeb632a27e4ec7dcc8aa3"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_source_object (cognitive 27): InferenceContext::infer_source_object has cognitive complexity 27 (threshold 15). Drivers by points: loops 7 (11 pts), if/else 7 (9 pts), match/switch 3 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":9612}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86d22cb3b3b2b92bfe4798e393a7f9c918f2cef3676ff22404e5700a1800d5b"}},{"ruleId":"D2","level":"warning","message":{"text":"LowerCtx::lower_exported_type (cognitive 27): LowerCtx::lower_exported_type has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 2 (5 pts), match/switch 1 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0e91332c696f5812f0ffbbb808b2b9ce8ff30810762408aea494d5f2f763bb"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::callee_builtin_kind (cognitive 27): LoweringContext::callee_builtin_kind has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":9172}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b096d0faedd3126a9569fc8813f284611f284e05f0a2350933021bbd318f1b"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_visualization::control_flow::flatten::filter_graph (cognitive 27): baml_compiler2_visualization::control_flow::flatten::filter_graph has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 4 (8 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8da7a193f9de244da41d705b881463da0716d3efb01320afb9907bfaf752df"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::resolve::operator_target_at (cognitive 27): baml_ide::resolve::operator_target_at has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 7, loops 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/resolve.rs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"310780bcd931c56afa6cee6b74eb7b7222c462fcd3f8c8058c7666149ab89b02"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_parser::items::impl_members (cognitive 27): baml_parser::items::impl_members has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 2 (5 pts), boolean chains 4, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7abdbf9226d8cd6689811d323fddf81fe97b8bb167b6b6eed45bbac793c194"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_query_btel::ingest::resolve_nodes (cognitive 27): baml_query_btel::ingest::resolve_nodes has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 5 (7 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":2051}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae88e373746dde998afeaae3e2d36586da695b5a582f0d8d54601df8b35bacc"}},{"ruleId":"D2","level":"warning","message":{"text":"BexEngine::call_resolved_with_trace (cognitive 27): BexEngine::call_resolved_with_trace has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 3 (4 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":3449}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e17c240d66aa8a7bac9ba427e1427863e495161df1ce396dc54ec8a3b8cf33"}},{"ruleId":"D2","level":"warning","message":{"text":"BexEngine::projected_surface (cognitive 27): BexEngine::projected_surface has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 6 (10 pts), loops 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":7113}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b82312ce3e376eda54d3f90668e5efcc9e231f6d745d212e8273ca9c559b311"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_baml::toml::snapshot (cognitive 27): bex_vm::package_baml::toml::snapshot has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 2, boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/toml.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9074347722aed46b7b54b8153774ff94b9005a00784efc4595c0e0e05175b9"}},{"ruleId":"D2","level":"warning","message":{"text":"ArtifactTelemetry::from_manifest (cognitive 27): ArtifactTelemetry::from_manifest has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 3 (7 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_settings/src/artifact.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"87508b52e5e493e50bc3da9bc84378cd321d7caae3eb383f4ff9116d1ea3a92f"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_size_gate::output::print_fix_hint (cognitive 27): cargo_size_gate::output::print_fix_hint has cognitive complexity 27 (threshold 15). Drivers by points: loops 7 (18 pts), if/else 5 (8 pts), boolean chains 1 (nesting depth added 14). 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":"baml_language/crates/tools_size_gate/src/output.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc8517a62c3d7518be3283b926088074e750017eee92c0ffa89e4a43ef90cb2"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_stow::get_crate_dependencies (cognitive 27): cargo_stow::get_crate_dependencies has cognitive complexity 27 (threshold 15). Drivers by points: loops 5 (16 pts), if/else 4 (11 pts) (nesting depth added 18). 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. This shape REPEATS in the file: one other method here (cargo_stow::collect_dep_names) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c65a093dd27b9467d44aff45ce1c8b88663e1677a270e302fc1f5790c3ca4f1"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_stow::collect_dep_names (cognitive 27): cargo_stow::collect_dep_names has cognitive complexity 27 (threshold 15). Drivers by points: loops 5 (16 pts), if/else 4 (11 pts) (nesting depth added 18). 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. This shape REPEATS in the file: one other method here (cargo_stow::get_crate_dependencies) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e1d058e1bc75a273d338b2d04b15f5ad6fe987fe65d9331dd988c46baaa12e"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_python_pydantic2::leaf::split_hoistable_aliases (cognitive 27): sdkgen_python_pydantic2::leaf::split_hoistable_aliases has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 5 (7 pts), boolean chains 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ad0377c699e4f6b7c9a5a1fa8ab4d859d83b0656cef74a2455a6c1b18367dd"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_python_pydantic2::translate_ty::translate_ty_from (cognitive 27): sdkgen_python_pydantic2::translate_ty::translate_ty_from has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/translate_ty.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e28865531ae474bb7902165f989456077421e6771a8a58199df4ceccbc1aac"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_python_pydantic2::utils::format_class_docstring (cognitive 27): sdkgen_python_pydantic2::utils::format_class_docstring has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (9 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/utils.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20f4c9ad5aecf623b024ca1c37981578f55e1dd11113be7d0c1306aff46e985"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_typescript_shared::translate_ty::translate_ty (cognitive 27): sdkgen_typescript_shared::translate_ty::translate_ty has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/typescript/sdkgen_typescript_shared/src/translate_ty.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2aa0e85206dd0fcf1c6892e5f89696697cba504407d01a7f38829c22a824fee"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_ast::parser::parse_named_args_list::parse_named_argument_list (cognitive 27): internal_baml_ast::parser::parse_named_args_list::parse_named_argument_list has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (9 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/parser/parse_named_args_list.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"deda6b4cd93e65c0022254cd165ba476f0ad4835e057d66c15f65cb822469cfd"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_core::validate::validation_pipeline::validations::functions::validate (cognitive 27): internal_baml_core::validate::validation_pipeline::validations::functions::validate has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 6 (15 pts), if/else 3 (7 pts), loops 3 (5 pts) (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/functions.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a30fdfc2be5efbe8e45ee3ef2efbeaeaf6f68ce5c8e314394d5d7b6d26635c"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlValueWithMeta::is_type (cognitive 27): BamlValueWithMeta::is_type has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 14 (25 pts), boolean chains 2 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 2 other methods here (BamlValueWithMeta::is_type, BamlValueWithMeta::is_type) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-types/src/baml_value.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54390cef9b94f38f55b1fb69c4bbbafb9ffc3fec85489967b20a6699aa47def"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlValueWithMeta::is_type (cognitive 27): BamlValueWithMeta::is_type has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 14 (25 pts), boolean chains 2 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 2 other methods here (BamlValueWithMeta::is_type, BamlValueWithMeta::is_type) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-types/src/baml_value.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"8458da6c7354004fece37571984d9bae1f06b7622018a2f98b8720224d8ddd30"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlValueWithMeta::is_type (cognitive 27): BamlValueWithMeta::is_type has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 14 (25 pts), boolean chains 2 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: 2 other methods here (BamlValueWithMeta::is_type, BamlValueWithMeta::is_type) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-types/src/baml_value.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"514812fbb11f21943602e3058a010d4ddf0f74b6f5c5fb7fa05ddbb6b838f7ae"}},{"ruleId":"D2","level":"warning","message":{"text":"AwsClient::client_anyhow (cognitive 27): AwsClient::client_anyhow has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 4 (7 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"2867fdfcc5833042b31213ee61d88c0e0a6106ce7d3a0ded9dcb49ab619f4812"}},{"ruleId":"D2","level":"warning","message":{"text":"TracePublisher::run (cognitive 27): TracePublisher::run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (21 pts), match/switch 2 (5 pts), loops 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":"engine/baml-runtime/src/tracingv2/publisher/publisher.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"799f1685f5314963d3df68f820c36bf082e0b48aced593fd12398007bc193c8c"}},{"ruleId":"D2","level":"warning","message":{"text":"launch-runtime.runtime_environment (cognitive 27): launch-runtime.runtime_environment has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/atb2/deploy/launch-runtime.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4b3a9442d77ea9aaf5903acd42770e6811b5eecab2f0a478f382d5ed3bc69f"}},{"ruleId":"D2","level":"warning","message":{"text":"csharp-mtime-cache.restore (cognitive 27): csharp-mtime-cache.restore has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 5 (8 pts), error handling 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/scripts/csharp-mtime-cache.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"74abf68ad17b70c0c7cfd2cfbbaafff0b38087c92e8d394c1e0190e5dd4832a6"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetry_resource_report._reference_metrics (cognitive 27): telemetry_resource_report._reference_metrics has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 3 (6 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/scripts/telemetry_resource_report.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f87a048eabac9427f22ca1ff5c17a470d55cd7e8beaafe87fba595687735199"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_go.equalBAMLType (cognitive 27): baml_go.equalBAMLType has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 7, loops 2 (5 pts), match/switch 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/value.go"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaceb1b67f6ef089343305d9ddd404c4164d71c359b8a48bda645862bfd09b2d"}},{"ruleId":"D2","level":"warning","message":{"text":"FileViewer.FileViewer (cognitive 27): FileViewer.FileViewer has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (nesting depth added 11). Most of this is not in the body itself: 2 of the 27 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 178, 257, 168, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_components/Tree/FileViewer.tsx"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d247ff1f3bff6794093cb690b9ef39ef31017bb54c692655b3be3edf22118144"}},{"ruleId":"D2","level":"warning","message":{"text":"chart.ChartTooltipContent (cognitive 27): chart.ChartTooltipContent has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 14, ternaries 6 (9 pts), if/else 4 (nesting depth added 3). Most of this is not in the body itself: 4 of the 27 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 182, 131). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/chart.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c956d951dc2d401a6caf69adb4134fd649b3eb86a7635c8468f39c7aa0f2378a"}},{"ruleId":"D2","level":"warning","message":{"text":"copy-button.CopyButton (cognitive 27): copy-button.CopyButton has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 9 (23 pts), if/else 2 (3 pts), error handling 1 (nesting depth added 15). Of this number, 23 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/custom/copy-button.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b6598e8027ff5c1796c36b60dbf535b6e621dcad9594ef111836ea0f403920"}},{"ruleId":"D2","level":"warning","message":{"text":"bep-export-all-dialog.BepExportAllDialog (cognitive 27): bep-export-all-dialog.BepExportAllDialog has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (8 pts), ternaries 6 (7 pts), loops 2 (3 pts), error handling 1 (nesting depth added 5). Most of this is not in the body itself: 11 of the 27 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 83, 139). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-export-all-dialog.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10a42f4e79620948b9cdfb3d661ca465abe4f0d4cb65eeb43adfc77edef85b8"}},{"ruleId":"D2","level":"warning","message":{"text":"issue-card.IssueCard (cognitive 27): issue-card.IssueCard has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 9, ternaries 8 (9 pts), error handling 4 (5 pts), if/else 4 (nesting depth added 2). Of this number, 16 points are the body\u0027s own statements and 11 belong to 6 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/issues/issue-card.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"392f51d1a1a414fb484627c5f0b8516b24e0941a53a56090ff6f6af6dfde988e"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime.createSolveRuntime.runOne (cognitive 27): runtime.createSolveRuntime.runOne has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 4, ternaries 1 (4 pts), error handling 2, loops 1 (nesting depth added 12). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"typescript2/app-website/app/(home)/bamlcode/_lib/runtime.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"7565093548ca8844f53873d372909833c42510e68f1284995609e8d4c1899948"}},{"ruleId":"D2","level":"warning","message":{"text":"hero-video.codeDeco (cognitive 27): hero-video.codeDeco has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (23 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/hero-video.tsx"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f442a57f2ab98c80bb0f35eaa4648c5d1c28f4847070b9f623371a02fe770f"}},{"ruleId":"D2","level":"warning","message":{"text":"tracker.BamlBar (cognitive 27): tracker.BamlBar has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 17 (19 pts), boolean chains 6, if/else 1, loops 1 (nesting depth added 2). Of this number, 18 points are the body\u0027s own statements and 9 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/tracker.tsx"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41c94a86d459b26854e703a7f469810e92b24f0f56df106ac1cda7a08b4e754"}},{"ruleId":"D2","level":"warning","message":{"text":"stack.Media (cognitive 27): stack.Media has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 17 (23 pts), boolean chains 4 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 11 belong to 2 function literals inside it that branch. 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":"typescript2/app-website/components/home/stack.tsx"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fe9081e6ec1c10e84e06bf7db3f34f267c040edd886995cb86dfbccdb57a86"}},{"ruleId":"D2","level":"warning","message":{"text":"lod.applyLevelOfDetail (cognitive 27): lod.applyLevelOfDetail has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 7, loops 4 (nesting depth added 5). Of this number, 19 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. 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":"typescript2/pkg-playground/src/graph/lod.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0403099f4d0018c02941eb4fa0707ea3c23780188eafad6765f8ebb23913d6"}},{"ruleId":"D2","level":"warning","message":{"text":"WebSocketRuntimePort.fromServer (cognitive 27): WebSocketRuntimePort.fromServer has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 6 (11 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ports/WebSocketRuntimePort.ts"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"562616c26117476e5d7a6e277f2b14051b147f864b7ec4ac0de8668155983c92"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplayServer.ServeRequestAsync (cognitive 26): ReplayServer.ServeRequestAsync has cognitive complexity 26 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdk_tests/crates/csharp/streaming/Program.cs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"a670278b5abfb0c835ab31db481e0c8ca814adfb13188949b8aa171529a244c7"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_builtins2_codegen::extract::extract_scoped (cognitive 26): baml_builtins2_codegen::extract::extract_scoped has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 5 (8 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_builtins2_codegen/src/extract.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"b668e51d52dc6b067cc76e3c4fc09133ffe69893e792a61a6302c9bf956126f8"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_cli::colordiff::print_diff (cognitive 26): baml_cli::colordiff::print_diff has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (10 pts), match/switch 1 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/cli/src/colordiff.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade56826269b231921ced3d3483f1d75090bb18862345dc6e8d2583d8d8db794"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_ast::lower_tree::body::expression_in_chain (cognitive 26): baml_compiler2_ast::lower_tree::body::expression_in_chain has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 4 (7 pts), loops 1 (2 pts) (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"53881456766fe1e0ae89f6c112fb66b11b0775bee18e176201ce83c8d95b7842"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticIndexBuilder::walk_expr_children (cognitive 26): SemanticIndexBuilder::walk_expr_children has cognitive complexity 26 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 5 (11 pts), match/switch 2 (3 pts) (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir/src/builder.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"05485cdab694ede61843402ebfbad66a11c03ee50336d0945e1b87fe8b887cb3"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::exhaustiveness::write_ty_identity (cognitive 26): baml_compiler2_hir_ty::exhaustiveness::write_ty_identity has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 5 (10 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/exhaustiveness.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6e759bce16c775ded59b7640e8ac4b93e93cd227b14c16048e9d642a2d11ca"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::init_io::evaluated_calls_impl (cognitive 26): baml_compiler2_hir_ty::init_io::evaluated_calls_impl has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 4 (8 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/init_io.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e169d5acdb02b2f6232980fda7cad79c4cc27a5a6e34931daa9ca19dcb87b45b"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::interfaces::realize_qualifier_through_roots (cognitive 26): baml_compiler2_hir_ty::interfaces::realize_qualifier_through_roots has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs"},"region":{"startLine":2173}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4a00ddbea4019f974b86298782349f3f7362f4fc477378ac526c571fa87580"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::sys_op_callee (cognitive 26): LoweringContext::sys_op_callee has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 1 (3 pts) (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (LoweringContext::sys_op_synthetic_type_arg_count) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":9090}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e134893eeb3d3e5ee217a914e30a2fbc5568624459aee3423d78badb653fc8f"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::sys_op_synthetic_type_arg_count (cognitive 26): LoweringContext::sys_op_synthetic_type_arg_count has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 1 (3 pts) (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (LoweringContext::sys_op_callee) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":9234}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a1db8fa0322f0a08da254d73bfe61489299758343e0b87c912b17aa4ce480b"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_mir::optimize::values::fold (cognitive 26): baml_compiler2_mir::optimize::values::fold has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 7 (17 pts), if/else 3 (7 pts), boolean chains 2 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/optimize/values.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a53a7d572e0745d794f22c201f0497a0b259fb273b735f8e401c00a41ccc29"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_db::check::new_tir_diagnostic (cognitive 26): baml_db::check::new_tir_diagnostic has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (19 pts), match/switch 4 (7 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_db/src/check.rs"},"region":{"startLine":1838}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d10589bea0bef8e42a894bbef8a805aa75364d6fcda478e5fb7a644f65f84fe"}},{"ruleId":"D2","level":"warning","message":{"text":"Translator::select (cognitive 26): Translator::select has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 4 (7 pts), boolean chains 3, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/sql.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"109b7544e3ea9b8f99ec7cf59381d21087e7fcfc046d7742a77959d2201547f5"}},{"ruleId":"D2","level":"warning","message":{"text":"Translator::function (cognitive 26): Translator::function has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 4 (7 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/sql.rs"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"f937a2472a2a0e92bca32d9ba5dedbb229d616ad1613d736be302a24bda5684f"}},{"ruleId":"D2","level":"warning","message":{"text":"LlmBody::parse (cognitive 26): LlmBody::parse has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 7, match/switch 1 (3 pts), loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f03019180159808420fa01a72aaa87bdd4693a4fe56cd24974f3c18c0c53aa0"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectRuntimeCompiler::compile (cognitive 26): ProjectRuntimeCompiler::compile has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 5 (8 pts), loops 3, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_project/src/runtime_compile.rs"},"region":{"startLine":1660}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c2fb204fdcfbd954bca30fd2c427b56efe138c94861353850325f6d65a9fe1"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::open_instance (cognitive 26): Walker::open_instance has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 4 (10 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/json/encode.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b9b1aed94677a2796f48f15a0c55ddf8f62af257c48b0f7f2fb7b40778e5c2"}},{"ruleId":"D2","level":"warning","message":{"text":"EqualsDriver::compare_objects (cognitive 26): EqualsDriver::compare_objects has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (6 pts), match/switch 4 (6 pts), boolean chains 3 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/ops.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d3ac01d0e78d1dfd1e7e85f27aa351be960f4831075d1f67eb75985e60cda2"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_baml::root::deep_copy_value_recursive (cognitive 26): bex_vm::package_baml::root::deep_copy_value_recursive has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (9 pts), match/switch 2 (3 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/root.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc44d8c75595ead9ea3d2ef7def381b637fb1b200798e3259e3d5cec641febb"}},{"ruleId":"D2","level":"warning","message":{"text":"sys_native::installation::extract_archive (cognitive 26): sys_native::installation::extract_archive has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_native/src/installation.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8e6decadb39e5bbb39a71032649223a75efa97cba4a061a79ce91b591e798c"}},{"ruleId":"D2","level":"warning","message":{"text":"SseParser::feed (cognitive 26): SseParser::feed has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 2 (6 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_types/src/sse.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a189d2f55978404c46d11136486a1acb10272aad9b6120dd0608b547ec681e54"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_cpp::render_bindings (cognitive 26): sdkgen_cpp::render_bindings has cognitive complexity 26 (threshold 15). Drivers by points: loops 7 (16 pts), if/else 4 (9 pts), boolean chains 1 (nesting depth added 14). 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":"baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs"},"region":{"startLine":2635}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9b747805771d8fb8a4d18df638bb5456eda74136a1ceed406058ef3048472f"}},{"ruleId":"D2","level":"warning","message":{"text":"GoNames::allocate_unions (cognitive 26): GoNames::allocate_unions has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 5 (11 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/sdkgen_go/src/names.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7be46754576590dd2024fb5689ac952258e9a1a90d55386c289e72490b0f7e2"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_go::generated_functions (cognitive 26): sdkgen_go::generated_functions has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 7, loops 3 (5 pts), match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37d4c6a918595feb0d846fa15eeba157619798a7424dda6b010bdab6b9979b3"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_core::validate::generator_loader::v2::parse_generator (cognitive 26): internal_baml_core::validate::generator_loader::v2::parse_generator has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 11 (16 pts), if/else 5 (10 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/validate/generator_loader/v2.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddc641c4c8983ce42d2b44e6c88b6275eab6793560a39f2159cfa6307dff84b"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserDatabase::to_jinja_type (cognitive 26): ParserDatabase::to_jinja_type has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 3 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/parser-database/src/walkers/mod.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f9739c3af33f7f69ca058f04c037f1d4ddb106c78da439ed99446a7fa4bda9"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_runtime::internal::llm_client::orchestrator::call::orchestrate (cognitive 26): baml_runtime::internal::llm_client::orchestrator::call::orchestrate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 5 (10 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/orchestrator/call.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c62cf456bd1d35794e0be91549d7c48911e777f8c220fba6710583bdf257e3"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_runtime::tracing::threaded_tracer::redact_event (cognitive 26): baml_runtime::tracing::threaded_tracer::redact_event has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 4 (8 pts), loops 2 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/tracing/threaded_tracer.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"d091cf153aa95dbb54a92860548083e0dd3a20e0779e61f1afb43451bbd45d5a"}},{"ruleId":"D2","level":"warning","message":{"text":"ProtoReader.decodeClassWithDesc (cognitive 26): ProtoReader.decodeClassWithDesc has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (6 pts), loops 3 (5 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd397f663f578ef98eaeb5e1e8cc5746b6bac5c7950301381c623f6dbe95fdd"}},{"ruleId":"D2","level":"warning","message":{"text":"runner._save (cognitive 26): runner._save has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 5 (8 pts), ternaries 3 (7 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/src/speedtest/runner.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf5ec1dd049fea43bb1d7f4b61d0b609b7bbe2cdb4c72cb79c6e9999b42d2cf"}},{"ruleId":"D2","level":"warning","message":{"text":"bump-version.perform_version_bumps (cognitive 26): bump-version.perform_version_bumps has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 11 (23 pts), loops 1 (2 pts), if/else 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bump-version.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a5934256ed616b8a19eb73106dc986c3c2177eb06e1a17a44aac2ca19d28d2"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlWireDepth.ty (cognitive 26): BamlWireDepth.ty has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 12 (24 pts), if/else 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/Encode.swift"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c562d217ac4c47f2f7acb8235bd491e1cd93a087212b1c315b8769715e7af6"}},{"ruleId":"D2","level":"warning","message":{"text":"Tree.splay (cognitive 26): Tree.splay has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/memory/splay-2k/main.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad9e928f2dcadb9c6aa01f0b815dce4ecf8f0ee91b7a70b8529c4eccb1b06cc"}},{"ruleId":"D2","level":"warning","message":{"text":"Node.Node (cognitive 26): Node.Node has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 7 (11 pts), boolean chains 2, loops 1 (nesting depth added 10). Most of this is not in the body itself: 12 of the 26 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 47, 121, 71, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_components/Tree/Node.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc43e94b104739f2746908abf7483bcae4d699f472d4d26317a20d42771b8f48"}},{"ruleId":"D2","level":"warning","message":{"text":"bep-list.BepList (cognitive 26): bep-list.BepList has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 11 (20 pts), boolean chains 5, if/else 1 (nesting depth added 9). Of this number, 19 points are the body\u0027s own statements and 7 belong to 5 function items inside it that branch. 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":"typescript2/app-beps/src/components/bep/bep-list.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"96881202e4799d42e6ea3284eb468cbc03d9d111b8debf8702ae641ac5a75066"}},{"ruleId":"D2","level":"warning","message":{"text":"dictionary-types.classifyWideningTarget (cognitive 26): dictionary-types.classifyWideningTarget has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 6 (13 pts), if/else 11, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ac88879bc179f37617bb5462d30957c1d8ab0b755a6f0c2861deb7a1f1f9e5"}},{"ruleId":"D2","level":"warning","message":{"text":"render-part.RenderPart (cognitive 26): render-part.RenderPart has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), error handling 2 (5 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 10). Most of this is not in the body itself: 6 of the 26 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 16, a function literal at line 44, extractStringValues). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/render-part.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5cb43b954179fd0d759c61bb8fa841692f1d684f9953e529dfce49ec604e44"}},{"ruleId":"D2","level":"warning","message":{"text":"council-gate.Council (cognitive 26): council-gate.Council has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 7 (10 pts), if/else 8 (9 pts), boolean chains 5, error handling 2 (nesting depth added 4). Of this number, 13 points are the body\u0027s own statements and 13 belong to 3 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/sheep-council/council-gate.tsx"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"6329b52556d2f4bb009b7c3f7ff631939032b4b0616759efc5eff9f56afd6e3e"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseEdge.pathFromPoints (cognitive 26): BaseEdge.pathFromPoints has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 6 (16 pts), if/else 4 (6 pts), boolean chains 3, loops 1 (nesting depth added 12). Of this number, 23 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. 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":"typescript2/pkg-playground/src/graph/edges/BaseEdge.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"98aba670c26d0225397bcf8acda6d46910107824fea6f8f76bae096117068b2b"}},{"ruleId":"D2","level":"warning","message":{"text":"top-level statements (cognitive 25): top-level statements has cognitive complexity 25 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 5 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdk_tests/crates/csharp/host_callables/Program.cs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"80306d19cd991d41ff9536afcaf19a1bcadba3f0895fe39e41290bf038c30efe"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_builtins2_codegen::extract::extract_from_class (cognitive 25): baml_builtins2_codegen::extract::extract_from_class has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 3 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_builtins2_codegen/src/extract.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"60fbfec62beb35179c060df5353caf19c97b84680b855dada7151e6943519e33"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_emit::package::type_pass (cognitive 25): baml_compiler2_emit::package::type_pass has cognitive complexity 25 (threshold 15). Drivers by points: loops 12 (18 pts), if/else 2 (6 pts), boolean chains 1 (nesting depth added 10). 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":"baml_language/crates/baml_compiler2_emit/src/package/mod.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3a6bf997ca4991dd5b82315f360d9ef2acf8fe80d4a545a2e7b523cd2cdeaa"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::exhaustiveness::compute_exhaustiveness (cognitive 25): baml_compiler2_hir_ty::exhaustiveness::compute_exhaustiveness has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (7 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/exhaustiveness.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a9d5c75188d0dc509839a1fd33df58b04ae1a870f983df4bee46e170ff725a"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaCx::field_schema (cognitive 25): SchemaCx::field_schema has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 6 (11 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/param_schema.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ae36cf54b55cc2a415726028a7ca04fe532d42c9a0bfebb2f3b0bd286ba49a"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::cfg::merge_callee_graph_under_call_node (cognitive 25): baml_ide::cfg::merge_callee_graph_under_call_node has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 4 (5 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/cfg.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1f4533bb15399527115f0cd0b851bd98d88ad8db23caf82c747368eb207506"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::resolve::member_access_at (cognitive 25): baml_ide::resolve::member_access_at has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/resolve.rs"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"3192d4586640420e76cea901d5a38b614194e1722e583899ca438eeb525151cd"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_lsp::diagnostics::collect_root_candidate (cognitive 25): baml_lsp::diagnostics::collect_root_candidate has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 5 (7 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp/src/diagnostics.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ab5487a94ae55e30f10ec77637cafbc94811622bbb2829d594c66f4c639a39"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_lsp_server::read_lsp_message (cognitive 25): baml_lsp_server::read_lsp_message has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/lib.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b0e3882477771ab94e6cc12770f95494c619cdf356acf2c39494d241eeaad6"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_query_btel::ingest::context::resolve_with (cognitive 25): baml_query_btel::ingest::context::resolve_with has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (5 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/ingest/context.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afc324db79f3eccd2549a427112ec11df5590bab4146cd951bd36ac3d55c78a"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderDefinitionEquivalence::types_equivalent (cognitive 25): RenderDefinitionEquivalence::types_equivalent has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 10, if/else 4 (10 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/type_class.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84b0f6ff717325260463063af9a52dd2e41317b467873ce509725425c496413"}},{"ruleId":"D2","level":"warning","message":{"text":"TelemetryRuntime::write_span_with_context (cognitive 25): TelemetryRuntime::write_span_with_context has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 6, match/switch 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_processor/src/runtime.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2e0120776bb76c2394dfc8ea928144629ed140e21d46820a435995ed70948b"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::definition (cognitive 25): Renderer::definition has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (7 pts), match/switch 3 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_reader/src/value.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"10828c8e38208d6558c35dc8842353a5204de0a28409a9743816f2694453cef2"}},{"ruleId":"D2","level":"warning","message":{"text":"sys_auth::io_bridge::split_command (cognitive 25): sys_auth::io_bridge::split_command has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 4 (12 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_auth/src/io_bridge.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9289d44aacba0c3721ed5631130e0032e797c0d4396cf8f6a514e16155bce58f"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeSysOps::scan (cognitive 25): NativeSysOps::scan has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"50514ec26911cf2f6552f271801c4af36e5b7e35dc91ac5d8874c6e4b07908d1"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_go::collect_projected_codec_types (cognitive 25): sdkgen_go::collect_projected_codec_types has cognitive complexity 25 (threshold 15). Drivers by points: loops 6 (15 pts), if/else 4 (8 pts), boolean chains 1, match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ecbcf25e80df27709c3ccd0b04738ba6f1d14905abc9b09ddf495275bf97ca"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler::hir::lowering::type_ir_from_ast (cognitive 25): baml_compiler::hir::lowering::type_ir_from_ast has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 4 (6 pts), loops 1 (2 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/hir/lowering.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b458ab8e280bd77b450a38505ff4af460d8751e18f8fd46ff1ea3cad5298b9c8"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler::thir::typecheck::typecheck_returning_context (cognitive 25): baml_compiler::thir::typecheck::typecheck_returning_context has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 9 (11 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/thir/typecheck.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da2b1daeabb14179c62c91d46dfbabe3caef88dae90a377e249aa5e658e69e3"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_core::validate::validation_pipeline::validations::expr_fns::validate_expression (cognitive 25): internal_baml_core::validate::validation_pipeline::validations::expr_fns::validate_expression has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (8 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/expr_fns.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bca9ed71c02383cc552448910a43c97599219f7f4b86315343e8c68e9486ee4"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlValueWithFlags::fmt (cognitive 25): BamlValueWithFlags::fmt has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/deserializer/types.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"73215100f3c8a79174e618e162808e435019c2ceec53aa2492adb9737f18baf3"}},{"ruleId":"D2","level":"warning","message":{"text":"DuplicateNames::into_errors (cognitive 25): DuplicateNames::into_errors has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 7 (12 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/parser-database/src/names/mod.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58044ba78da09e83a6ece067dea33aaa09a40b3f70683cca390ce7481488e41"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlRuntime::get_llm_provider_impl (cognitive 25): BamlRuntime::get_llm_provider_impl has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/lib.rs"},"region":{"startLine":1874}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d032ecd68b70a8f6762e1ba670e0fa1460d66d1e00be655aa9f9fadc3402a65"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_runtime::internal::llm_client::primitive::stream_request::make_stream_request (cognitive 25): baml_runtime::internal::llm_client::primitive::stream_request::make_stream_request has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 7 (10 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/stream_request.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"361cd309a14b5e97fa834167e4ca6a82760f08183aad9a7726ba87f135e01746"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_runtime::optimize::tui::render_metadata_panel (cognitive 25): baml_runtime::optimize::tui::render_metadata_panel has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (8 pts), match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/tui.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb20325f69ad10cca2d956e3ed9534d05f1853f2d51e27a3d616bea4d81c1ed"}},{"ruleId":"D2","level":"warning","message":{"text":"generators_lib::version_check::check_version (cognitive 25): generators_lib::version_check::check_version has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 6 (12 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/utils/generators_lib/src/version_check.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea4431b24a0223662c45d687d3893c2d95e45d25d93aae96dc3b28b1b821f7d"}},{"ruleId":"D2","level":"warning","message":{"text":"ProtoWriter.naturalType (cognitive 25): ProtoWriter.naturalType has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18 (19 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoWriter.java"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"d472d02b2712c13d396f9b7b766e4cdad1c455ffcaa468594f5face0cd6a5bf3"}},{"ruleId":"D2","level":"warning","message":{"text":"proto.decode_call_result (cognitive 25): proto.decode_call_result has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), ternaries 2 (5 pts), boolean chains 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/src/baml_bridge/proto.py"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"335850848b95895593aea54cb405c2a061989464db33be972fff8e1807da9a08"}},{"ruleId":"D2","level":"warning","message":{"text":"Tree.splay (cognitive 25): Tree.splay has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/memory/splay-2k/main.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec99f8d4a23a682700f5ef945fa2653497664b7e05a75b725818af5615136f2b"}},{"ruleId":"D2","level":"warning","message":{"text":"notify.compose_handoff (cognitive 25): notify.compose_handoff has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (5 pts), ternaries 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bctl_src/oncall/notify.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"308d14a919b9b35fe94f3bcfc85752650284283b4df8bbd22f5d6d3fc48755a4"}},{"ruleId":"D2","level":"warning","message":{"text":"EmbedDialog.EmbedDialog (cognitive 25): EmbedDialog.EmbedDialog has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 9, error handling 1, ternaries 1 (nesting depth added 3). Most of this is not in the body itself: 7 of the 25 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 65, buildUrl, a function literal at line 62, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_components/EmbedDialog.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f54c12b711b3a4a2c6a3925e798a15f2193e0bb9b5ba9d9bf26190d55165a4"}},{"ruleId":"D2","level":"warning","message":{"text":"simple.getSimplePath (cognitive 25): simple.getSimplePath has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/edge/algorithms/simple.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6ac059d7cefd11e4fcf640655bc9b1f96243dfcf901c598917abc92b624aff"}},{"ruleId":"D2","level":"warning","message":{"text":"page.BcsComments (cognitive 25): page.BcsComments has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 9, ternaries 8 (9 pts), if/else 7 (nesting depth added 1). Most of this is not in the body itself: 7 of the 25 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 94, a function literal at line 43, link, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/comments/page.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a17d9e846975cefc904c733734a99847428c336492743574826cc8d0237273"}},{"ruleId":"D2","level":"warning","message":{"text":"pipeline.stageInfo (cognitive 25): pipeline.stageInfo has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 9 (13 pts), if/else 5 (7 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 7). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"typescript2/app-feedback/src/lib/pipeline.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1013bce076093abf326111a323baccfc5990c0404fa00b85f4bc28450f4b9cad"}},{"ruleId":"D2","level":"warning","message":{"text":"pinned.Looped (cognitive 25): pinned.Looped has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (16 pts), ternaries 5 (6 pts), boolean chains 3 (nesting depth added 4). Most of this is not in the body itself: 3 of the 25 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 243, 271, 232, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/pinned.tsx"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"1814efe2f1a3bc227b74e3d7e22358f6559dd51cc248d7c21c91469b70adf29e"}},{"ruleId":"D2","level":"warning","message":{"text":"index.searchSymbols (cognitive 25): index.searchSymbols has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 2 (7 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). Of this number, 19 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. 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":"typescript2/app-website/lib/baml-docs/index.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b108265303998f4a5e198ecbf8ee7675b8d3e83f311195cfda56f915c90cd02"}},{"ruleId":"D2","level":"warning","message":{"text":"luma-answers.readRegistrationAnswers (cognitive 25): luma-answers.readRegistrationAnswers has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/luma-answers.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e546fd71fa5f6ee8ea97f879117769f68a34fde1c8080fa22fe0515f5b102f7f"}},{"ruleId":"D2","level":"warning","message":{"text":"group-node.GroupNode (cognitive 25): group-node.GroupNode has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 17 (19 pts), boolean chains 6 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/graph/nodes/group-node.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b8d84332b7b02395b6bcd3f28608822eb56ff9b80e92067de74c0dfd3cd5a0"}},{"ruleId":"D2","level":"warning","message":{"text":"HostCallableProtocol.BindArguments (cognitive 24): HostCallableProtocol.BindArguments has cognitive complexity 24 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Proto/HostCallableProtocol.cs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd98afa9bb9e4c5f7893e07ea2bc862c8016d00c7efdeb9fd88f00215666931"}},{"ruleId":"D2","level":"warning","message":{"text":"GenerateArgs::run_generate (cognitive 24): GenerateArgs::run_generate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 4 (6 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/generate.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b472eeba92a961b05c1aa107d8ca29a7b3de4002bc31f35cb6ea9e4af0eb789"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_emit::collect_lambda_capture_infos (cognitive 24): baml_compiler2_emit::collect_lambda_capture_infos has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/lib.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"45465a85fb8bec2fcc32a7c8f07ad51410264da60717daa1f35cd9effa1ecac4"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::infer_exported_object (cognitive 24): InferenceContext::infer_exported_object has cognitive complexity 24 (threshold 15). Drivers by points: loops 9 (14 pts), if/else 7 (9 pts), match/switch 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":9819}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e47d293687b59b612135e37ac822f8acb1c11ec70e7c92aa31d20b4e422f90"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::try_solve_bounded_var (cognitive 24): InferenceContext::try_solve_bounded_var has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (6 pts), boolean chains 2, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":14586}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecec685e09aab8a304c81d0e09dc1f2390b03837c1222bdaf230daf841919e9"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::exhaustiveness::split_ctors (cognitive 24): baml_compiler2_hir_ty::exhaustiveness::split_ctors has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/exhaustiveness.rs"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15477b456464e876ce6d61c4234d070185027e2b0d18eeb5af150a8a29de2dd"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::interfaces::resolve_through_roots (cognitive 24): baml_compiler2_hir_ty::interfaces::resolve_through_roots has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs"},"region":{"startLine":2369}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f8a24ddab15727e401bdcefbf418cd5ffb842a5d8c8be30ee58d80ecd9da19"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::method_resolution::lookup_interface_member (cognitive 24): baml_compiler2_hir_ty::method_resolution::lookup_interface_member has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/method_resolution.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"aacb7fdc929d00bc47b4645089e67019aaca7161575cd201a706116996e225f3"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::method_resolution::member_candidates (cognitive 24): baml_compiler2_hir_ty::method_resolution::member_candidates has cognitive complexity 24 (threshold 15). Drivers by points: loops 8 (17 pts), if/else 3 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/method_resolution.rs"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"89082ffe6088710b1eaa1ff762124c78155e60dc6abefecd054af6827e9c614e"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_visualization::control_flow::flatten::hoist_branch_arms (cognitive 24): baml_compiler2_visualization::control_flow::flatten::hoist_branch_arms has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 5 (12 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f132edaba940341dc75373d296d0b60ebe4bca38218a836e9dff209c6cf431"}},{"ruleId":"D2","level":"warning","message":{"text":"Translator::column (cognitive 24): Translator::column has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/sql.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb880df4200444fac0e23be6765d8a80f589b7b1c70ac52c00bfe18db7d75333"}},{"ruleId":"D2","level":"warning","message":{"text":"BexEngine::convert_heap_ptr_to_external_with_type (cognitive 24): BexEngine::convert_heap_ptr_to_external_with_type has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 7 (15 pts), if/else 4 (8 pts), boolean chains 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/conversion.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc5f81b162133cab397d747794b0fabcc83fb750674118f2bc18346133159f1"}},{"ruleId":"D2","level":"warning","message":{"text":"BexEngine::check_type_arg_bounds (cognitive 24): BexEngine::check_type_arg_bounds has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (6 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":3891}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6ac8a94c4cb3ac87bfa1546491bd9a34571758242de7c30aa04705ed85a50e"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_engine::conversion::find_matching_member (cognitive 24): bex_engine::conversion::find_matching_member has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, loops 5, match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/conversion.rs"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5cdf3c0c0398236baf0b59b5c2cb0ce38ff67b6c8ba9c63240db502d11ff749"}},{"ruleId":"D2","level":"warning","message":{"text":"Decoder::walk (cognitive 24): Decoder::walk has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 3 (7 pts), loops 3 (7 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/json/decode.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a660ec49c166c4c7fa5c737ea22180621f36249e471ba8bf870a3c06d164c39"}},{"ruleId":"D2","level":"warning","message":{"text":"Structural::decode (cognitive 24): Structural::decode has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 9 (17 pts), if/else 4 (7 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"baml_language/crates/bex_vm/src/package_baml/json/decode.rs"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd7c40bdf3ed5f14b53e9f53e0fa72da6c185ee9a6eabc191c9e2021d485fbf"}},{"ruleId":"D2","level":"warning","message":{"text":"ImplResolver::match_template (cognitive 24): ImplResolver::match_template has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 9 (17 pts), boolean chains 6, if/else 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/resolve.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1792fd97536e35606553e415877286fe255c2c9a11c45c7e2655d6bfbbce6f"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::debug::display_instruction_textual (cognitive 24): bex_vm::debug::display_instruction_textual has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (7 pts), loops 1 (3 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/debug.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ad1ea4a48af4db8210abd4d2d1c1a0a91fe861e1d5a2792e6f6d57b96e9d3d"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_baml::json::decode::decode_one (cognitive 24): bex_vm::package_baml::json::decode::decode_one has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 4 (8 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/json/decode.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ed61787d5372c404eb226d4ca702fbb6f98ed26bf5518e1ad08ae5b720889d"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm_types::types::box_compile_time_floats (cognitive 24): bex_vm_types::types::box_compile_time_floats has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 6 (10 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm_types/src/types.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6dcb431b436e1745537c04882519f02b257c93694aac1a8b316cab736ad75fb"}},{"ruleId":"D2","level":"warning","message":{"text":"btel_reader::value::step (cognitive 24): btel_reader::value::step has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 5 (10 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_reader/src/value.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1378c6706040c5a00b6f4eb6b2ff5380632aeb9d58d052fb9abccf66cc133fb"}},{"ruleId":"D2","level":"warning","message":{"text":"sys_native::http_server::serve (cognitive 24): sys_native::http_server::serve has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 7 (18 pts), loops 2 (3 pts), if/else 2, boolean chains 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_native/src/http_server.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a271f90a078382cff820250414536c518110a768368596544fc167f1013f05"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonNames::allocate_leaf_bindings (cognitive 24): PythonNames::allocate_leaf_bindings has cognitive complexity 24 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 5 (9 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/names.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b63f4c836d2c7434855e19686f07c20e2aaba94ebe442d93012740ed8759a89"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_python_pydantic2::to_source_code_internal (cognitive 24): sdkgen_python_pydantic2::to_source_code_internal has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 6 (7 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/lib.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02d4d93e0e64356f35de636e0ed10b1bda73aeb8119d43fb57b6e63fcf77461"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_rust::emit::union::emit (cognitive 24): sdkgen_rust::emit::union::emit has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/rust/sdkgen_rust/src/emit/union.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdc2be4c837acbe93e298e4e7a1eeecef7e8f768bae26e62e39d3895dfadaf5"}},{"ruleId":"D2","level":"warning","message":{"text":"PredefinedTypes::check_function_args (cognitive 24): PredefinedTypes::check_function_args has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jinja/src/evaluate_type/types.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5eb209ca0e4868849695fadc9658c772b788e4ffadc44cc4c38ac6af681910"}},{"ruleId":"D2","level":"warning","message":{"text":"jsonish::deserializer::coercer::coerce_union::try_cast_union (cognitive 24): jsonish::deserializer::coercer::coerce_union::try_cast_union has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 3 (4 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/deserializer/coercer/coerce_union.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bd586914af34ff05c0cc4df98dd3329e37600bc5f679e337060715e0d03c8c"}},{"ruleId":"D2","level":"warning","message":{"text":"UnresolvedAwsBedrock::create_from (cognitive 24): UnresolvedAwsBedrock::create_from has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 8 (20 pts), if/else 2, loops 1 (2 pts) (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/llm-client/src/clients/aws_bedrock.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a21bcb18769f8d5c770d1de6832fca085110b2cba6fc758cdf62495474f082"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_runtime::control_flow::flatten::step2_hoist_branch_arms::hoist_branch_arms (cognitive 24): baml_runtime::control_flow::flatten::step2_hoist_branch_arms::hoist_branch_arms has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 5 (12 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/control_flow/flatten/step2_hoist_branch_arms.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f149ee3b954d2e160740b774f023018d7f6df8554f128a5824ed686542eb6364"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_runtime::optimize::evaluator::failure_location (cognitive 24): baml_runtime::optimize::evaluator::failure_location has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 3 (9 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/evaluator.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5eaa855e8908bda071087215f584b98ce201a70c9a17dc9267b753f714bdd1e"}},{"ruleId":"D2","level":"warning","message":{"text":"_invocation.normalize (cognitive 24): _invocation.normalize has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/src/baml_bridge/_invocation.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c31853720810bbeec88dc4617509b4a6b5063def73eb0752a380986b7cd4978"}},{"ruleId":"D2","level":"warning","message":{"text":"runner.print_table (cognitive 24): runner.print_table has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 6 (15 pts), if/else 3 (4 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/src/speedtest/runner.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66b1de924b9452c987760c825f4dbdf96805d7d591c8a17120b4501fa3130d8"}},{"ruleId":"D2","level":"warning","message":{"text":"schedule.fill_horizon (cognitive 24): schedule.fill_horizon has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 5 (8 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bctl_src/oncall/schedule.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"200fa6e494d45460dce54fdf177a70fcdf613492e25e91ea9930893a36dea54f"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_go.resolveManifestArtifact (cognitive 24): baml_go.resolveManifestArtifact has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/runtime_artifact.go"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea3d7d568bc44badec4d0ccf061378657228f21b1c10c53568f928ccbf4eaba"}},{"ruleId":"D2","level":"warning","message":{"text":"elk-geometry.intersection (cognitive 24): elk-geometry.intersection has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 6 (11 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/node/algorithms/elk-geometry.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9bb04904150eb8850b878477c110506e185bb78ad05790b27b206b2e0541af3"}},{"ruleId":"D2","level":"warning","message":{"text":"index.LLMNode (cognitive 24): index.LLMNode has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 12 (13 pts), boolean chains 7, if/else 4 (nesting depth added 1). Most of this is not in the body itself: 8 of the 24 points are its own statements and the rest belongs to 4 function items inside it that branch (getOutputPreview, getStateStyle, a function literal at line 156, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/nodes/LLMNode/index.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d88588f08aa31fb3ad6bc84ec1ef31631a1713ddb75506d309540e4d71c362"}},{"ruleId":"D2","level":"warning","message":{"text":"graph-view.GraphView (cognitive 24): graph-view.GraphView has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 6, ternaries 5 (nesting depth added 1). Most of this is not in the body itself: 6 of the 24 points are its own statements and the rest belongs to 10 function items inside it that branch (a function literal at line 212, a function literal at line 95, a function literal at line 100, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/graph-view.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"31210dbe1cd4e17bb8e95847ee8f51119f7b776223f6fe0400b1d4e363768517"}},{"ruleId":"D2","level":"warning","message":{"text":"prompts.buildAIAssistantPrompt (cognitive 24): prompts.buildAIAssistantPrompt has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 9, if/else 9, ternaries 6. Of this number, 12 points are the body\u0027s own statements and 12 belong to 7 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/lib/prompts.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1f3146e4cb3e020a0722a9cd43273540a2e97f88d759377f76ed9fa61fbb32"}},{"ruleId":"D2","level":"warning","message":{"text":"reader.BcsReader (cognitive 24): reader.BcsReader has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 5 (10 pts), boolean chains 9, if/else 3 (4 pts), loops 1 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 8 belong to 5 function items inside it that branch. 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":"typescript2/app-beps/src/app/bcs/[number]/reader.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8e3e393d884adf11526f26f04b275f22c29d84b0149639badf97e672a7fa98"}},{"ruleId":"D2","level":"warning","message":{"text":"bcs-render.adjust (cognitive 24): bcs-render.adjust has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4, loops 2 (4 pts), ternaries 1 (nesting depth added 7). None of this is in the body itself: all 24 points belong to 2 function items inside it that branch (a function literal at line 141, collect). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/bcs-render.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"3438cdf49b951cff29b186e7a1c9191b3667d7c50bac6fd2047be5c0a7feb5b6"}},{"ruleId":"D2","level":"warning","message":{"text":"export-utils.generateSummariesMd (cognitive 24): export-utils.generateSummariesMd has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 4 (14 pts), if/else 3 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/export-utils.ts"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfc7918a323af7c7e289aa7f22a23d1530b9d1a05ce4fe366325836eb245dc2"}},{"ruleId":"D2","level":"warning","message":{"text":"dictionary-types.classifyAliasBroadTarget (cognitive 24): dictionary-types.classifyAliasBroadTarget has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11, ternaries 5 (10 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba1756c2dc7e751971d7aa66ad0aa902242a4e43f3c7af2e1259eb943c3f890"}},{"ruleId":"D2","level":"warning","message":{"text":"code-mirror-viewer.CodeMirrorViewer (cognitive 24): code-mirror-viewer.CodeMirrorViewer has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 3, error handling 2 (3 pts), loops 1 (2 pts), ternaries 1 (nesting depth added 6). None of this is in the body itself: all 24 points belong to 7 function literals inside it that branch (lines 137, 111, 265, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/codemirror-panel/code-mirror-viewer.tsx"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8efc27d85195a1ff14c4fff5e1ce7a88aeeda931e411aca9aa2d979a7696af6"}},{"ruleId":"D2","level":"warning","message":{"text":"tracker.Tracker (cognitive 24): tracker.Tracker has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 18, ternaries 4, if/else 2. Of this number, 20 points are the body\u0027s own statements and 4 belong to 6 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/tracker.tsx"},"region":{"startLine":2254}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e539a130f2aa7d977742e57c6a1ac94d60bde34298cbe4e5c53943beb398a78"}},{"ruleId":"D2","level":"warning","message":{"text":"path (cognitive 24): path has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (7 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/json-tree-path/main.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b25867bf4248c3d0b5330f2a73985d1522c512a2c3a5675ed8c3a13278b21e"}},{"ruleId":"D2","level":"warning","message":{"text":"StackifyCodegen::emit_rvalue_pull (cognitive 23): StackifyCodegen::emit_rvalue_pull has cognitive complexity 23 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 8 (10 pts), match/switch 1 (2 pts) (nesting depth added 9). 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":"baml_language/crates/baml_compiler2_emit/src/emit.rs"},"region":{"startLine":1801}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde13bd791dfa4da5ec0d206310ef7778aa0d27720c6aac1270400bd611ea03f"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_emit::analysis::is_return_phi (cognitive 23): baml_compiler2_emit::analysis::is_return_phi has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 4 (8 pts), loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/analysis.rs"},"region":{"startLine":1785}}}],"partialFingerprints":{"codehealthFindingId/v1":"8702119c7b67350111f9f6e5bf4d748ce82ca3b3d47428a189528ac911b2659a"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir::resolve::resolve_name_at_in_scope (cognitive 23): baml_compiler2_hir::resolve::resolve_name_at_in_scope has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir/src/resolve.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db2bfb3ec5bea52a37bb4f105f7aaa0a853fef79c65d87234a7ea1e5ff83b7f"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::check_template_interps_strict (cognitive 23): InferenceContext::check_template_interps_strict has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":11919}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f7ef1cc7da3331567f6d3e18b9963a8e4cee225996b228c53f7a6bd8bfe1e9"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::impls::impls_for_type_cached (cognitive 23): baml_compiler2_hir_ty::impls::impls_for_type_cached has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/impls.rs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b3c805d55883bc67bb101fae8f754eef96d7135ae0e2309d626f6289565be8"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::interfaces::match_ty_pattern_into (cognitive 23): baml_compiler2_hir_ty::interfaces::match_ty_pattern_into has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (8 pts), boolean chains 6, 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":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"363186bffc11e9e459e33fe538060077e509aecf07f081b9cb762fbfd9f875c7"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_mir::optimize::reorder_blocks_rpo (cognitive 23): baml_compiler2_mir::optimize::reorder_blocks_rpo has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 6 (8 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/optimize.rs"},"region":{"startLine":2399}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5fc9b79dd53b8ef3b1a09db02f20e713ae8e5fa9bad274de0f208e9b1ae450"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_rust::init::generate (cognitive 23): baml_compiler2_rust::init::generate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_rust/src/init.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ac2c3a070d658cc9ead8c8f23837c5f93b0f070053ef92fe97f04296e67b27"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::resolve::object_literal_at (cognitive 23): baml_ide::resolve::object_literal_at has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/resolve.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee6218da007b0b6a8ade1c5b5cf88bad89a1ae4418c5f79419f943046131c69"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::resolve::template_driver_at (cognitive 23): baml_ide::resolve::template_driver_at has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/resolve.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fecb20429c536a444240dc2820f7fbfcaec9e24a7c7b2391ecdedc3fe3b024b"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::resolve::declaration_name_at (cognitive 23): baml_ide::resolve::declaration_name_at has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 5 (7 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/resolve.rs"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"9adb669feeb5a79ff371f236efaa001961f3b4f6bf543f612fab89fd1b234afb"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::search::ranked_candidates (cognitive 23): baml_ide::search::ranked_candidates has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (15 pts), if/else 1 (4 pts), match/switch 1 (4 pts) (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":"baml_language/crates/baml_ide/src/search.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a971dd8808c552763345ab41c044721c74b5bb71a4bc17ae18f23935d4b4c97"}},{"ruleId":"D2","level":"warning","message":{"text":"Assembler::fill_impl_rules (cognitive 23): Assembler::fill_impl_rules has cognitive complexity 23 (threshold 15). Drivers by points: loops 8 (18 pts), if/else 2 (5 pts) (nesting depth added 13). 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":"baml_language/crates/baml_linker/src/assemble.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bcf5d47efec0a3852f47ee34d4330cf4b6ef3620048f2067510279d5ad567e"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_type_runtime::solve_var (cognitive 23): baml_type_runtime::solve_var has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 4 (6 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type_runtime/src/lib.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ef59c9035d6e5e7ff94b6efc3aa6b78da6d81f7fe5c9a366354e2477e9b6ca"}},{"ruleId":"D2","level":"warning","message":{"text":"BexHeap::scan_unhandled_spawn_errors (cognitive 23): BexHeap::scan_unhandled_spawn_errors has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_heap/src/gc.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c7044daada9a919e0e08c472ac435ee4f20dacf107f205f2a59093687ca01b"}},{"ruleId":"D2","level":"warning","message":{"text":"Scratch::add (cognitive 23): Scratch::add has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 5 (9 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/telemetry/snapshot.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8061be249a3981f6b84b05d7c092e329d57d09dadb429065069a2a8523fa666"}},{"ruleId":"D2","level":"warning","message":{"text":"BexVm::finish_trace_hook_config (cognitive 23): BexVm::finish_trace_hook_config has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":2695}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98970435b1fe439be53a8fcb7ca96d5a71d565f42f40e873ece0b0604409715"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_reflect::runtime_class_builder::planned_pending_type (cognitive 23): bex_vm::package_reflect::runtime_class_builder::planned_pending_type has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e61e95762e4ba7a5f2ef1e486916f9a43b5bcf53d1ce92c91123164c7e02c9"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_reflect::runtime_class_builder::resolve_pending_if_ready (cognitive 23): bex_vm::package_reflect::runtime_class_builder::resolve_pending_if_ready has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 3 (6 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5790143cf0760b71d3a27118a8b797de63a7463e3665113ba5175ec558813e2"}},{"ruleId":"D2","level":"warning","message":{"text":"bridge_wasm::wasm_http::sse_background_task (cognitive 23): bridge_wasm::wasm_http::sse_background_task has cognitive complexity 23 (threshold 15). Drivers by points: if/else 2 (8 pts), match/switch 3 (8 pts), loops 3 (7 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_wasm/src/wasm_http.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56f8622e15029ae2583bf604d0f4bb6103e8ad6601ca0131671c0553b84dd5b"}},{"ruleId":"D2","level":"warning","message":{"text":"bridge_wasm::wasm_io_glob::collect_scan_paths (cognitive 23): bridge_wasm::wasm_io_glob::collect_scan_paths has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_wasm/src/wasm_io_glob.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"c059aef400369a13e5e587d26e15e393a3f683fc247464ffb91b71e7d55a50d1"}},{"ruleId":"D2","level":"warning","message":{"text":"btel_bcs::delivery::assemble (cognitive 23): btel_bcs::delivery::assemble has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 5 (7 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_bcs/src/delivery.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc275013ad690dba530ade1d38da456ed0d5d95e2f9a7827af9b7724b6d3e9b3"}},{"ruleId":"D2","level":"warning","message":{"text":"btel_snapshot::decode::decode (cognitive 23): btel_snapshot::decode::decode has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (18 pts), loops 3, match/switch 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_snapshot/src/decode.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6c86a92ea94dde82ce5f956d572851c49ed57c06953fe2ba1c02eddbc85242"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_cpp::render_codecs (cognitive 23): sdkgen_cpp::render_codecs has cognitive complexity 23 (threshold 15). Drivers by points: loops 8 (14 pts), if/else 4 (7 pts), match/switch 1 (2 pts) (nesting depth added 10). 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":"baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs"},"region":{"startLine":2432}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a9f11ea41a1b582120e9c00c83341596eeb38e5ea0a08654c540de89568666"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_ast::parser::parse_type_builder_block::parse_type_builder_contents (cognitive 23): internal_baml_ast::parser::parse_type_builder_block::parse_type_builder_contents has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 4 (14 pts), if/else 1 (5 pts), loops 2 (4 pts) (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/parser/parse_type_builder_block.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"52cadaac6a93a51f4f7023b42d5c450080bdcbdaa0adeab3f61d5bff7a8f6e1a"}},{"ruleId":"D2","level":"warning","message":{"text":"jsonish::deserializer::coercer::coerce_map::coerce_map (cognitive 23): jsonish::deserializer::coercer::coerce_map::coerce_map has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 4 (8 pts), loops 2 (4 pts) (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/deserializer/coercer/coerce_map.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db7df9cc47aa96ae2d9eb14079af17f311333e334dbe64dfc2c3c988726443a"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_parser_database::types::visit_client (cognitive 23): internal_baml_parser_database::types::visit_client has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 10 (20 pts), loops 1 (3 pts) (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/parser-database/src/types/mod.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d43dcbc5c0c189b23b3a1baac0faeebf7d8be560af5ce47994395e94ab52eaf"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_runtime::cli::init::generate_main_baml_content (cognitive 23): baml_runtime::cli::init::generate_main_baml_content has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 4 (6 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/cli/init.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e267f05a3947dca32afb36043adc12d7f3cdf311f36bb938bbff5d10b63ee69"}},{"ruleId":"D2","level":"warning","message":{"text":"generators_rust::ir_to_rust::type_to_rust (cognitive 23): generators_rust::ir_to_rust::type_to_rust has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/rust/src/ir_to_rust/mod.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd86a7ec37efb3db8f02fe875aa053dbb05c0412008a2b9168a9df7d3234dc7"}},{"ruleId":"D2","level":"warning","message":{"text":"HotReloader::run (cognitive 23): HotReloader::run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/tools/src/bin/language-server-hot-reload.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef89717dd502a8b3b927bc8bb9ad49e2f68bff27784de8cbeeac086488fb7fbb"}},{"ruleId":"D2","level":"warning","message":{"text":"proto.decode_value (cognitive 23): proto.decode_value has cognitive complexity 23 (threshold 15). Drivers by points: if/else 18 (19 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/src/baml_bridge/proto.py"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"7995290f5db22eb533650b49e527591fc7a7f389a5b6814d39627234e97148a9"}},{"ruleId":"D2","level":"warning","message":{"text":"main.path (cognitive 23): main.path has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/json-tree-path/main.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf73739249bfef65b304b9dc9620be34f148ca889bd6a029cb1eb1840a32201"}},{"ruleId":"D2","level":"warning","message":{"text":"telemetry_resources.run_case (cognitive 23): telemetry_resources.run_case has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 8, ternaries 8, if/else 6, loops 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/scripts/telemetry_resources.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1d01420002dfca52064148fdec2fcdc48c8589a4ac51b132cabd8bdd608183"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_go.outboundFailureIdentity (cognitive 23): baml_go.outboundFailureIdentity has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/runtime.go"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"f021138ae0bbad1d99ab4b877c4fe9eed27173f16d84b17bc9870b22a4137182"}},{"ruleId":"D2","level":"warning","message":{"text":"serde.typeToString (cognitive 23): serde.typeToString has cognitive complexity 23 (threshold 15). Drivers by points: if/else 19 (21 pts), match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/baml_go/serde/decode.go"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fd4c56184a3d19de480de56719fa58bde4d32dcc0799cb6dbce2c144cbf840"}},{"ruleId":"D2","level":"warning","message":{"text":"index.BaseNode (cognitive 23): index.BaseNode has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 13 (16 pts), boolean chains 5, if/else 2 (nesting depth added 3). Of this number, 14 points are the body\u0027s own statements and 9 belong to 3 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/nodes/BaseNode/index.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa950d842b32382948ee42998ddd3ab49398226297b30c95acdd92d80ccce77e"}},{"ruleId":"D2","level":"warning","message":{"text":"export-all-utils.generateClaudeMd (cognitive 23): export-all-utils.generateClaudeMd has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 4 (11 pts), loops 4 (5 pts), if/else 2 (4 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/export-all-utils.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"21cd1dad65544409342f27d158e4b309ec4f351968915471c3c060638aa64270"}},{"ruleId":"D2","level":"warning","message":{"text":"generated-reference.GeneratedReferenceContent (cognitive 23): generated-reference.GeneratedReferenceContent has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 14 (21 pts), boolean chains 1, if/else 1 (nesting depth added 7). Of this number, 13 points are the body\u0027s own statements and 10 belong to one function literal inside it that branches. 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":"typescript2/app-developer-docs/components/generated-reference.tsx"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7e3feadac8cb2335f9ac202e5afc6e2bdc385a8b3756ed4bd71e6dc7f54ab6"}},{"ruleId":"D2","level":"warning","message":{"text":"signup-form.SignupForm (cognitive 23): signup-form.SignupForm has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 18, ternaries 3, if/else 2. Of this number, 21 points are the body\u0027s own statements and 2 belong to 4 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/eap/signup-form.tsx"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f10c11ce9f3e4ed6a7192250ff678d64353151f859a3b23397ad6a9a221b31"}},{"ruleId":"D2","level":"warning","message":{"text":"hyperobs.ChatMessage (cognitive 23): hyperobs.ChatMessage has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 9 (13 pts), boolean chains 9, if/else 1 (nesting depth added 4). 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":"typescript2/app-website/components/home/hyperobs.tsx"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f99690a98da59f4cc1136df250754041ed01add739b1599dd9981fdaa2dc25"}},{"ruleId":"D2","level":"warning","message":{"text":"evidence.reparentToRetainedAncestors (cognitive 23): evidence.reparentToRetainedAncestors has cognitive complexity 23 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 4 (7 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 7). Of this number, 21 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. 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":"typescript2/pkg-playground/src/telemetry/evidence.ts"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49f675999532a776a1e49baa1764c8911f20c46c951ccb74415c9b03296ad07"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlGeneratedRegistry.CreateCanonicalType (cognitive 22): BamlGeneratedRegistry.CreateCanonicalType has cognitive complexity 22 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedRegistry.cs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"060a6597dfb914bacc33d53dccce7f3ff70e177cafe20626fa0652094c32c44c"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_builtins2_codegen::codegen::emit_namespace_trait (cognitive 22): baml_builtins2_codegen::codegen::emit_namespace_trait has cognitive complexity 22 (threshold 15). Drivers by points: loops 8 (14 pts), if/else 6 (7 pts), boolean chains 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_builtins2_codegen/src/codegen.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"c930225cb707bc0cc0a6ce719027e67d6cd3e275cd90e8adf27f93f734e6efac"}},{"ruleId":"D2","level":"warning","message":{"text":"FormatArgs::run (cognitive 22): FormatArgs::run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (16 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/format.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"0202f9e7af42fcbac4d195eeb858edc775626c7fcf1a602fa081b90752650483"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_emit::compute_function_metadata (cognitive 22): baml_compiler2_emit::compute_function_metadata has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (16 pts), match/switch 5, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/lib.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a05be5bb21a8caee15295d52d4834aedef06f066a4a183952f7b3d9e86b6196"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::sub_residue (cognitive 22): InferenceContext::sub_residue has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (6 pts), loops 2 (6 pts), match/switch 2 (6 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":4874}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11d83a29d16c6123d1784d466f5b62c84323fc8ab18fa81cf5f601b3ccd003a"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::coherence::cover_search (cognitive 22): baml_compiler2_hir_ty::coherence::cover_search has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (4 pts), match/switch 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9efa2543ec5469e612f2df1a6a5ba763409a0664156034c60d29eba51cb150d"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::impls::bounds_hold (cognitive 22): baml_compiler2_hir_ty::impls::bounds_hold has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/impls.rs"},"region":{"startLine":2399}}}],"partialFingerprints":{"codehealthFindingId/v1":"81230aa3da08bf076af4efa3ef65b19effe5887503c9bf9628e7a2749386a85a"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_lsp_server::run_stdio_loop (cognitive 22): baml_lsp_server::run_stdio_loop has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (8 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/lib.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d75fd546f86248692974208a9cd98d7fdddc7d4961d1a57632ce62ddc1f4fb7"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_lsp_server::playground_server::spawn_disk_watcher (cognitive 22): baml_lsp_server::playground_server::spawn_disk_watcher has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 3 (5 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfa9de832abc78c502a2cf9860ee76f8ad42400ef65fb5f087b0d843749e72b"}},{"ruleId":"D2","level":"warning","message":{"text":"Translator::query (cognitive 22): Translator::query has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 2 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/sql.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b04192a9adf227668e8d5f72cdbf6a024aa082bb821a0e13acfe8adb538d38"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_syntax::lexer::lex (cognitive 22): baml_syntax::lexer::lex has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_syntax/src/lexer.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf588a7632e63cc0e6ac834a990450f8eec1c8fecb57e08095810dc8ae6c1fd"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_type::unify::cover_search (cognitive 22): baml_type::unify::cover_search has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (4 pts), match/switch 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/unify.rs"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d2661f71e06292ec44fb5104fe70dfcef9059bb423572b634cd9df0298c36d"}},{"ruleId":"D2","level":"warning","message":{"text":"bcs_api::telemetry::send_control (cognitive 22): bcs_api::telemetry::send_control has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bcs_api/src/telemetry.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"82074b6b975151cd22da252434f18b1f4b610f9d2ce16bc3ba0d4f4a2f01bf22"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_sap::jsonish::parser::dedent::dedent (cognitive 22): bex_sap::jsonish::parser::dedent::dedent has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/dedent.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5e3ae62e6f4c58f0db614f2f3eddbbc8fc9145cd323bd382b05c6c01669180"}},{"ruleId":"D2","level":"warning","message":{"text":"MapDriver::drive (cognitive 22): MapDriver::drive has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 4 (10 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/map.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e7cbc7fb9ced14e4ffea3d4f5a23a6b7e91b4ca892f041107d2a9edebc715c"}},{"ruleId":"D2","level":"warning","message":{"text":"EqualsDriver::drive (cognitive 22): EqualsDriver::drive has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (19 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/ops.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c6c23f32b0e84896ad9de2a2039437c80a04dc2b0fcf1668d60a812734abaf"}},{"ruleId":"D2","level":"warning","message":{"text":"BexVm::cmpop_values (cognitive 22): BexVm::cmpop_values has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 9 (15 pts), if/else 5, boolean chains 2 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":8973}}}],"partialFingerprints":{"codehealthFindingId/v1":"d536f1ac3355ebd60706288e40426ded79fa02a2067469a53ab9a61260e0eee9"}},{"ruleId":"D2","level":"warning","message":{"text":"btel_reader::value::equality::general_maps_equal (cognitive 22): btel_reader::value::equality::general_maps_equal has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 3 (10 pts), if/else 4 (9 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_reader/src/value/equality.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"970fbeaa7cdbc5c86a09d576b28f1b34fc1c93e76aa8ebbad7615fe781a550a0"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_size_gate::measure::resolve_lib_name (cognitive 22): cargo_size_gate::measure::resolve_lib_name has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 2 (5 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/tools_size_gate/src/measure.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2a7aa6dab5f63f26f675685de31ae9b7323a4491d4d0608f34d0888a2cb1f9"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::load (cognitive 22): Config::load has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (22 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54b63a2c77c772129bb66e7397be8b1ce85edd5d1a6e8c38c618e9caebbaa06"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_csharp::semantic::encode_type_metadata (cognitive 22): sdkgen_csharp::semantic::encode_type_metadata has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 4 (8 pts), loops 3 (7 pts), if/else 3 (6 pts), boolean chains 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":4625}}}],"partialFingerprints":{"codehealthFindingId/v1":"0459b30f4ccb50e0e0850313842d7229ac62a6d1a1f43ec29952930cbaeb9c01"}},{"ruleId":"D2","level":"warning","message":{"text":"GoNames::allocate_callback_options (cognitive 22): GoNames::allocate_callback_options has cognitive complexity 22 (threshold 15). Drivers by points: loops 8 (17 pts), if/else 1 (4 pts), boolean chains 1 (nesting depth added 12). 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":"baml_language/sdks/go/sdkgen_go/src/names.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc35e5bc3f6c12eee68c44e0345bff01afc4c377e399d8262343c9492d644294"}},{"ruleId":"D2","level":"warning","message":{"text":"GoPackages::for_pool_with_interfaces (cognitive 22): GoPackages::for_pool_with_interfaces has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/sdkgen_go/src/packages.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6877f07daa2a162b8ef709b73b78e855c69b99c6540c1ca4e3df96244f6fb4"}},{"ruleId":"D2","level":"warning","message":{"text":"Expression::repr (cognitive 22): Expression::repr has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 5 (10 pts), loops 1 (2 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/ir/repr.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"361cf0a862d75ad1182df909f3987999614d30bf354a0c6cb955c19b321392d8"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionMetadata::analyze_expression (cognitive 22): FunctionMetadata::analyze_expression has cognitive complexity 22 (threshold 15). Drivers by points: loops 7 (14 pts), match/switch 3 (6 pts), if/else 1 (2 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/watch.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"5553cc2807b7e668d485602b176fd36b8cf015c3d0b6679a30ed6afd81367d43"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler::hir::lowering::extract_watch_options_fields (cognitive 22): baml_compiler::hir::lowering::extract_watch_options_fields has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (9 pts), loops 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/hir/lowering.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb4472e8189f0bb5648921f9adcb392e710778f2fb2ce789890570f1e54c286"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler::thir::interpret::parse_json_to_baml_value (cognitive 22): baml_compiler::thir::interpret::parse_json_to_baml_value has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 5 (10 pts), match/switch 2 (nesting depth added 8). None of this is in the body itself: all 22 points belong to 2 function items inside it that branch (json_to_baml, json_to_baml_inferred). 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":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":2589}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0868fc0a4d253b2c603151371b7d4d5ae83c29eeab69371fdcbe44e5be69a53"}},{"ruleId":"D2","level":"warning","message":{"text":"HeaderCollector::build_index (cognitive 22): HeaderCollector::build_index has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/baml_vis/header_collector.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d910ecbeaa8e4a53e75194cbbbdbb79f3462b5401989ed0eceb2cd28291756"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_core::validate::validation_pipeline::validations::template_strings::validate (cognitive 22): internal_baml_core::validate::validation_pipeline::validations::template_strings::validate has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 3 (7 pts), loops 3 (5 pts) (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/template_strings.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"50cb0e9204cbb6cd5705a94d15a51f7623231189e792226a716ecfacd2500294"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeGeneric::simplify (cognitive 22): TypeGeneric::simplify has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-types/src/ir_type/simplify/ir.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d1ed8dcd76b1e8e9b46896a53f4a47cecadc7389f884e507172abe54ae872b"}},{"ruleId":"D2","level":"warning","message":{"text":"Class::try_cast (cognitive 22): Class::try_cast has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/deserializer/coercer/ir_ref/coerce_class.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a29a844796deb2f6c1f939c6cbc33ca14f477878c2600376e3227c40943d62"}},{"ruleId":"D2","level":"warning","message":{"text":"Flag::fmt (cognitive 22): Flag::fmt has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (8 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/deserializer/deserialize_flags.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf360f87305c068e5c862b19a81c3885509bf2c9d403cf9ae82186fe7b6bc1e7"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_parser_database::types::resolve_type_alias (cognitive 22): internal_baml_parser_database::types::resolve_type_alias has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 4 (8 pts), boolean chains 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/parser-database/src/types/mod.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b7924fa9830ac56cee8bc88926896fffe4709e67111f3e798c544a9cde2c7e"}},{"ruleId":"D2","level":"warning","message":{"text":"AwsClient::stream_chat (cognitive 22): AwsClient::stream_chat has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 7 (11 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00dbfa9f5a64be41cd572692b89060492cbc6187def3e2fa7be69ec36585842"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_runtime::async_vm_runtime::try_vm_value_from_baml_value (cognitive 22): baml_runtime::async_vm_runtime::try_vm_value_from_baml_value has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (8 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/async_vm_runtime.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8a2c51ffc9e75d76309465d2337effb477ebc51a5d43d3fff424f45a6a17f0"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_runtime::internal::llm_client::primitive::openai::openai_client::responses_content_part (cognitive 22): baml_runtime::internal::llm_client::primitive::openai::openai_client::responses_content_part has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 4 (8 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/openai/openai_client.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8be12ddcbd6df1c3d9c6c57c0a8c78277e926793bc40b5ed5627be7930729b1"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_runtime::internal::prompt_renderer::render_output_format::find_enum_value (cognitive 22): baml_runtime::internal::prompt_renderer::render_output_format::find_enum_value has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8a2e5015cd94151f91fb265487086786ca766936e880be19e022affde75b7a"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_vm::native::deep_equals_recursive (cognitive 22): baml_vm::native::deep_equals_recursive has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (7 pts), match/switch 3 (6 pts) (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-vm/src/native.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a794c78d2a626e42c21438f4087b3a9033bb1f42bca85ba178a60fe0f85e49"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_cffi_macros::is_either_convertible_to_rawptr (cognitive 22): baml_cffi_macros::is_either_convertible_to_rawptr has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (21 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"390ecbe665cd44fb9231b415d4d15d7535eca53f2842b7e503854c440b38fb62"}},{"ruleId":"D2","level":"warning","message":{"text":"bstd::dedent::dedent (cognitive 22): bstd::dedent::dedent has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/bstd/src/dedent.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a342bc07da3ac981acf99dfa89cf8f3ab567c56cf2f188157d84e960286d87"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.read_value (cognitive 22): Parser.read_value has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/programs/json-parser-15/main.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad9c4b85207bda0b875a89901f6890e211eda96be236bee1a3e539ddf130b8a"}},{"ruleId":"D2","level":"warning","message":{"text":"btel_query_summary.record_section (cognitive 22): btel_query_summary.record_section has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (6 pts), ternaries 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/btel_query_summary.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c47c0c810a4bfe21c4ebbf6bfaa2aba9168dfba697a5f3c10bc04081dfadf0"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_go.dispatchHostCall (cognitive 22): baml_go.dispatchHostCall has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 2, loops 1 (nesting depth added 8). Of this number, 19 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. 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":"baml_language/sdks/go/baml_go/host_callable.go"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0a2cc34ed47aab74836ad8a9edf98b3f5519b02310367275d6fd73b65c31ee"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_go.encodeCallForDispatchWithTargetAndTypeArgs (cognitive 22): baml_go.encodeCallForDispatchWithTargetAndTypeArgs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 3, boolean chains 2 (nesting depth added 6). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"baml_language/sdks/go/baml_go/runtime.go"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c7e153bffaaa7b8a5acac6b607ec06213fecf9bcea4f36df4574d2420934fb"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_go.getTargetLibFilename (cognitive 22): baml_go.getTargetLibFilename has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/baml_go/lib_common.go"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7985c62ecd6439c60491bdf026b482f184dc0f63a0fbdae8dfbe24c1e2c1d91"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlFunctionArguments.encode (cognitive 22): BamlFunctionArguments.encode has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/pkg/rawobjects_function_args.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"084011fd0a71718d2839923cf57193791994bc1770cceac80a5126b43d2011bf"}},{"ruleId":"D2","level":"warning","message":{"text":"kpis.html.chart (cognitive 22): kpis.html.chart has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 8, boolean chains 6 (nesting depth added 1). Most of this is not in the body itself: 10 of the 22 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 139, a function literal at line 136, a function literal at line 157, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/src/speedtest/templates/kpis.html"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d85130e6d878da1f88d0b8896cfe03a5d8b427262c11837f7fe078044173dbd"}},{"ruleId":"D2","level":"warning","message":{"text":"main.setup (cognitive 22): main.setup has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (8 pts), loops 3 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/json-request-body/main.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7173e92d60317a8f363ae574de66f401a1be576d5dd8c4d77ab3f3e94a7065"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.readValue (cognitive 22): Parser.readValue has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/programs/json-parser-15/main.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e22ea450896fb65aef3f521873c1bfc58c4e7cd8f1de6ae003a40b0cc96ef8"}},{"ruleId":"D2","level":"warning","message":{"text":"index.testUltraComplex (cognitive 22): index.testUltraComplex has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 7 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/mixed_complex_types/typescript/index.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"61cb5de5cadab2f4be37a41f8509a0210f327c7a73f03e98056eac58906e2d41"}},{"ruleId":"D2","level":"warning","message":{"text":"route.GET (cognitive 22): route.GET has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 4 (6 pts), boolean chains 3, loops 2, error handling 1 (nesting depth added 4). Of this number, 14 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. 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":"typescript2/app-beps/src/app/api/agent/beps/[number]/comments/route.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"15070a5aa8ddb8c30d764a635937f0e1eb5376ab63504d1f6825a77a370dd715"}},{"ruleId":"D2","level":"warning","message":{"text":"route.GET (cognitive 22): route.GET has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 7, error handling 2, ternaries 1 (nesting depth added 1). Of this number, 20 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/auth/github/callback/route.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"63671f55b79f827c804a7d15cdfe3e1b23f81e370dd96c5b0010b4d093974bde"}},{"ruleId":"D2","level":"warning","message":{"text":"frame.BcsFrame (cognitive 22): frame.BcsFrame has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5, ternaries 2 (4 pts) (nesting depth added 4). None of this is in the body itself: all 22 points belong to 3 function literals inside it that branch (lines 61, 93, 101). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/frame.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"59dd4beda19edbf28e77bcd4ebde3262b20044c5af91a74dd76fdd3e5bee139f"}},{"ruleId":"D2","level":"warning","message":{"text":"bep-export-dialog.BepExportDialog (cognitive 22): bep-export-dialog.BepExportDialog has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 6 (8 pts), boolean chains 4, error handling 1, loops 1 (nesting depth added 5). Of this number, 12 points are the body\u0027s own statements and 10 belong to one function literal inside it that branches. 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":"typescript2/app-beps/src/components/bep/bep-export-dialog.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"509819acc89f3abd82809574e81a0f6b10705fb78b7896cca57fbffe32f38a1a"}},{"ruleId":"D2","level":"warning","message":{"text":"comment-feed-view.FeedThreadCard (cognitive 22): comment-feed-view.FeedThreadCard has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 15, if/else 4, ternaries 2, error handling 1. Of this number, 13 points are the body\u0027s own statements and 9 belong to 5 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d85d1ed8bc1655ee61ae1f13e234bcb1e6b9b20c9329953902289592ee3e06e"}},{"ruleId":"D2","level":"warning","message":{"text":"docs-toc.DocsToc (cognitive 22): docs-toc.DocsToc has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 6 (11 pts), if/else 4 (6 pts), boolean chains 3, loops 2 (nesting depth added 7). Most of this is not in the body itself: 6 of the 22 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 34, 70, 27, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/components/docs-toc.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27a50cc74dad7f737b1a85434e6ced7cd7bf74f00e35ca0a539e7640c243a21"}},{"ruleId":"D2","level":"warning","message":{"text":"media.MDXMedia (cognitive 22): media.MDXMedia has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 13, if/else 7, ternaries 2. Of this number, 15 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/media.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3f2b4b1cbff301b7d36a79bce264413f527fed42b5f1f0962b1d50c50c5b66"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionSidebar.FunctionTreeNode (cognitive 22): FunctionSidebar.FunctionTreeNode has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 11, ternaries 7 (10 pts), if/else 1 (nesting depth added 3). Of this number, 18 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/FunctionSidebar.tsx"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"c523dcc130e782e74f146163f6a6b77e8bb5eae51e1e85007fc3a9ace644d5b0"}},{"ruleId":"D2","level":"warning","message":{"text":"layout.layoutGraph (cognitive 22): layout.layoutGraph has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (5 pts), ternaries 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/graph/layout.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"393cb9779b11ff5768f2c757dff636ec81588b80c2d035bede443d2f4d30c3e2"}},{"ruleId":"D2","level":"warning","message":{"text":"TelemetryView.ErrorCaptureView (cognitive 22): TelemetryView.ErrorCaptureView has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 15, ternaries 5 (7 pts) (nesting depth added 2). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc7ff201645c4fc1e8200b31f4434194365e48a47604296a1296bfeb6a8bf7d"}},{"ruleId":"D2","level":"warning","message":{"text":"use-telemetry.useTelemetry (cognitive 22): use-telemetry.useTelemetry has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, boolean chains 8, ternaries 2. None of this is in the body itself: all 22 points belong to 13 function literals inside it that branch (lines 166, 194, 150, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/use-telemetry.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ecc287dbfc9dd429a66e29d32d6a94f593d04b1d18e80e6b505965ca07f6b60"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecutionPanel.ExecutionPanel::handleCursorContext (cognitive 22): ExecutionPanel.ExecutionPanel::handleCursorContext has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5, ternaries 3 (4 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition. This shape REPEATS in the file: one other method here (ExecutionPanel.ExecutionPanel) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd336cf9d106fd41e91918953c097769e2bf5112fe84da51e5c0cca167bcadc"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_builtins2_codegen::codegen::extraction_expr (cognitive 21): baml_builtins2_codegen::codegen::extraction_expr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 1, match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_builtins2_codegen/src/codegen.rs"},"region":{"startLine":1660}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1af80a09dcdae64e8510bdde897ebd3132853d0e0a0dfdf76fe239d2c595d73"}},{"ruleId":"D2","level":"warning","message":{"text":"StackifyCodegen::compile (cognitive 21): StackifyCodegen::compile has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 5, boolean chains 2, 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":"baml_language/crates/baml_compiler2_emit/src/emit.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2f34568dc115138a7d62e63134f0cebb85f9b6581f4ca258401c417f8c788b"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::interfaces::collect_type_generic_bound_errors (cognitive 21): baml_compiler2_hir_ty::interfaces::collect_type_generic_bound_errors has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 5 (10 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs"},"region":{"startLine":1604}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a3f717b5ff6da2601c913a5783eec4d69bdbb8e88e25f98addf7400b7af5af"}},{"ruleId":"D2","level":"warning","message":{"text":"Facts::statement (cognitive 21): Facts::statement has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 4 (7 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/optimize/effects.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a7ea972a80aefef401f3eb27b34e2fc3d416f78c3263b4db70c515a1748282"}},{"ruleId":"D2","level":"warning","message":{"text":"PrintChain::print_multi_line (cognitive 21): PrintChain::print_multi_line has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 4 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":3152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a5815d860336d3c8b40e2fb902c5cb4fea41f2141e1a02f409c950128547bd"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalUsageCollector::collect (cognitive 21): LocalUsageCollector::collect has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/usages.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"483a5e8ada3b8d2b9b4cb857a8309ec72eadceff101cad0ff162823c0a87d6a8"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::describe::clean_body_source (cognitive 21): baml_ide::describe::clean_body_source has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/describe.rs"},"region":{"startLine":2447}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80b806c038254d7478e0834bb1c78bda2f597e680ec7ed3e2e2e35cb4e53a29"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_query_btel::ingest::apply_fresh (cognitive 21): baml_query_btel::ingest::apply_fresh has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, match/switch 2 (3 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8161c9c7f6dd7bda8e269c54fe8c6b4c2f78265172261b9d2560355559d2180"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_query_btel::ingest::context::identity (cognitive 21): baml_query_btel::ingest::context::identity has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 3 (5 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/ingest/context.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3611a24fde6ca3f11b39f14641055d312f36cf7ac1ed88f3396bb863eec4f0"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_sdkgen_types::naming::words (cognitive 21): baml_sdkgen_types::naming::words has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_sdkgen_types/src/naming.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd7c6c2282601798bd851fc77a50d3a4d8c844e122645c1012b47307614c899"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_syntax::lexer::run_template (cognitive 21): baml_syntax::lexer::run_template has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_syntax/src/lexer.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ebfd029fdccce91d648045b6ed7a066f260611f608396e6508f5179fa7485c"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_type::normalize::mu::minimize (cognitive 21): baml_type::normalize::mu::minimize has cognitive complexity 21 (threshold 15). Drivers by points: loops 9 (14 pts), if/else 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 9). 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":"baml_language/crates/baml_type/src/normalize/mu.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"ababdcf5d77c7c26c41810b6d6f27544f0f48404ff3dc219effd8764d91507ca"}},{"ruleId":"D2","level":"warning","message":{"text":"BexHeap::resolve_function_constants (cognitive 21): BexHeap::resolve_function_constants has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (7 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_heap/src/heap.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ffe30701b74f704e22cbff1c4cab4a366aaccafab1796ab914ad8cc8ab9cbe"}},{"ruleId":"D2","level":"warning","message":{"text":"PackageReflectImpl::_with_types (cognitive 21): PackageReflectImpl::_with_types has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (6 pts), match/switch 2 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/reflect.rs"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"4512228c186dd278d06e4b76d0d672520fb4ac89dd1cbecad5c99ea19f24baf5"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderDefinitionEquivalence::definitions_equivalent (cognitive 21): RenderDefinitionEquivalence::definitions_equivalent has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, loops 1 (2 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":"baml_language/crates/bex_vm/src/package_reflect/type_class.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b21f066946124e6bb8d28a36c1de22acf6f709d57890a394088980936ba8fe5"}},{"ruleId":"D2","level":"warning","message":{"text":"Scratch::capture (cognitive 21): Scratch::capture has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 3 (6 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/telemetry/snapshot.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"4649a4bfc0529f276c06b7548d7e277589408d67dacf703a731dcf6de702055d"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_baml::csv::encode_cell_into (cognitive 21): bex_vm::package_baml::csv::encode_cell_into has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), boolean chains 3, match/switch 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"56525bc99e0e2f055042819666f98c167e7f789b878c34dd11c8dffe16fb6d35"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_baml::json::union::tagged_member (cognitive 21): bex_vm::package_baml::json::union::tagged_member has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 pts), match/switch 3 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/json/union.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e70e72ed22e8a6c2bcb435178c9c5707f2b1345012efdb654289f64b67a764d"}},{"ruleId":"D2","level":"warning","message":{"text":"bridge_cffi::host_capture::copy (cognitive 21): bridge_cffi::host_capture::copy has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_cffi/src/host_capture.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de39d6cee0e380d3241ca36a191e2a720ec80b898d6109f4ce9b63c7b264bb9"}},{"ruleId":"D2","level":"warning","message":{"text":"WasmIoFs::mkdir (cognitive 21): WasmIoFs::mkdir has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 8 (15 pts), if/else 3 (5 pts), loops 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_wasm/src/wasm_io_fs.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e951cad58c3287bed457e5a6240a7e2773624e0696998f47acf69a1a4bf86a"}},{"ruleId":"D2","level":"warning","message":{"text":"BcsDeliveryHandle::submit (cognitive 21): BcsDeliveryHandle::submit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, loops 4, match/switch 2 (3 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_bcs/src/delivery.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc9f57748a8a10e635c90a00ead63b2c35212cffa5dfbf5e97d7f955ff42fef"}},{"ruleId":"D2","level":"warning","message":{"text":"btel_settings::network::sanitize_url_at (cognitive 21): btel_settings::network::sanitize_url_at has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (6 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_settings/src/network.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f8e6390126e004be94f0ffab9c523fddef6809ba36b5631396265f58b096b0"}},{"ruleId":"D2","level":"warning","message":{"text":"Cuts::decide (cognitive 21): Cuts::decide has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_snapshot/src/shape.rs"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a57f090746fd93486bd15f4a9229baeb26964417667c03ad07f294470b17fac"}},{"ruleId":"D2","level":"warning","message":{"text":"btel_snapshot::definition::encode (cognitive 21): btel_snapshot::definition::encode has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 3 (7 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_snapshot/src/definition.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b38c9391efe95b17217863cbe85496ba46553cb2c526d9f77df8beb3a266741"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_size_gate::output::render_markdown (cognitive 21): cargo_size_gate::output::render_markdown has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 5 (10 pts) (nesting depth added 12). 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. This shape REPEATS in the file: one other method here (cargo_size_gate::output::render_markdown_fragment) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/tools_size_gate/src/output.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d019dd5ea525e98c200c09cf448b8e32d68e09f82cc9fec0f335c3582c11d2"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_size_gate::output::render_markdown_fragment (cognitive 21): cargo_size_gate::output::render_markdown_fragment has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 5 (10 pts) (nesting depth added 12). 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. This shape REPEATS in the file: one other method here (cargo_size_gate::output::render_markdown) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/tools_size_gate/src/output.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"31200251e9412303a0968e671aad49776c0cd2bbde7317376f6ab1bf94350435"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_stow::parse_path_points (cognitive 21): cargo_stow::parse_path_points has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"287b08f9a85a3b626b5ef96ee306371499bf1a49b5d7322520a761e083dd72cb"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_swift::build_translate_ctx (cognitive 21): sdkgen_swift::build_translate_ctx has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (5 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/rust/sdkgen_swift/src/lib.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f77889b093f2c00097751aea020d0023ad6acb6529ee526b97697f8324b18b"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_typescript_shared::leaf::write_class_doc (cognitive 21): sdkgen_typescript_shared::leaf::write_class_doc has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (8 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (sdkgen_typescript_shared::leaf::write_enum_doc) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/typescript/sdkgen_typescript_shared/src/leaf.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee111f5bfa686ca8ae79edf9670df438afdca9f8bbbcee1e789fb70f09f0e02e"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_typescript_shared::leaf::write_enum_doc (cognitive 21): sdkgen_typescript_shared::leaf::write_enum_doc has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (8 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (sdkgen_typescript_shared::leaf::write_class_doc) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/typescript/sdkgen_typescript_shared/src/leaf.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"8044925cc70bd4419616f136ae098140c16d7f7aca36dae0d653d7bfe5545d01"}},{"ruleId":"D2","level":"warning","message":{"text":"jsonish::deserializer::coercer::coerce_union::coerce_union (cognitive 21): jsonish::deserializer::coercer::coerce_union::coerce_union has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 1, match/switch 1 (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/deserializer/coercer/coerce_union.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f67e87248613f3f8b01b2e167c7eff0afe9ffba8e9d1a12a42ecd6bc635764c"}},{"ruleId":"D2","level":"warning","message":{"text":"GEPAOrchestrator::check_convergence (cognitive 21): GEPAOrchestrator::check_convergence has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/orchestrator.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64c1ebe59c930458e69a478701ce256be9fb3a4fe0f73a57cd3458d8c48da00"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_runtime::optimize::tui::render_candidate_card (cognitive 21): baml_runtime::optimize::tui::render_candidate_card has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/tui.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d95725eab563bc66af866d0ebbcf9c78c13a0be6debecc5053b7851cc534fa3"}},{"ruleId":"D2","level":"warning","message":{"text":"WasmRuntime::list_testcases (cognitive 21): WasmRuntime::list_testcases has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 12 (17 pts), boolean chains 2, if/else 2 (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"06214d32336441a6b18238c9b59d3c6a978aeae38af6f058938052b8633f317d"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_cffi_macros::is_vec_rawptrtype (cognitive 21): baml_cffi_macros::is_vec_rawptrtype has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (21 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 4 other methods here (baml_cffi_macros::is_option_rawptrtype, baml_cffi_macros::is_result_bamlvalue, baml_cffi_macros::is_result_rawptrtype, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"c203fe82f672fa55cb98cb68998f90ddd82d6c46f8022738f0f1d7dd112fb403"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_cffi_macros::is_option_rawptrtype (cognitive 21): baml_cffi_macros::is_option_rawptrtype has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (21 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 4 other methods here (baml_cffi_macros::is_vec_rawptrtype, baml_cffi_macros::is_result_bamlvalue, baml_cffi_macros::is_result_rawptrtype, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb54afbad3ab08e3616712d97bbbf48eb99b83a68bbd6b3b96276df4193cee38"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_cffi_macros::is_result_bamlvalue (cognitive 21): baml_cffi_macros::is_result_bamlvalue has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (21 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 4 other methods here (baml_cffi_macros::is_vec_rawptrtype, baml_cffi_macros::is_option_rawptrtype, baml_cffi_macros::is_result_rawptrtype, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"b475f5003e11bc238fac50e65c6e685ce98873e355a554900136bd72b0175255"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_cffi_macros::is_result_rawptrtype (cognitive 21): baml_cffi_macros::is_result_rawptrtype has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (21 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 4 other methods here (baml_cffi_macros::is_vec_rawptrtype, baml_cffi_macros::is_option_rawptrtype, baml_cffi_macros::is_result_bamlvalue, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed939267ae626254d2f3639cf5733cdf478ed25161b657cd0efa34101cbcc966"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_cffi_macros::is_result_bool (cognitive 21): baml_cffi_macros::is_result_bool has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (21 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 4 other methods here (baml_cffi_macros::is_vec_rawptrtype, baml_cffi_macros::is_option_rawptrtype, baml_cffi_macros::is_result_bamlvalue, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0a6f0561f3be6f32fbfe7b22a1728076b7c7df51365a2a0d164b58b299e66c"}},{"ruleId":"D2","level":"warning","message":{"text":"_error_capture._attributes (cognitive 21): _error_capture._attributes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), error handling 1 (4 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/src/baml_bridge/_error_capture.py"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04e6798a5fdf7fa331ac792ec8d866cf202b29317bb24b8db6d3e2b6560af40"}},{"ruleId":"D2","level":"warning","message":{"text":"profiler._build_name_map (cognitive 21): profiler._build_name_map has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (13 pts), error handling 1 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/src/speedtest/profiler.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a611c6e8cb17a45bbedeec1b00284d97a66c3c821337a3174a508e70217553d1"}},{"ruleId":"D2","level":"warning","message":{"text":"storage.list_all (cognitive 21): storage.list_all has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/src/speedtest/storage.py"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1743be7a08923dd3c5aa47c966803e563ab332076d281d9badae13528fe9ac"}},{"ruleId":"D2","level":"warning","message":{"text":"main.setup (cognitive 21): main.setup has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (8 pts), loops 3 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/json-request-body/main.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1e719f32a0101b715025fb79c9df1891ce23c6f2149c7e5d1ae8e01550fb77"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_go.currentRuntimeConfig (cognitive 21): baml_go.currentRuntimeConfig has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/runtime_artifact.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"5143de2ab4e3143824514efd01486f58a82cee3d90c4246de8fe5455d68fd1dc"}},{"ruleId":"D2","level":"warning","message":{"text":"serde.encodeValue (cognitive 21): serde.encodeValue has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/baml_go/serde/encode.go"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"953b33f1fa67c3b0573c220cf229f36ac837d02e1f3b1052e293235bd9870176"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlUnion2._bamlDecode (cognitive 21): BamlUnion2._bamlDecode has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (BamlUnion2._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"92004976a478f8ed1fdfd549d867cbfe055c84eaca84f28a1e396cfcbdcb2651"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlUnion2._bamlDecode (cognitive 21): BamlUnion2._bamlDecode has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (BamlUnion2._bamlDecode) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6d7ed92ba6a8060e6fe3ee19a2c3f86fa6da0e50613c0bd73a874da0b8ea90"}},{"ruleId":"D2","level":"warning","message":{"text":"kpis.html.fmt (cognitive 21): kpis.html.fmt has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 6 (21 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/src/speedtest/templates/kpis.html"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0910544f33571787ca1670ba3b8836606c3bbbac301e5e48d632cdaaf4febbd"}},{"ruleId":"D2","level":"warning","message":{"text":"atoms-orch-graph.buildUnitNodesAndGroups (cognitive 21): atoms-orch-graph.buildUnitNodesAndGroups has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/atoms-orch-graph.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"2396be8a365b766e802a3a876c85e92c5a7c439cdb6f4d6e144688aa26bf8a54"}},{"ruleId":"D2","level":"warning","message":{"text":"preview-toolbar.PreviewToolbar (cognitive 21): preview-toolbar.PreviewToolbar has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 9 (11 pts), boolean chains 8, error handling 1, if/else 1 (nesting depth added 2). Of this number, 17 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/preview-toolbar.tsx"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"229affb5070b9431e7db506bdbaebbbc5745f336b9dcaf76271a8870c97a2f7d"}},{"ruleId":"D2","level":"warning","message":{"text":"bep-table-of-contents.BepTableOfContents (cognitive 21): bep-table-of-contents.BepTableOfContents has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 5, loops 1, ternaries 1 (nesting depth added 1). Most of this is not in the body itself: 4 of the 21 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 121, 147, 154, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-table-of-contents.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a0f8924c6c26c0e897385b4ec6a916deed9b0e82f9d65621a44d4f62079293"}},{"ruleId":"D2","level":"warning","message":{"text":"bep-routes.parseBepSegments (cognitive 21): bep-routes.parseBepSegments has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 6 (nesting depth added 4). 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":"typescript2/app-beps/src/lib/bep-routes.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5dca0f11989b98f23263c9d0b3843f867c103bc753e2f46a6246f5e3e29e7da"}},{"ruleId":"D2","level":"warning","message":{"text":"github.loadDistinctGithubIssueAuthors (cognitive 21): github.loadDistinctGithubIssueAuthors has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/clients/github.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d698e744b7a219decd61e2f1ea2a0edb613ebbdd87bd20e5b8b24773d44e73c"}},{"ruleId":"D2","level":"warning","message":{"text":"aggregate-weekly-metric.zoomAttendanceCount (cognitive 21): aggregate-weekly-metric.zoomAttendanceCount has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/jobs/aggregate-weekly-metric.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"0591309330c9e6baca1269fdb8fa7cb0ed6539eed3d0e21354aaea92a8fc12f5"}},{"ruleId":"D2","level":"warning","message":{"text":"navigation.tokenize (cognitive 21): navigation.tokenize has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (11 pts), boolean chains 5, if/else 3 (5 pts) (nesting depth added 8). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"typescript2/app-stdlib-matrix/src/navigation.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"13029f00738f48769d87401dc50c86e92bcb1ae095700a88eec3ace4405d7f69"}},{"ruleId":"D2","level":"warning","message":{"text":"signup-form.SignupConfirmation (cognitive 21): signup-form.SignupConfirmation has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 9 (16 pts), boolean chains 5 (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":"typescript2/app-website/app/(home)/eap/signup-form.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0f95588f50925ff21edc02a9c219240614719978340a6c088e7e5f79dc1a02"}},{"ruleId":"D2","level":"warning","message":{"text":"tracker.Transit (cognitive 21): tracker.Transit has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 11 (12 pts), if/else 7, boolean chains 2 (nesting depth added 1). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 10 function literals inside it that branch (lines 1672, 1604, 1578, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/tracker.tsx"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7d17a020a3375fb1e9472a93bc648835780dff2bf737b059f91b2f69ce617d"}},{"ruleId":"D2","level":"warning","message":{"text":"software.Figure (cognitive 21): software.Figure has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), ternaries 5, loops 2, boolean chains 1 (nesting depth added 3). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 7 function literals inside it that branch (lines 339, 336, 405, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/software.tsx"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cc3499ff48d7da3d804cdca3946cfe894c4fcbc012c88a4e1ebbcf3be5c253"}},{"ruleId":"D2","level":"warning","message":{"text":"RunOutputTerminal.RunOutputTerminal (cognitive 21): RunOutputTerminal.RunOutputTerminal has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (7 pts), loops 2, boolean chains 1 (nesting depth added 9). None of this is in the body itself: all 21 points belong to 6 function literals inside it that branch (lines 124, 60, 109, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/RunOutputTerminal.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a357816ab7c5dce68c915d822611897a815fbc6fd6752393a67895a6615eaad"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_ast::lower_cst::test_owner_from_path (cognitive 20): baml_compiler2_ast::lower_cst::test_owner_from_path has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/lower_cst.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed299efbc83b8e11e660ab03db4f8fc9af0e4c9c013a32b1fd6efa3783c52585"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_ast::lower_tree::body::statement (cognitive 20): baml_compiler2_ast::lower_tree::body::statement has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 4 (8 pts), loops 1 (3 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56b8b07fa4b521d075fa342789af8f9286f3e437f65d2bd309a864274b92094"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_emit::package::finish::fill_interface_defaults (cognitive 20): baml_compiler2_emit::package::finish::fill_interface_defaults has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 3 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/package/finish.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"b613dd63a16685d813ceb471352bba4f1e548e7a16e86e88dd2777631fb24f44"}},{"ruleId":"D2","level":"warning","message":{"text":"FileSemanticIndex::scope_at_offset (cognitive 20): FileSemanticIndex::scope_at_offset has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir/src/semantic_index.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"084480f20bb5466226f9aee1ae3baee8b884ac0dee768c776b568605ac5b917b"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::exhaustiveness::render_witness_pat (cognitive 20): baml_compiler2_hir_ty::exhaustiveness::render_witness_pat has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (5 pts), loops 1 (2 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/exhaustiveness.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cac5920bc982dbed17fc0c053a4412721d23dceedd0c74078f87dfb92a62e8a"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::impls::impl_facts (cognitive 20): baml_compiler2_hir_ty::impls::impl_facts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/impls.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d79bdf41abaf4036d4d6e27dfa30dcde4a49dca9c1ec41eee1fd54ae46431c"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::interfaces::impl_rules::get_implements_block_within_depth (cognitive 20): baml_compiler2_hir_ty::interfaces::impl_rules::get_implements_block_within_depth has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs"},"region":{"startLine":1867}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc25465cd257f389fd7c54b9ef689421970f535a2864b44411eb17297e7cd19"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::throw_facts::file_throw_facts (cognitive 20): baml_compiler2_hir_ty::throw_facts::file_throw_facts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 6 (7 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/throw_facts.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0b07aab35cc7a1db419f12539051d54fd83c9febffcfb62f0e104860a56849"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_function_body (cognitive 20): LoweringContext::lower_function_body has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 2, boolean chains 1, loops 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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":4531}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea78198bfffcdef5e82a9bc76c080abdf73efde4bf6cbd6b98d702946c9c249"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_lambda (cognitive 20): LoweringContext::lower_lambda has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 3, match/switch 1 (nesting depth added 4). 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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":4958}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8241ba29a92569b1907dcde0dffcca18e0667139bed5e204489aae042a88a85"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::check_type_of_intrinsic (cognitive 20): LoweringContext::check_type_of_intrinsic has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":9440}}}],"partialFingerprints":{"codehealthFindingId/v1":"fadff1016fa1a490cb23e6fb2ff3d6917c4da886b596f832df7d7aac41cb74a4"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::lower_object (cognitive 20): LoweringContext::lower_object has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 3, match/switch 1 (3 pts) (nesting depth added 10). 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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":10372}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6579dbe872ca916937203de2369a41bf0a8bb7fbca59d7f4ea140bda73f15df"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_mir::optimize::merge_passthrough_blocks (cognitive 20): baml_compiler2_mir::optimize::merge_passthrough_blocks has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/optimize.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1a19a7f727fa34da110c00e8588022e32ef9178fbf6b77caed8b1de13acead"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_mir::optimize::values::live_out (cognitive 20): baml_compiler2_mir::optimize::values::live_out has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/optimize/values.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"664d691358557c3104649227500a3d3b2a50fa418c612c98bc9c42e793ee9c9a"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_rust::admit::compile_program (cognitive 20): baml_compiler2_rust::admit::compile_program has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (9 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_rust/src/admit.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e260a50be646034a8425e45ac8ec94121813cadffa7b46254c47fbafa191f3f"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::cfg::ast_control_flow_graph_for_loc (cognitive 20): baml_ide::cfg::ast_control_flow_graph_for_loc has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/cfg.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c873b0c5d281bf1154775cc474a997ddf84aba7d7225b53c8a1f74320d3ce28"}},{"ruleId":"D2","level":"warning","message":{"text":"Assembler::place (cognitive 20): Assembler::place has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 2 (8 pts), boolean chains 1 (nesting depth added 12). 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":"baml_language/crates/baml_linker/src/assemble.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3adca360fbfdd350ac1b04b825f5938ab5012822e9b63efaa272c2836e157e"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_linker::order::init_order (cognitive 20): baml_linker::order::init_order has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (10 pts), if/else 3 (8 pts), boolean chains 2 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_linker/src/order.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"741564d5d3061526b112878e5a2feec3d98e59c600db880fe8acba9abf522f49"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalState::apply_one (cognitive 20): GlobalState::apply_one has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp/src/state.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3dc2a68ca7941471e6ea3a7322d9f889062bfd0df830b370e71d91ab72459a"}},{"ruleId":"D2","level":"warning","message":{"text":"LspRuntime::dispatch (cognitive 20): LspRuntime::dispatch has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/lsp_runtime.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61f0ec8b5153385c37e59d7cd726b4fe5770c6358cf3ecc86fa29bf8d77cc3b"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_parser::items::class_def (cognitive 20): baml_parser::items::class_def has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2, loops 1, 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":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a842af4982c5a2bd60c5268da28df15d6c09d51e6cc99ee45b93b0a151ddeac"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_parser::items::interface_def (cognitive 20): baml_parser::items::interface_def has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, loops 1, 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":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":1408}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9543969297dba2bb6af9e2a3ff121c1cf490e514c85fc961eb6654a5ac25720"}},{"ruleId":"D2","level":"warning","message":{"text":"Bulk::resolve_nodes (cognitive 20): Bulk::resolve_nodes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (5 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/ingest/bulk.rs"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddace10d264d216f1f4c909107d229dbb1ad30361db6cb2ab3c5e30a68a301b1"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_query_btel::ingest::profile::build (cognitive 20): baml_query_btel::ingest::profile::build has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 5 (6 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/ingest/profile.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc53fe62ed0b7e57714f5eccb46046abeacb972ce92faec1a8aa2bfab72f5b64"}},{"ruleId":"D2","level":"warning","message":{"text":"Fetcher::install_to_toolchain_root_with_force (cognitive 20): Fetcher::install_to_toolchain_root_with_force has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_release/src/lib.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"266130c303a68c0851de5a616dfcbae64a20c27e6da2ba462cc090a5511789a3"}},{"ruleId":"D2","level":"warning","message":{"text":"Tarjan::strong_connect (cognitive 20): Tarjan::strong_connect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/decl_cycles.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a193ebe698f7e623186d92f23e24456f13889084abadb51fd529816e256541"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonInhabitance::witness_walk (cognitive 20): JsonInhabitance::witness_walk has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 4 (8 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/json_inhabit.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b77cfbe7530e784ffad6ea2ab939d30077e3f85e4fcc6fd231a54c2f3314e5c"}},{"ruleId":"D2","level":"warning","message":{"text":"NormalTy::absorb_subtypes (cognitive 20): NormalTy::absorb_subtypes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/normalize.rs"},"region":{"startLine":2533}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b9c5ae3fe13b65bae006d1caafa4b6e4692f47195dad8118923864761b1e32"}},{"ruleId":"D2","level":"warning","message":{"text":"BexEngine::runtime_schema_overlay (cognitive 20): BexEngine::runtime_schema_overlay has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (5 pts), match/switch 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":2616}}}],"partialFingerprints":{"codehealthFindingId/v1":"0849a99d0316349dd4aa5027a6a41237157784edee022c75eb3a833d4fd29d6c"}},{"ruleId":"D2","level":"warning","message":{"text":"Structural::class (cognitive 20): Structural::class has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 4 (9 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":"baml_language/crates/bex_vm/src/package_baml/json/decode.rs"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec433dd664fc70cf2bf8d231c29bd49b18904a01bf3ce0d8a217b3631c04b0fe"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::visit (cognitive 20): Walker::visit has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 7 (12 pts), if/else 4 (8 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/json/encode.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec86d7df73d59f49c75e66330d2e89714004ae6df47bda0a3359e9e1151aa13"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_baml::csv::ensure_preamble (cognitive 20): bex_vm::package_baml::csv::ensure_preamble has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f7afe54ad5fdd56031e7e71ade69fee3d665db9c497a5fb98cb72740b4cbe2"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_reflect::type_class::first_open_interface (cognitive 20): bex_vm::package_reflect::type_class::first_open_interface has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/type_class.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1898ee3edf469cf56b3a0c4d7cf6a99b17b8ff28c7aacedc5bc40b2a924d40"}},{"ruleId":"D2","level":"warning","message":{"text":"bridge_cffi::invocation_protocol::decode_call (cognitive 20): bridge_cffi::invocation_protocol::decode_call has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 3 (10 pts), if/else 5 (7 pts), loops 1 (3 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"baml_language/crates/bridge_cffi/src/invocation_protocol.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"17dbe47ecbbd6364d92b318ab50010145130e56240ea45edb5b21380615a7698"}},{"ruleId":"D2","level":"warning","message":{"text":"Facts::flatten_into (cognitive 20): Facts::flatten_into has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_encode/src/facts.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e8638e124835f4627525cb4d55fe085bc27a69dd6c6b1bcfb018a72655faaa"}},{"ruleId":"D2","level":"warning","message":{"text":"Code::visit (cognitive 20): Code::visit has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 5 (7 pts), match/switch 1 (3 pts) (nesting depth added 9). 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":"baml_language/crates/btel_reader/src/value/code.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"319b162d8220bcc44fb972a5e591675adf741e03d375fd460b86dda5a5e10b55"}},{"ruleId":"D2","level":"warning","message":{"text":"sys_native::installation::archive_entries (cognitive 20): sys_native::installation::archive_entries has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_native/src/installation.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50e21d99906cf25d500f9f979796d4e52f910c4631311de4b6cb76fd280e74c"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_stow::find_best_manifest (cognitive 20): cargo_stow::find_best_manifest has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32e73eb7c059afbfed833a50c5fc6c68b4c4b2d373887fc7b0cc424c2395567"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_stow::fix_cargo_toml (cognitive 20): cargo_stow::fix_cargo_toml has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6e6cde9eed6999f8d0c47ab9187460a8f44439d1765ccd9b8b4b12ca447b31"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderContext::type_source_for (cognitive 20): RenderContext::type_source_for has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 1, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1110db97e338de06f075b146c2e58e85eb9ce35328de36ceafe8e47f33a676d"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_csharp::semantic::render_class (cognitive 20): sdkgen_csharp::semantic::render_class has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (13 pts), loops 4 (7 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":2921}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbfeab88ad276fc67d49ec9f88ca3231939227ecd70171bb53e4226d2e48d13"}},{"ruleId":"D2","level":"warning","message":{"text":"LeafBody::protocol_callables (cognitive 20): LeafBody::protocol_callables has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (18 pts), match/switch 1 (2 pts) (nesting depth added 13). 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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"c038aa5144fa306bed5c5a45b6b7290828a484db70a96c72ee6f8289bffc6a95"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_python_pydantic2::render_function_registry (cognitive 20): sdkgen_python_pydantic2::render_function_registry has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 3 (8 pts), boolean chains 1, match/switch 1 (nesting depth added 10). 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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/lib.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"c633f2ab26aec11062079ceb0a74f96d8ee32c590ba580f124267df5ef729d56"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_jinja_types::evaluate_type::expr::typecheck_attr_access_on_union (cognitive 20): internal_baml_jinja_types::evaluate_type::expr::typecheck_attr_access_on_union has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 6 (10 pts), if/else 4 (9 pts), loops 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jinja/src/evaluate_type/expr.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba663db594cecf410bd7a21ba774d56ed7747d4a459cc48501d2283f777f55a"}},{"ruleId":"D2","level":"warning","message":{"text":"ParserDatabase::finalize_dependencies (cognitive 20): ParserDatabase::finalize_dependencies has cognitive complexity 20 (threshold 15). Drivers by points: if/else 2 (9 pts), match/switch 2 (7 pts), loops 3 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/parser-database/src/lib.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c11b0fec897fce979a737fb66177d2315b9ba7af35c72cf2d6145a8e246ffdc"}},{"ruleId":"D2","level":"warning","message":{"text":"Tarjan::strong_connect (cognitive 20): Tarjan::strong_connect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/parser-database/src/tarjan.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"2260687a9026bf062b22828177561420827b8a3b82716126e390debc4a371e74"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_prompt_parser::parser::parse_prompt::handle_print_block (cognitive 20): internal_baml_prompt_parser::parser::parse_prompt::handle_print_block has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 6 (13 pts), loops 2 (4 pts), if/else 3 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/prompt-parser/src/parser/parse_prompt.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ae88a9515ec7d9040dbed8c03c0adb29377d8eb052029a384fa782b493802e"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAIClient::to_media_message (cognitive 20): OpenAIClient::to_media_message has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 8 (20 pts) (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/openai/openai_client.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"b199c44570c5d6056b91f0694a86d2b5ff3932cf57454ca1871850723062723b"}},{"ruleId":"D2","level":"warning","message":{"text":"OptimizationStorage::save_candidate (cognitive 20): OptimizationStorage::save_candidate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 5 (7 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/storage.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d90075a0e44501b4cf680b1500288e7f728162f588f10386ef37de01ea91ed"}},{"ruleId":"D2","level":"warning","message":{"text":"TracePublisher::process_batch_impl (cognitive 20): TracePublisher::process_batch_impl has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/tracingv2/publisher/publisher.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88d968f5fea6a514bfb45687adf856aa2c46e924fa5c12a06b2e80c6f4500ed"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_runtime::optimize::schema_extractor::collect_reachable_types (cognitive 20): baml_runtime::optimize::schema_extractor::collect_reachable_types has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (7 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/schema_extractor.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"edff9d4cba73c9d62708d364733afcaa4f5bbe0fa67c671c3412cdad6810523c"}},{"ruleId":"D2","level":"warning","message":{"text":"WasmRuntime::get_entity_at_position (cognitive 20): WasmRuntime::get_entity_at_position has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"93038ca6444929c1dae96286bba769289a2893115864ad41612772c48d42c137"}},{"ruleId":"D2","level":"warning","message":{"text":"generators_go::ir_to_go::type_to_go (cognitive 20): generators_go::ir_to_go::type_to_go has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/go/src/ir_to_go/mod.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa516c8bec02ef3d1eae13f6b6e852d826a0ee4b1039e9378e6eee9287841c1"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_macros::encode::derive_enum_encode (cognitive 20): baml_macros::encode::derive_enum_encode has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"languages/rust/baml-macros/src/encode.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec0f73652145a2730e24137a464ecef83120e52e670eb38b192f5b03f84eb14"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_stubs.main (cognitive 20): generate_stubs.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/generate_stubs.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3b674667d116947b7f8da414dd6838725eaabdfdfb341c0a4e064367943a7b"}},{"ruleId":"D2","level":"warning","message":{"text":"_capture_adapters.http_summary (cognitive 20): _capture_adapters.http_summary has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 3 (9 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/src/baml_bridge/_capture_adapters.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5be320530375a8e08006045c171f7ace9dcaf3781cead2faf07352212eaea6"}},{"ruleId":"D2","level":"warning","message":{"text":"kpis._value (cognitive 20): kpis._value has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/src/speedtest/kpis.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa745caf348acae3caad0c17f3986f22c71a46cb696ad667d03a9425607efe79"}},{"ruleId":"D2","level":"warning","message":{"text":"main.test_ultra_complex (cognitive 20): main.test_ultra_complex has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/mixed_complex_types/python/main.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c813059d7075460b7820a33836769cbb0a9b939b2113c2d5634d80962af07c"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_go.reflectBAMLType (cognitive 20): baml_go.reflectBAMLType has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/dynamic.go"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"b672cfda2f791a4135dfb61553e33b8e0e2170508ca44ee18774c5fab2dffbcf"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_go.semanticUnionOptions (cognitive 20): baml_go.semanticUnionOptions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (4 pts), boolean chains 1, match/switch 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":"baml_language/sdks/go/baml_go/value.go"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"a646e0ffd135ca20801bb6b501f02a46af8908416dd170a2f9683a7b5ec5723b"}},{"ruleId":"D2","level":"warning","message":{"text":"main.quickSort (cognitive 20): main.quickSort has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/quick-sort-3way-1k/main.js"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb090588482b6014f13727914e813721e8757960bab6b1b7d1184dd78dc8d7d4"}},{"ruleId":"D2","level":"warning","message":{"text":"index.testComplexMaps (cognitive 20): index.testComplexMaps has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 10, if/else 10. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/map_types/typescript/index.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf84cfaa59ebbb11bc6af783b68b0af9b2f1133cf2d7128e12039751d1762d7"}},{"ruleId":"D2","level":"warning","message":{"text":"index.testComplexNested (cognitive 20): index.testComplexNested has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, boolean chains 7. Of this number, 18 points are the body\u0027s own statements and 2 belong to 5 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/nested_structures/typescript/index.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"84cdaeaf0ff32d8005a0612bad1b2b58e34be6c7973ffa4870ea8b9a3a8c8870"}},{"ruleId":"D2","level":"warning","message":{"text":"render-text.HighlightedText (cognitive 20): render-text.HighlightedText has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 3 (5 pts), boolean chains 3, loops 1 (nesting depth added 5). None of this is in the body itself: all 20 points belong to 5 function literals inside it that branch (lines 117, 47, 106, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/render-text.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4ec8778005faa2a35e427cfceb8c73188a9c2669b0209fff4b21ed4f20803c"}},{"ruleId":"D2","level":"warning","message":{"text":"collapsible-message.CollapsibleMessage (cognitive 20): collapsible-message.CollapsibleMessage has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 4, boolean chains 2, loops 1 (nesting depth added 4). Most of this is not in the body itself: 3 of the 20 points are its own statements and the rest belongs to 3 function items inside it that branch (getMediaIndicator, a function literal at line 32, a function literal at line 90). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/collapsible-message.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1f3703f4b61918d8a20a19739cc00103e248b7ec3766fd7ce80f330dc4bf55"}},{"ruleId":"D2","level":"warning","message":{"text":"unified-prompt-preview.UnifiedPromptPreview (cognitive 20): unified-prompt-preview.UnifiedPromptPreview has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 15, if/else 5. Of this number, 13 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/unified-prompt-preview.tsx"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2c98720999c90d5f8ff678b0ab9208d763cdae281040a1742abb79773725e3"}},{"ruleId":"D2","level":"warning","message":{"text":"decision-form.DecisionForm (cognitive 20): decision-form.DecisionForm has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 10, if/else 4, ternaries 3, loops 1 (2 pts), error handling 1 (nesting depth added 1). Most of this is not in the body itself: 9 of the 20 points are its own statements and the rest belongs to 3 function items inside it that branch (handleSubmit, a function literal at line 62, a function literal at line 58). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/decisions/decision-form.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"51044c023be54c16dd93b5db0eb9514c513bf440e6e37e8c27e7ebb29352cf71"}},{"ruleId":"D2","level":"warning","message":{"text":"export-all-utils.generateBepReadme (cognitive 20): export-all-utils.generateBepReadme has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 7). Of this number, 16 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. 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":"typescript2/app-beps/src/lib/export-all-utils.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3e002da4172d345421fa5f188977312a5caed61f23befa4f9bf88cfe38355a"}},{"ruleId":"D2","level":"warning","message":{"text":"document-projector.validateLogicalLinks (cognitive 20): document-projector.validateLogicalLinks has cognitive complexity 20 (threshold 15). Drivers by points: if/else 2 (7 pts), loops 3 (6 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/generated-content/document-projector.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d3f00648b29d666fbbd3f7a4ee3733fa8f00a1d4f39e41808ac467d36abc36"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseMetadata (cognitive 20): parser.parseMetadata has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 1 (2 pts), error handling 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/snippets/parser.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"28285f2aae46acdd31f93be43274a407da8537a684fb8e8fd6c38d3b4d1c809a"}},{"ruleId":"D2","level":"warning","message":{"text":"parser.parseBamlSource (cognitive 20): parser.parseBamlSource has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/snippets/parser.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c709513e0f4c2468227f498240d3d70b2043dc408124558c0c9bcecbb12c1d"}},{"ruleId":"D2","level":"warning","message":{"text":"no-widen-then-assert.knownValueEvidence (cognitive 20): no-widen-then-assert.knownValueEvidence has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 9 (nesting depth added 2). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-widen-then-assert.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"0251488c0315b2723734174adb75aaa9397e639f3d5c4b44b1d25d025ec6414f"}},{"ruleId":"D2","level":"warning","message":{"text":"tracker.runnerPose (cognitive 20): tracker.runnerPose has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 6 (nesting depth added 2). Of this number, 17 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/tracker.tsx"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba42aad2fdcd177688c09587814755b9f968367ecf4ca6861f4dcc318b858e15"}},{"ruleId":"D2","level":"warning","message":{"text":"language.Examples (cognitive 20): language.Examples has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 12 (17 pts), boolean chains 3 (nesting depth added 5). Most of this is not in the body itself: 7 of the 20 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 420, 403). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/language.tsx"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f7ea3e58950c8c9fa3899dc274e16f2749d7c2cd450e548d31dc4c9b0d5a77"}},{"ruleId":"D2","level":"warning","message":{"text":"newsletter-form.NewsletterForm (cognitive 20): newsletter-form.NewsletterForm has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8, ternaries 6 (8 pts), boolean chains 3, match/switch 1 (nesting depth added 2). Most of this is not in the body itself: 5 of the 20 points are its own statements and the rest belongs to 8 function items inside it that branch (handleSubmit, SignUpFormButton, hasRecentSubmission, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/newsletter-form.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7427ae8496c1ccca086b9f62ab67297bfd64b2cb25268c3045d347368d7962a"}},{"ruleId":"D2","level":"warning","message":{"text":"emit-sublime.emitSublimeSyntax::convertRule (cognitive 20): emit-sublime.emitSublimeSyntax::convertRule has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar/scripts/emit-sublime.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b2568fb576c8674db0c71a349a40ab6476d696396b378baf3a50f72c4e5f66"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecutionPanel.CollectionDebugView (cognitive 20): ExecutionPanel.CollectionDebugView has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 8 (11 pts), boolean chains 9 (nesting depth added 3). Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 414, 428). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a886c2bc72b98b6c32e1a47be2ac17e722317822b458d7a621493dd74d85a6"}},{"ruleId":"D2","level":"warning","message":{"text":"top-level statements (cognitive 19): top-level statements has cognitive complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdk_tests/crates/csharp/streaming/Program.cs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d641d6060f8830985bee279e96b9d6ad8b8d3c95b25e1ab587fe0544aea640f"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_builtins2_codegen::codegen::receiver_immut_extraction_expr (cognitive 19): baml_builtins2_codegen::codegen::receiver_immut_extraction_expr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_builtins2_codegen/src/codegen.rs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f9b948aa5d74ec9c9b8968a3766d2b9d4e3134bfb520aef68a29b4d73c4296"}},{"ruleId":"D2","level":"warning","message":{"text":"CacheContext::collect_diagnostics_with_plan (cognitive 19): CacheContext::collect_diagnostics_with_plan has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (7 pts), match/switch 3 (6 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/bytecode_cache.rs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d04939f200f297beba7cd54c6f9e0937e85365f946af66aadbbcde4a9b0bed"}},{"ruleId":"D2","level":"warning","message":{"text":"DescribeArgs::find (cognitive 19): DescribeArgs::find has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/describe_command.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1ae98e9e5f70ded62c964262491d9354884f2de0f936e289b817c9b45288d1"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_emit::analysis::predecessors_cover_block (cognitive 19): baml_compiler2_emit::analysis::predecessors_cover_block has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/analysis.rs"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"553d8cf2b3976a5ac3363fcdb2d198efda358dbc292b0dc1c5cfb6292e915463"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::globals::plan_global_init (cognitive 19): baml_compiler2_hir_ty::globals::plan_global_init has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 3 (8 pts), boolean chains 2 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/globals.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad46bfd98a51c55251256f89f23b8c0a9214e88c510cc747db4abd74d3a7036"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::package_interface::fold_package_interface (cognitive 19): baml_compiler2_hir_ty::package_interface::fold_package_interface has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (5 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/package_interface.rs"},"region":{"startLine":2201}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff90bfdf8c1d7f9911cbd4fdec1976e6bda4a22af90991c47534d69de1a890c"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::segments (cognitive 19): Walker::segments has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_metrics/src/structure.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3475727821cf403cb6e2c51142199bf461d8f238f99f45abcfbff5d17e279e"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_mir::optimize::values::eliminate_dead_stores (cognitive 19): baml_compiler2_mir::optimize::values::eliminate_dead_stores has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 3 (8 pts), boolean chains 2 (nesting depth added 9). 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":"baml_language/crates/baml_compiler2_mir/src/optimize/values.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5bb48ee923050d58dcc06c1107949c2c4b8f23556bb94054e5ea573b4093b7b"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator::compiled_call (cognitive 19): Generator::compiled_call has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (11 pts), match/switch 3 (4 pts), boolean chains 2, loops 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_rust/src/codegen/call.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef098b7c3d1b3e955c2f190d679996569a0d35cc22357707d81c61703d6baf6"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_fmt::ast::expressions::map_single_line (cognitive 19): baml_fmt::ast::expressions::map_single_line has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":2633}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9d35ccbed8a57a80800d9019d1718443f5a840e8ea6c4f25b93855ea76dd57"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::annotations::file_annotations (cognitive 19): baml_ide::annotations::file_annotations has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/annotations.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bcd76528fb5ecbad9ec26f47696b4f3144fdece08f4e3859113545a14236a6"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_linker::resolve::export_objects (cognitive 19): baml_linker::resolve::export_objects has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_linker/src/resolve.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"182f1f28a6a9cc1c8f870c0c1d933957c1d651b65583d5744f8aa4f1e83417b2"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobalState::on_roots_loaded (cognitive 19): GlobalState::on_roots_loaded has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (6 pts), loops 4 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp/src/dispatch/events.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"203c91a25b96e2d725b81371608e41ae09f5f21899f3d87837df84b25cb2f9b0"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_parser::types::paren_group_contents (cognitive 19): baml_parser::types::paren_group_contents has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_parser/src/types.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed54e752375287166f6fbb77ee5fecd3a48a9867bcf644cd402c87b598f2c10f"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_syntax::lexer::quoted_body (cognitive 19): baml_syntax::lexer::quoted_body has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (6 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_syntax/src/lexer.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f898c958f61fbecd7e3e901475d7fc52ab17d0d8fcbf31a00d74624d4986b53b"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_type::pattern_overlap::pattern_bounds_refute (cognitive 19): baml_type::pattern_overlap::pattern_bounds_refute has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/pattern_overlap.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"a177c248c089accbf533fa1ad0f6fa65f2c4ecdd07636a4e406a445d6db726c9"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_type_macros::convert::emit_conversions (cognitive 19): baml_type_macros::convert::emit_conversions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type_macros/src/convert.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2d38ab0fdcea400770391eeb99d541866418e62df1546ea9850e8ae51012b8"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_type_macros::emit::head_arm (cognitive 19): baml_type_macros::emit::head_arm has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (5 pts), loops 2 (4 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (baml_type_macros::emit::child_visit_arm) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type_macros/src/emit.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"2163c5ebf6855cf1d59347f3545388adabfc55941ead13f7cb5450e2c3977988"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_type_macros::emit::child_visit_arm (cognitive 19): baml_type_macros::emit::child_visit_arm has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (5 pts), loops 2 (4 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (baml_type_macros::emit::head_arm) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type_macros/src/emit.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6227345e284665e8e213c3f97ad03a1b9e2c51a7cf3c9f112bdfc9330e20a0"}},{"ruleId":"D2","level":"warning","message":{"text":"Hydrator::value (cognitive 19): Hydrator::value has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/hydrate.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b126c44c12fd773c7e243e5d85d4637122e478b874f43de7e67f2c6e94d09c"}},{"ruleId":"D2","level":"warning","message":{"text":"FloatTy::coerce (cognitive 19): FloatTy::coerce has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e34c3dcf4e5ed3f9c52c38d978a8ee6b341d06951d303edcc28b10212b2018"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_sap::jsonish::parser::fixing_parser::parse (cognitive 19): bex_sap::jsonish::parser::fixing_parser::parse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 3 (6 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d61ff0bb3dce0004efa948cc1e488ba609ab4fee9b344aabe4a5a04c28366b"}},{"ruleId":"D2","level":"warning","message":{"text":"Structural::literal (cognitive 19): Structural::literal has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 5 (9 pts), boolean chains 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/json/decode.rs"},"region":{"startLine":1683}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e968c7a80d26f274d5c4cff0dc35229c5166d38953758b7a731a62574d361cc"}},{"ruleId":"D2","level":"warning","message":{"text":"BexVm::visit_roots (cognitive 19): BexVm::visit_roots has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 6, match/switch 2 (3 pts), boolean chains 2 (nesting depth added 4). 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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":12127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63a55d62e426489cb4dd07a4451c0cd2260ca61c811b70f88d44a64e52b888b"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_load::fill_package_slots (cognitive 19): bex_vm::package_load::fill_package_slots has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 2 (5 pts), match/switch 1 (3 pts) (nesting depth added 10). 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":"baml_language/crates/bex_vm/src/package_load.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c75968cc8ecf922a173bf3be3e5545a6b6798b34ed9d0c7b92c644a0b4a60a"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_reflect::runtime_class_builder::validate_pending::walk (cognitive 19): bex_vm::package_reflect::runtime_class_builder::validate_pending::walk has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, loops 1 (2 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":"baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"137581575660351dc9569e6ff7d807e90c84542c66ed629c8044deff98e29791"}},{"ruleId":"D2","level":"warning","message":{"text":"Planner::natural (cognitive 19): Planner::natural has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (9 pts), loops 3 (7 pts), if/else 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_encode/src/plan.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"efaa2b0448f13aea2556ab3b32e65d1dcc1baa785d0410d219a95e8e3fccdbe5"}},{"ruleId":"D2","level":"warning","message":{"text":"Planner::union (cognitive 19): Planner::union has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 2 (6 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"baml_language/crates/bridge_encode/src/plan.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbd7f4201e5c89ac93ae9d4e1c0076d4211a6ec1cd7eb2e0395c2648dcb0f52"}},{"ruleId":"D2","level":"warning","message":{"text":"bridge_encode::facts::stated (cognitive 19): bridge_encode::facts::stated has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (10 pts), loops 2 (6 pts), if/else 1 (3 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"baml_language/crates/bridge_encode/src/facts.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d69e2ad6d3e0807593c302be104c4ab328364e52cc177da57d73698f7ebbf32"}},{"ruleId":"D2","level":"warning","message":{"text":"Heartbeat::run_authorized (cognitive 19): Heartbeat::run_authorized has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (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":"baml_language/crates/btel_bcs/src/liveness.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"a151b824a73e1126f528708ac12475bbf5318e082d59bf75be58fc2fb282f228"}},{"ruleId":"D2","level":"warning","message":{"text":"btel_file::reader::read_directory (cognitive 19): btel_file::reader::read_directory has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_file/src/reader.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"543beb8118173e90c5ae4157e6802c5160c699ccf2660ca10908288a931f1569"}},{"ruleId":"D2","level":"warning","message":{"text":"btel_reader::value::span::reach (cognitive 19): btel_reader::value::span::reach has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (15 pts), if/else 1 (3 pts), loops 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"baml_language/crates/btel_reader/src/value/span.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"c865b444089bb09f73644f3ebb0a231e9fd4f2bbc84cf5aa08ed209e488be28e"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeSysOps::_subprocess (cognitive 19): NativeSysOps::_subprocess has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (8 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":2085}}}],"partialFingerprints":{"codehealthFindingId/v1":"e342674cc0f634ff50d49643e821ebf6ce9bf34f01ddc0fbd47e900e1ba7f467"}},{"ruleId":"D2","level":"warning","message":{"text":"OutputFormatContent::render_class_hoisted (cognitive 19): OutputFormatContent::render_class_hoisted has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 4 (8 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":"baml_language/crates/sys_ops/src/output_format.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7620a960009ddf9eb0693e93ef654ebeb93cfa40159ee2242ff4618fab6bb4"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_size_gate::cmd_bake (cognitive 19): cargo_size_gate::cmd_bake has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 4 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/tools_size_gate/src/main.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd924c33e085b7873ddf23e932b4dd68bc414b98fc254e9e0d6131300f45c00"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_stow::glob_match_recursive (cognitive 19): cargo_stow::glob_match_recursive has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5a29ecce72c3cba819165e1568b8ed811d415896ead53fc23f66e69df68415"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_go::names::hash_go_ty (cognitive 19): sdkgen_go::names::hash_go_ty has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (8 pts), match/switch 4 (8 pts), if/else 1 (3 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/sdkgen_go/src/names.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a87500af36e36c0c50a9fa817325de8ff542f5f3e955c1bd0728d20b86ee65"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_swift::translate_ty::translate_ty (cognitive 19): sdkgen_swift::translate_ty::translate_ty has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 3 (5 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/rust/sdkgen_swift/src/translate_ty.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d396b7ac0aa9f2d40f7cbd89bb7407f9a4e13a524cf58bfed2125214b7d6a399"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_typescript_shared::leaf::render_class_ts (cognitive 19): sdkgen_typescript_shared::leaf::render_class_ts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 4 (5 pts), boolean chains 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":"baml_language/sdks/typescript/sdkgen_typescript_shared/src/leaf.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ed8d8feaefd22da39e871df20d788bd70666a93594c7b2cad488c671c05c57"}},{"ruleId":"D2","level":"warning","message":{"text":"MermaidDiagramGenerator::render_headers_only (cognitive 19): MermaidDiagramGenerator::render_headers_only has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"456a7fb6f86fa15b1db0ccdf7e14a90153c04b47f30d2e1abdc9d5f74333d33b"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_core::validate::validation_pipeline::validations::classes::validate (cognitive 19): internal_baml_core::validate::validation_pipeline::validations::classes::validate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 3 (5 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/classes.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f473a2982160d48c045e866ce53d788c6f125904317ed04ac87a9ffcb279e3e"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_core::validate::validation_pipeline::validations::expr_fns::validate_stmt (cognitive 19): internal_baml_core::validate::validation_pipeline::validations::expr_fns::validate_stmt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (7 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/expr_fns.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8e651a65c3ad98752381477eda7a1cca7b00929865f82aa2a8e5eaaa90d787"}},{"ruleId":"D2","level":"warning","message":{"text":"OutputFormatContent::inner_type_render (cognitive 19): OutputFormatContent::inner_type_render has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jinja-runtime/src/output_format/types.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c67ab9561ce4702d6b704e16faf91b9d39b83125b71bbdc19517128e4b9a0a4"}},{"ruleId":"D2","level":"warning","message":{"text":"jsonish::jsonish::parser::fixing_parser::parse (cognitive 19): jsonish::jsonish::parser::fixing_parser::parse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 3 (6 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5c6698b3595c9e36645003c825d9ebe049bb3df09b4ab85fabec3032aebc75"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlAsyncInterpreterRuntime::call_function (cognitive 19): BamlAsyncInterpreterRuntime::call_function has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 4 (6 pts), boolean chains 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":"engine/baml-runtime/src/async_interpreter_runtime.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de83234b881751fadd6601553c87096ee1ab84e6187455beaf1f981d09fe824"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::baml_stream (cognitive 19): Server::baml_stream has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 2 (6 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"engine/baml-runtime/src/cli/serve/mod.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fc0bc235487ee8da6a975ffe02b53a0515ac2752b8031fd9a27aa9cf71f740"}},{"ruleId":"D2","level":"warning","message":{"text":"BlobUploader::run (cognitive 19): BlobUploader::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/tracingv2/publisher/publisher.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40756aae9c1ea711b46ae8a8c30c77089e7c9d6a54bc86e351c6ca8552ca675"}},{"ruleId":"D2","level":"warning","message":{"text":"generators_ruby::ir_to_rb::stream_type_to_rb (cognitive 19): generators_ruby::ir_to_rb::stream_type_to_rb has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 5 (9 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/ruby/src/ir_to_rb/mod.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f65e26ef69e23fb1d96a6b40be61b2183ad7e4914f9058a9cd9cf8855d9f9cd"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeTS::serialize_type (cognitive 19): TypeTS::serialize_type has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 4 (7 pts), loops 1 (2 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/typescript/src/type.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b40e6974c03fdf0882c9d0b9f7c153bca7a97a65f497c3d50d68d133eee325"}},{"ruleId":"D2","level":"warning","message":{"text":"FileCollector::remove_dir_safe (cognitive 19): FileCollector::remove_dir_safe has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (3 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":"engine/generators/utils/dir_writer/src/lib.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"3957fefb32453526cf3f6c14d8fd2c6ee7a89889e5e83ee02d2d3c26de6bfeaf"}},{"ruleId":"D2","level":"warning","message":{"text":"language_server::baml_project::get_dummy_value (cognitive 19): language_server::baml_project::get_dummy_value has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (7 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/baml_project/mod.rs"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"59cf01d7dcb9688bf0f584bc2429a34fbd22311a1de71a34dac65ac1fd68a792"}},{"ruleId":"D2","level":"warning","message":{"text":"playground_server::handlers::webview_rpc::webview_rpc_handler (cognitive 19): playground_server::handlers::webview_rpc::webview_rpc_handler has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/playground-server/src/handlers/webview_rpc.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ead8cf58ab534b14ceaf08081b6350d8d89ea3b52e5f78abfa10f284f4202d"}},{"ruleId":"D2","level":"warning","message":{"text":"ProtoReader.armMatchesValue (cognitive 19): ProtoReader.armMatchesValue has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 11, if/else 3 (5 pts), loops 1 (2 pts), ternaries 1 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6853d2287372671e6387d6d457b4c22cde6c9598c5f9c970a75d9410f280d7"}},{"ruleId":"D2","level":"warning","message":{"text":"main.quick_sort (cognitive 19): main.quick_sort has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/quick-sort-3way-1k/main.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5222ab85d7f104c69912e34b7526521ddb37f3753ad2479e37d689978c6ce0c"}},{"ruleId":"D2","level":"warning","message":{"text":"notify-release-failure.main (cognitive 19): notify-release-failure.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 6, error handling 3, ternaries 2 (3 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/notify-release-failure.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc90825acc3c65b89d06ee832101cde9d4d896211e808c86fc3dc9e3062b4f6"}},{"ruleId":"D2","level":"warning","message":{"text":"show_rust_lints.read_workspace_members (cognitive 19): show_rust_lints.read_workspace_members has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), ternaries 1 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/tools/show_rust_lints.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"697385f4dd9976dbf32828ddd91d1bded8e7a3f12c1941436434051bcbd09117"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_go.isJSONBAMLType (cognitive 19): baml_go.isJSONBAMLType has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 6, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/json.go"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f37b2b4969fb38d05a5f6431bbd651d7c45cce78a215188c5b9e2d52408a541"}},{"ruleId":"D2","level":"warning","message":{"text":"kpis.html.standing (cognitive 19): kpis.html.standing has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 11 (14 pts), boolean chains 5 (nesting depth added 3). Of this number, 10 points are the body\u0027s own statements and 9 belong to 3 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/src/speedtest/templates/kpis.html"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb64bf732d6953b9eb166f6bc2a6e371c7d7e4d422d1144d49ea6b7151ce1ff"}},{"ruleId":"D2","level":"warning","message":{"text":"index.testMixedOptionalNullable (cognitive 19): index.testMixedOptionalNullable has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, if/else 9. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/optional_nullable/typescript/index.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d44a96ea906bd8f9440570df6cd3ef27de264ee6eaf3b63401b5af9483e1c6"}},{"ruleId":"D2","level":"warning","message":{"text":"elk-mermaid.buildHierarchicalElkNodes (cognitive 19): elk-mermaid.buildHierarchicalElkNodes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 2 (6 pts), boolean chains 5, loops 1 (nesting depth added 8). Of this number, 13 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. 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":"typescript/packages/playground-common/src/features/graph/layout/node/algorithms/elk-mermaid.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ef90f2935daf3babdcf95955a2beb8b8b376c85af2b368067d342dd31511a2"}},{"ruleId":"D2","level":"warning","message":{"text":"index.GroupNode (cognitive 19): index.GroupNode has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 13, boolean chains 6. Of this number, 17 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/nodes/GroupNode/index.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a50a620872bc1d00415c00134397f64c3a88d5675d1bcc94687489f5e8e360"}},{"ruleId":"D2","level":"warning","message":{"text":"page.LoginContent (cognitive 19): page.LoginContent has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (6 pts), boolean chains 5, error handling 3 (4 pts), ternaries 3 (4 pts) (nesting depth added 3). Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to 3 function items inside it that branch (handlePasskeySubmit, a function literal at line 40, handleGitHubLogin). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/login/page.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"af703b94c16b355e154df5e7d17b8b26f06ecc9aecc6a6bbaf11c612db78bcad"}},{"ruleId":"D2","level":"warning","message":{"text":"page.UsersPage (cognitive 19): page.UsersPage has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (7 pts), ternaries 3, error handling 1 (nesting depth added 1). Of this number, 11 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/users/page.tsx"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ee45a541af8623ca77ac8cefe847c94923c5d29e34572519fc6f9764dcfde9"}},{"ruleId":"D2","level":"warning","message":{"text":"app.App (cognitive 19): app.App has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 7, error handling 2, ternaries 1. Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 705, 643, 588, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-type-quiz/src/app.tsx"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a0b01d04f7cd02bb432bcb6bbbab97640d710c67c91c006c2090b756214238"}},{"ruleId":"D2","level":"warning","message":{"text":"FeedbackWidget.FeedbackForm (cognitive 19): FeedbackWidget.FeedbackForm has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (12 pts), boolean chains 5, error handling 1, if/else 1 (nesting depth added 6). Of this number, 11 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. 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":"typescript2/app-website/app/(home)/bamlcode/_components/FeedbackWidget.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"685f9e1386fdf782a637dc7ce9170baf91991f9ab913ac0ad68bc99899c871cc"}},{"ruleId":"D2","level":"warning","message":{"text":"tracker.Vertical (cognitive 19): tracker.Vertical has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 11 (16 pts), boolean chains 3 (nesting depth added 5). Of this number, 12 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. 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":"typescript2/app-website/components/home/tracker.tsx"},"region":{"startLine":2038}}}],"partialFingerprints":{"codehealthFindingId/v1":"c908403c0f46b8391cdd9a1b8a9c9cf518ae4d52200a5157ef715df094cbdff5"}},{"ruleId":"D2","level":"warning","message":{"text":"hyperobs.Timeline (cognitive 19): hyperobs.Timeline has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 7 (8 pts), if/else 7, boolean chains 4 (nesting depth added 1). None of this is in the body itself: all 19 points belong to 6 function items inside it that branch (a function literal at line 1369, a function literal at line 1453, a function literal at line 1355, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/hyperobs.tsx"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"172fc408f3d61d9c2c78529a9aaf11bef1432bf1e44c696754db84d8d8db2f3c"}},{"ruleId":"D2","level":"warning","message":{"text":"default-function-selection.selectLongestWorkflowFunctionName (cognitive 19): default-function-selection.selectLongestWorkflowFunctionName has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (4 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/default-function-selection.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"58bb3197d232d7c1fcfb0ef50e75553707dee7799f968b0c465e662f37078f65"}},{"ruleId":"D2","level":"warning","message":{"text":"evidence.parseErrorValue (cognitive 19): evidence.parseErrorValue has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), error handling 2 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/evidence.ts"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b478c2a9047a0685361307cc6996d3e232c91d21dde6c6f1414f6d224ada2eb"}},{"ruleId":"D2","level":"warning","message":{"text":"TelemetryView.ExecutionDetail (cognitive 19): TelemetryView.ExecutionDetail has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (16 pts), boolean chains 2, if/else 1 (nesting depth added 10). Of this number, 17 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"34517c25218df165a41c35dc816157b4f51036b034ea059cd6ca29fc0123e011"}},{"ruleId":"D2","level":"warning","message":{"text":"TelemetryView.TimingsTab (cognitive 19): TelemetryView.TimingsTab has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 7 (10 pts), boolean chains 4, if/else 4, match/switch 1 (nesting depth added 3). Most of this is not in the body itself: 5 of the 19 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 2316, 2355, 2302, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":2282}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c0ff36c0ae42e16fde1d4a0a08771719fe36e8523e740995f58f1577edad50"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_base::escape::scan (cognitive 18): baml_base::escape::scan has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_base/src/escape.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3501f5eaa12fbc6cb956eed7a1f8c88f335eb5c4c23e72dd33c5f8f1aa89ff"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_builtins2_codegen::codegen::call_arg_for_type (cognitive 18): baml_builtins2_codegen::codegen::call_arg_for_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (7 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_builtins2_codegen/src/codegen.rs"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed12fb6f3fb076d38eb0142e87da97093357d239c2246b2c5a82e827e0d6ff3"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_builtins2_codegen::codegen_io::emit_runtime_io_handles (cognitive 18): baml_builtins2_codegen::codegen_io::emit_runtime_io_handles has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (7 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs"},"region":{"startLine":2371}}}],"partialFingerprints":{"codehealthFindingId/v1":"948cf9cb5ba6638ae1ac3063d7d3c6017566d8d52e342ef4428641357f686c46"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_builtins2_codegen::extract::extract_from_implements_for (cognitive 18): baml_builtins2_codegen::extract::extract_from_implements_for has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (5 pts), loops 2 (3 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":"baml_language/crates/baml_builtins2_codegen/src/extract.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba37474517132a320a0b2412437b8eb5c386147206ad2e68a74d6d02d94240b9"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_emit::stack_carry::simulate_stack_consuming_aggregate (cognitive 18): baml_compiler2_emit::stack_carry::simulate_stack_consuming_aggregate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 4, boolean chains 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":"baml_language/crates/baml_compiler2_emit/src/stack_carry.rs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b67b7802cce9e646510bbdb8e95578479b045ac66c159b98295baedf81c755"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticIndexBuilder::validate_function_phase1 (cognitive 18): SemanticIndexBuilder::validate_function_phase1 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir/src/builder.rs"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d6f9508d3674c4c3994f5b69f59db2e2f9d226b667a88b352ce8c376d6ab1a"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::confirm_unique_impl (cognitive 18): InferenceContext::confirm_unique_impl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer/obligations.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4285d556c5442c45ec4143deef0e5f046fc53f20ee1a7ee7f0e8a6948aea3fb"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::probe_impl_member (cognitive 18): InferenceContext::probe_impl_member has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer/obligations.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b8e7c0d4dd4403fc29a4dcfaab3152bb263fc90b504d8a9bbf03b628d12f42"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::dispatch_operator (cognitive 18): InferenceContext::dispatch_operator has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (9 pts), loops 2 (4 pts), boolean chains 3, if/else 2 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":5748}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8983dbb7ced59982321279d2b11fecc08cc96a6479835de32efa8dd7dbba1d"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::defaults::collect_default_expr_forward_references_in_template_segments (cognitive 18): baml_compiler2_hir_ty::defaults::collect_default_expr_forward_references_in_template_segments has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 2 (5 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/defaults.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce1107e36f4436082b8740c3e9fe2f7b4bff5a87fac97b899eca40f8add86a4"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::globals::describe_cycle (cognitive 18): baml_compiler2_hir_ty::globals::describe_cycle has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/globals.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"895fae9c559154ebbb1054a1a0f2df9e7b50ea75a7c2a0ba782599f17f77eb47"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::lower::function_generic_bounds (cognitive 18): baml_compiler2_hir_ty::lower::function_generic_bounds has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (7 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":2182}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b68410b93de543dcd508123bfdb8414ceba7ce0e18a7b1383d8891b7e0530c6"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::package_interface::bind_locators (cognitive 18): baml_compiler2_hir_ty::package_interface::bind_locators has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/package_interface.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"57db01d8dd5d0f2025ea8aaa8c5d9b423798306490297e64aedb5dab5fd6e177"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_mir::escape::array_iterators (cognitive 18): baml_compiler2_mir::escape::array_iterators has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/escape.rs"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac7b58247e070828aaa26d8dc09e84aaa83272df91dc1febcd724a66c40aaf8"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_rust::admit::admission_fixpoint (cognitive 18): baml_compiler2_rust::admit::admission_fixpoint has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 2 (6 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_rust/src/admit.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e09bc5ede85a4abe7fbe1b9c9eed018bf84f0ac02a7e1f2e4649e57f01f629c"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_rust::analysis::value_reprs (cognitive 18): baml_compiler2_rust::analysis::value_reprs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_rust/src/analysis.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fbede857f4ea9dad6f63ca4770abf3e78a6798e0ab559669848965b64096c6"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_fmt::ast::types::function_type_single_line (cognitive 18): baml_fmt::ast::types::function_type_single_line has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/types.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c4292c7350910117fc0a3b7a2284a61d3f3a82db94fd92ae62ad1d6e00b29e"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::describe::collect_type_expr_deps (cognitive 18): baml_ide::describe::collect_type_expr_deps has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (baml_ide::describe::collect_type_ref_deps) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/describe.rs"},"region":{"startLine":2096}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e248df1bf915b1ee1ae5f418e79034b2d5620a14cd11666afbb0c9839cca52"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::describe::collect_type_ref_deps (cognitive 18): baml_ide::describe::collect_type_ref_deps has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident. This shape REPEATS in the file: one other method here (baml_ide::describe::collect_type_expr_deps) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/describe.rs"},"region":{"startLine":2157}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fc88fff9a48cf96b8690dbd4b94f1820fa20a528fd1ecbb019800675ff59d6"}},{"ruleId":"D2","level":"warning","message":{"text":"LspRuntime::record_applied_document (cognitive 18): LspRuntime::record_applied_document has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, match/switch 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":"baml_language/crates/baml_lsp_server/src/lsp_runtime.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"500e83861dee67c2778b024e634c2bda7b940afc3a68046adccc5f655cdfd26b"}},{"ruleId":"D2","level":"warning","message":{"text":"PlaygroundTelemetry::open_execution (cognitive 18): PlaygroundTelemetry::open_execution has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (4 pts), match/switch 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":"baml_language/crates/baml_lsp_server/src/playground_btel.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7ef54d551ff0b6391a791ae1a703d673b3d8160e1944d7b6aa1be5e281a060"}},{"ruleId":"D2","level":"warning","message":{"text":"PlaygroundHttp::_send (cognitive 18): PlaygroundHttp::_send has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 3 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/playground_http.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15608904756507c802850dc5aa2d532f329e0d71548f1259975db3c876d025f"}},{"ruleId":"D2","level":"warning","message":{"text":"NativePlaygroundSender::send_playground_notification (cognitive 18): NativePlaygroundSender::send_playground_notification has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 1 (nesting depth added 9). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/playground_sender.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8439a9881929fe69e52693c23836c4a0557eb6003e3a15b8977165e7e5132e"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_query_btel::store::write_statistics (cognitive 18): baml_query_btel::store::write_statistics has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/store.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c03625ded982d383e65122fd8e304bfb6a947d23b129b4b9d4fede3d9d3a7bb"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_sdkgen_types::output_writer::legacy_csharp_owned_files (cognitive 18): baml_sdkgen_types::output_writer::legacy_csharp_owned_files has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, match/switch 2, loops 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":"baml_language/crates/baml_sdkgen_types/src/output_writer.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff3541120e442bdf3874af60912391b88e80882c584e77c9227aedc4ebd3c50"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_type::normalize::mu::cyclic_states (cognitive 18): baml_type::normalize::mu::cyclic_states has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (4 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":"baml_language/crates/baml_type/src/normalize/mu.rs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf723420e900ae97f9b37b6b64e23bee653c90bdcede723a91f3ab71be99a49"}},{"ruleId":"D2","level":"warning","message":{"text":"BexWork::run (cognitive 18): BexWork::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/bex_work.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"5774e0530cf3994ef98f015322f847c79948b92cabcc656de8efd881b7964ca6"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_engine::conversion::heads_match_their_kind (cognitive 18): bex_engine::conversion::heads_match_their_kind has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/conversion.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f9245a152e1d34516746a740fddf3e0d7c6bd41cc164a8215bb38084fc847b"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeCtx::convert_ty (cognitive 18): TypeCtx::convert_ty has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (6 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/sap_model/convert.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df47f1d92e22a357ef00d461a4e99495e3739edf15e41b2136a0333ee179bd2"}},{"ruleId":"D2","level":"warning","message":{"text":"MapTy::coerce (cognitive 18): MapTy::coerce has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (11 pts), loops 2 (4 pts), if/else 2 (3 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_map.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f56052a574a6b816ccf6fed9265986641f10663c5ee5a12b9f025dcb857b3b"}},{"ruleId":"D2","level":"warning","message":{"text":"PackageReflectImpl::functions (cognitive 18): PackageReflectImpl::functions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/reflect.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5cdd0a81f6a864abc7dd66299359f42a192b2a20b34b1a9fdbe51670da01b49"}},{"ruleId":"D2","level":"warning","message":{"text":"PackageReflectImpl::_field (cognitive 18): PackageReflectImpl::_field has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (6 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f94db56310e608f3f7dd0ce4f3714a64fa9a4d99eb83cfade1bc50d764fb53"}},{"ruleId":"D2","level":"warning","message":{"text":"Recording::publish (cognitive 18): Recording::publish has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/telemetry/manual.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba82923591bf4c6b22d70af0a055b62cbb81e63303c86518617c41c34f70b352"}},{"ruleId":"D2","level":"warning","message":{"text":"BexVm::value_concrete_ty (cognitive 18): BexVm::value_concrete_ty has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 5 (7 pts) (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":4441}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d1942f2b753c56ce7967b8bab809f68cc0628eb50eed18719f1d91c0a3dd3a"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_baml::json::decode::first_invalid (cognitive 18): bex_vm::package_baml::json::decode::first_invalid has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/json/decode.rs"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85fd12f5cc6647e9867e98a446c2f905e7b23e14f349b3aa2ca645536fa1541"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_reflect::reflect::call_any_impl (cognitive 18): bex_vm::package_reflect::reflect::call_any_impl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/reflect.rs"},"region":{"startLine":2188}}}],"partialFingerprints":{"codehealthFindingId/v1":"26cb3f45663d6ff5da605400dea525a6858b21d476418dbc4f98ab3972f21756"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_reflect::type_class::render_witness_sources (cognitive 18): bex_vm::package_reflect::type_class::render_witness_sources has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/type_class.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9f50f81fbf074347adf70199da451d8cc522cb07ac3a7cd7e28bd777b97637"}},{"ruleId":"D2","level":"warning","message":{"text":"bridge_ctypes::value_decode::decode_inbound (cognitive 18): bridge_ctypes::value_decode::decode_inbound has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 3 (6 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_ctypes/src/value_decode.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf3a0c192e2b34e46e62a855ba6411ce254a4fe1e44b0eecf28be5f5b96654f"}},{"ruleId":"D2","level":"warning","message":{"text":"Span::visit (cognitive 18): Span::visit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_reader/src/value/span.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"7abebedef2fda0d0471f17a23399c434c47acf16492d2c1e4962835e42f54bbf"}},{"ruleId":"D2","level":"warning","message":{"text":"sys_native::io_impls::run_process (cognitive 18): sys_native::io_impls::run_process has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 4 (8 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c660902758e64699ea8b9df2a657976cd1df477b3605133ffde6482fc960c23"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_stow::check_dependency_restrictions (cognitive 18): cargo_stow::check_dependency_restrictions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"5371909f53751d4eb17ad7a82783c39c616a31c52c1598759158060563556f92"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_java::emit::render_class (cognitive 18): sdkgen_java::emit::render_class has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, loops 3, match/switch 2 (3 pts), boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/sdkgen_java/src/emit.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c71e9f35fd19cab362be6c8a65a1ce44fc167be237f90f1b30384d585e5e93"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_swift::compute_boxed_fields (cognitive 18): sdkgen_swift::compute_boxed_fields has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/rust/sdkgen_swift/src/lib.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb92e0e476ef81a384988499c4728d2193f018c2d3c901a3eaf78685f94e6e2"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_swift::emit::render_recursive_union_alias (cognitive 18): sdkgen_swift::emit::render_recursive_union_alias has cognitive complexity 18 (threshold 15). Drivers by points: loops 10 (11 pts), if/else 4 (7 pts) (nesting depth added 4). 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":"baml_language/sdks/swift/rust/sdkgen_swift/src/emit.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"de21724fbb317582c75a8361b2d8f9b2fed3c5e71edd3c366d3e96d11e3e2000"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_swift::translate_ty::slot_expr (cognitive 18): sdkgen_swift::translate_ty::slot_expr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/rust/sdkgen_swift/src/translate_ty.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0a195b77137afbbe674dcc1ef13613dae7d37543219e982469d4894bb13251"}},{"ruleId":"D2","level":"warning","message":{"text":"Expression::to_doc (cognitive 18): Expression::to_doc has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/hir/dump.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4d5df42a31b302524d8bb1cf48d0d79310192fafd3802d114fdb16a6d9eca1"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphBuilder::classify_and_filter_headers (cognitive 18): GraphBuilder::classify_and_filter_headers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/baml_vis/graph.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca99afa3c7012ba11fc599c7471dfb9f1288df9630abe350c08b2023f14593c"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_core::ir::repr::specialize_generics (cognitive 18): internal_baml_core::ir::repr::specialize_generics has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (8 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/ir/repr.rs"},"region":{"startLine":3104}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dccc5ce254674a580c8b91d89344280f3cb1c045aacbf67dbc254f16c2bbc07"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_core::validate::validation_pipeline::validations::expr_fns::validate_expr_fns (cognitive 18): internal_baml_core::validate::validation_pipeline::validations::expr_fns::validate_expr_fns has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (5 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/expr_fns.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50a30ac257a355d819c81fe51c63e35666041ff18dd5d24a9b6caea41654bdd"}},{"ruleId":"D2","level":"warning","message":{"text":"LiteralValue::coerce (cognitive 18): LiteralValue::coerce has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 3 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/deserializer/coercer/coerce_literal.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"877caec9000a486bb1473296256601f05632c1ea905f8f58a8931865a720b251"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplState::dump_thir (cognitive 18): ReplState::dump_thir has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 6 (nesting depth added 6). 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":"engine/baml-runtime/src/cli/repl.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae00f2a10d3bbd9f04cdacc28cdb460ccb644a23fde3c342ae8fd1407366b27b"}},{"ruleId":"D2","level":"warning","message":{"text":"AwsClient::build_converse_body_json (cognitive 18): AwsClient::build_converse_body_json has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 3 (6 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78a79335bdde1129c84523c154dc912aa249e42b863ddb6178ec1814d12e821"}},{"ruleId":"D2","level":"warning","message":{"text":"RawPtrTypeDefinitions::parse (cognitive 18): RawPtrTypeDefinitions::parse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f31bba65d863e26f87da298f906794e66786b7c377f67bfd9e879c202d4214"}},{"ruleId":"D2","level":"warning","message":{"text":"HotReloader::start_stdin_forwarding (cognitive 18): HotReloader::start_stdin_forwarding has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (6 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/tools/src/bin/language-server-hot-reload.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f630a6a8d05e82ae8eb131659e4004a050cc488995f9a45a5249596abcbd2d05"}},{"ruleId":"D2","level":"warning","message":{"text":"ProtoWriter.unify (cognitive 18): ProtoWriter.unify has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 1 (3 pts), boolean chains 2, ternaries 1 (2 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoWriter.java"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6dac266870fdf433fe61a34dd18ff6ee2c2c80c74863b09e8294876aac334d1"}},{"ruleId":"D2","level":"warning","message":{"text":"profiler._collect_addresses (cognitive 18): profiler._collect_addresses has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), error handling 1 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/src/speedtest/profiler.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"520025dfcb489d8690f0ca534b1de53571ecef1f43a40d8225e3f59e3f862647"}},{"ruleId":"D2","level":"warning","message":{"text":"main.run_conversation (cognitive 18): main.run_conversation has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 4 (8 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/programs/agent-loop-300/main.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ddf6e4515b4e759b6d94b67cc37c4b6949807ef34ec77f2f1cfe8055305b73f"}},{"ruleId":"D2","level":"warning","message":{"text":"main.test_large_structure (cognitive 18): main.test_large_structure has cognitive complexity 18 (threshold 15). Drivers by points: loops 8 (12 pts), if/else 4 (6 pts) (nesting depth added 6). 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":"engine/generators/data/edge_cases/python/main.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac08e7a997f0d130b26d90d658cd03ea0a195ae4f42b94790851325b6810986b"}},{"ruleId":"D2","level":"warning","message":{"text":"Value.ClassWithTypeArgs (cognitive 18): Value.ClassWithTypeArgs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2, boolean chains 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":"baml_language/sdks/go/baml_go/class.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5b27fd314b5cd40525744d6adfa6f4de2d63ee918ec6a652874cc6e37a0e42"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_go.downloadBamlLibrary (cognitive 18): baml_go.downloadBamlLibrary has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15 (18 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/baml_go/lib_common.go"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"694907d7b6b7f462289d7b761d0c46ad3209fc08482a04983da5811911ea5b74"}},{"ruleId":"D2","level":"warning","message":{"text":"main.conversations (cognitive 18): main.conversations has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (7 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/programs/agent-loop-300/main.js"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d5a758c542f95fc339a4a8dc98a9d378127133b5e1165407a0adc57f49f320"}},{"ruleId":"D2","level":"warning","message":{"text":"index.testSimpleMaps (cognitive 18): index.testSimpleMaps has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 6. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/map_types/typescript/index.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba53faba95f121d1c86862e33d7e1e4a6c8da8fb7663999a331d05caf6b15b2"}},{"ruleId":"D2","level":"warning","message":{"text":"index.testDeeplyNested (cognitive 18): index.testDeeplyNested has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 6. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/nested_structures/typescript/index.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"e305159f65a5c88d1df289ad4932b0f320dd49b417904a87d16c573ad3c6f2c2"}},{"ruleId":"D2","level":"warning","message":{"text":"edge.getPathWithRoundCorners (cognitive 18): edge.getPathWithRoundCorners has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (10 pts), if/else 6 (7 pts), loops 1 (nesting depth added 5). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to one function item inside it that branches (getRoundCorner). 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":"typescript/packages/playground-common/src/features/graph/layout/edge/edge.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be9d26664f65fd43e5dc2a9122d008a72cf231eef1af74359509bd371ba2441"}},{"ruleId":"D2","level":"warning","message":{"text":"message-handlers.handleWorkspaceCommand (cognitive 18): message-handlers.handleWorkspaceCommand has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 2 (3 pts), boolean chains 2, ternaries 1 (2 pts), match/switch 1 (nesting depth added 7). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"typescript/packages/playground-common/src/baml_wasm_web/message-handlers.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f440689732afbcc1065471487b32f470e782468e4ef619d2b703686c1995e5be"}},{"ruleId":"D2","level":"warning","message":{"text":"elk-mermaid.layoutELKMermaid.edges (cognitive 18): elk-mermaid.layoutELKMermaid.edges has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 7, ternaries 1 (2 pts) (nesting depth added 5). Of this number, 13 points are the body\u0027s own statements and 5 belong to 3 function literals inside it that branch. 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":"typescript/packages/playground-common/src/features/graph/layout/node/algorithms/elk-mermaid.ts"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"55725c16f9f33f1563c1c22a2025748827618a7f7762d60ca49d1f53063b745a"}},{"ruleId":"D2","level":"warning","message":{"text":"a-star.getAStarPath (cognitive 18): a-star.getAStarPath has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/edge/algorithms/a-star.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfa29f3733bf6c8be6e10df0d894d0186f24713a834999a5e9a2a5c89f333fe"}},{"ruleId":"D2","level":"warning","message":{"text":"useEdgeDraggable.useEdgeDraggable (cognitive 18): useEdgeDraggable.useEdgeDraggable has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, loops 2, ternaries 2 (nesting depth added 2). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 6 function items inside it that branch (onDragging, onDragStart, onDragEnd, \u2026). 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":"typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/useEdgeDraggable.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3661b5eeef22e50b1bd8bdd8d96df0dfd4b6f2bae9b241f09f06d0110e4587"}},{"ruleId":"D2","level":"warning","message":{"text":"code-mirror-viewer.CodeMirrorViewer (cognitive 18): code-mirror-viewer.CodeMirrorViewer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, boolean chains 3, error handling 2 (3 pts), ternaries 3 (nesting depth added 1). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 243, 416, 147, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/codemirror-panel/code-mirror-viewer.tsx"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6926970cb1877c3ba41537d2728525c5481042688fe47d115d67650ce6fb414"}},{"ruleId":"D2","level":"warning","message":{"text":"webview-media.getFileFormat (cognitive 18): webview-media.getFileFormat has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (18 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb991da3cacc6bfdf8f056dfc3682f2ae2ec9163f72a37061e81af3bf7c9ca7b"}},{"ruleId":"D2","level":"warning","message":{"text":"prompt-preview-content.PromptPreviewContent (cognitive 18): prompt-preview-content.PromptPreviewContent has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 3 (6 pts), boolean chains 3, error handling 1 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/prompt-preview-content.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab8a4680bab86cf01d94c8ddb7973d826ceff762ced4ec3fb97044f02b8f9dd"}},{"ruleId":"D2","level":"warning","message":{"text":"prompt-search-bar.PromptSearchBar (cognitive 18): prompt-search-bar.PromptSearchBar has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 3). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 31, handleKeyDown, a function literal at line 51, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/prompt-search-bar.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"20debba6da9fe5394b940f30d0074b6a3b13f6487c17c394e7bf86e72cc486a5"}},{"ruleId":"D2","level":"warning","message":{"text":"issue-list.IssueList (cognitive 18): issue-list.IssueList has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 9 (12 pts), boolean chains 6 (nesting depth added 3). Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 124, 125, 126, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/components/issues/issue-list.tsx"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ee3d03301d7b40fa263acfe3cfe412e9fa197dfa85edaa0fa4e89b7b399d75"}},{"ruleId":"D2","level":"warning","message":{"text":"baml-reference.DocCard (cognitive 18): baml-reference.DocCard has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 11 (16 pts), boolean chains 2 (nesting depth added 5). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"typescript2/app-website/app/(home)/bamlcode/_components/baml-reference.tsx"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8b0151e46ee33984bdbbca33c40fb3bee4f85ed277a2fcffe529e8ec4a29af"}},{"ruleId":"D2","level":"warning","message":{"text":"vscode.VSCodeMock (cognitive 18): vscode.VSCodeMock has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 10 (11 pts), boolean chains 7 (nesting depth added 1). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/vscode.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6db2371ee4e13df3657837972342ff90354e2c6047041f507ba013e485720c"}},{"ruleId":"D2","level":"warning","message":{"text":"convert-videos.findVideoFiles (cognitive 18): convert-videos.findVideoFiles has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (17 pts), ternaries 1 (nesting depth added 9). Of this number, 12 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. 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":"typescript2/app-website/scripts/convert-videos.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4a71ac24a07c71e097f3a9060b6e58271b85bd95522705a4a858cc0367d3a5"}},{"ruleId":"D2","level":"warning","message":{"text":"convert-videos.processBatch (cognitive 18): convert-videos.processBatch has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (10 pts), error handling 2 (4 pts), if/else 2 (3 pts), loops 1 (nesting depth added 9). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 437, 461, 470). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/scripts/convert-videos.ts"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"a265e59fcb0ee2daf920b046ffc5508a29d23961467122b16fb9f3972d81c469"}},{"ruleId":"D2","level":"warning","message":{"text":"args-form-model.defaultValue (cognitive 18): args-form-model.defaultValue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (5 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/args-form-model.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8d96b225d4fb11b1a30f103c84bcc3bc820c2cc3fcdfe8721e2761773e3078"}},{"ruleId":"D2","level":"warning","message":{"text":"function-sidebar-tree.buildFunctionSidebarTree (cognitive 18): function-sidebar-tree.buildFunctionSidebarTree has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 6). Of this number, 14 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. 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":"typescript2/pkg-playground/src/function-sidebar-tree.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2230dd8c8d06e4b8ed2a649d26afd74a9a37ec01cd2c458668c0ea8442b966d"}},{"ruleId":"D2","level":"warning","message":{"text":"WireDepth.TypeFits (cognitive 17): WireDepth.TypeFits has cognitive complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Proto/WireDepth.cs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"459346ac98644e0c4ed1333799747a5dc905066a8689484b12e7de84315cc7eb"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_base::escape::decode_escape (cognitive 17): baml_base::escape::decode_escape has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 4 (7 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_base/src/escape.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f160d16272f4d201b71e700fb41babb22bc60b04059b67b74771ed8de161bf3"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_builtins2_codegen::codegen_io::compute_non_defaultable_classes (cognitive 17): baml_builtins2_codegen::codegen_io::compute_non_defaultable_classes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 7). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce1b9335add76bd58425f72afe663e8bcd64cc352d21d61dea1efa71ddc16da"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_builtins2_codegen::codegen_io::emit_result_conversion_for_ty (cognitive 17): baml_builtins2_codegen::codegen_io::emit_result_conversion_for_ty has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (3 pts) (nesting depth added 9). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs"},"region":{"startLine":2720}}}],"partialFingerprints":{"codehealthFindingId/v1":"337da123ce4acbdc68dfb9cda638f26bdfa89d13d863001e8cd3da7d44cb5770"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_cli::describe_command::minimum_full_output_budget (cognitive 17): baml_cli::describe_command::minimum_full_output_budget has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 6 (nesting depth added 6). 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":"baml_language/crates/baml_cli/src/describe_command.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6d8eba1ffdf54ce61ae703a0ba4f65a5a53e3f531ce2b8873f33746f001153"}},{"ruleId":"D2","level":"warning","message":{"text":"StackifyCodegen::patch_jumps (cognitive 17): StackifyCodegen::patch_jumps has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (6 pts), match/switch 2 (5 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/emit.rs"},"region":{"startLine":2802}}}],"partialFingerprints":{"codehealthFindingId/v1":"33adae78abf1d3cda213bafe94d305327c1d52c7b483eef0833343f0fbe8bdf1"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_emit::analysis::rematerializable (cognitive 17): baml_compiler2_emit::analysis::rematerializable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 3, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/analysis.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cacd045ab0028ba6c4c52a15c023eb3c52881379890e0fb44dab3c635e338b8"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_emit::analysis::is_call_result_aggregate_operand (cognitive 17): baml_compiler2_emit::analysis::is_call_result_aggregate_operand has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/analysis.rs"},"region":{"startLine":1998}}}],"partialFingerprints":{"codehealthFindingId/v1":"967a4610e76bb61d31d589d42e9aef4c4231767efaed9acea796a5c4074009fc"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_emit::package::finish::fill_class_methods (cognitive 17): baml_compiler2_emit::package::finish::fill_class_methods has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/package/finish.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f663cfff43028ae853ecd9275968ed2dc37bfe462754364b57c700e0b1d1147"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_emit::pull_semantics::resolve_constant_function_item_inner (cognitive 17): baml_compiler2_emit::pull_semantics::resolve_constant_function_item_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 3 (6 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/pull_semantics.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a253d93ec3fd6ce64c705e5f92c7b8415a053874a8fcba39021081b7f653c3e"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_emit::stack_carry::simulate_statement_stack (cognitive 17): baml_compiler2_emit::stack_carry::simulate_statement_stack has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 2 (7 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"baml_language/crates/baml_compiler2_emit/src/stack_carry.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece958abfc497f3d24afc23299893984f2747509e04a73174fcbc6287058ffd9"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir::body_type_refs::collect_body_type_refs (cognitive 17): baml_compiler2_hir::body_type_refs::collect_body_type_refs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 2 (4 pts), loops 3, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir/src/body_type_refs.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"328675032feb5b7455ce4bd6b16aef8dbe411753a48c92e402ecc9ed6d7eb987"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::lower_pattern_inner (cognitive 17): InferenceContext::lower_pattern_inner has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (7 pts), loops 2 (5 pts), if/else 1 (4 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"76118336a62d37c2f5ed33369362e23339117e8a55070c1755650f5b5c44f341"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::instantiation_args_at (cognitive 17): InferenceContext::instantiation_args_at has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":9192}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12805326819977c46d09f615e45ad9549e9fd3db98ce74a8b52ba3383efac38"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::structurally_resolve (cognitive 17): InferenceContext::structurally_resolve has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 2 (6 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":14884}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51a4e6cd793643bfe6466907eb370b613ed957b30dfcebceff551d09e0c9d50"}},{"ruleId":"D2","level":"warning","message":{"text":"Walk::always_null (cognitive 17): Walk::always_null has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 pts), boolean chains 2, 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":"baml_language/crates/baml_compiler2_hir_ty/src/llm_output.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"803ff3ffa9d8b357e54ca210b16b3947e70babc20f6da40584409c3227781ac8"}},{"ruleId":"D2","level":"warning","message":{"text":"LowerCtx::lower_type_ref_inner (cognitive 17): LowerCtx::lower_type_ref_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c0de233efe8618853f23a4651af5fabadedc8a44d9440e57156632d5d3b5e5"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::globals::global_init_deps (cognitive 17): baml_compiler2_hir_ty::globals::global_init_deps has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 5 (7 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/globals.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10c5af3f3f8fe161f3e436c38031c1da772910da0456831b8b6d3bafce7138b"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::method_resolution::lookup_union_member (cognitive 17): baml_compiler2_hir_ty::method_resolution::lookup_union_member has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 3 (6 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/method_resolution.rs"},"region":{"startLine":1785}}}],"partialFingerprints":{"codehealthFindingId/v1":"3960bb4bbfd1a34e2b30c6859c586839c485bc8826dfdbf8203b38bacb1deabf"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::terminator (cognitive 17): Walker::terminator has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (6 pts), boolean chains 5, loops 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 4). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/escape.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"010c4a3d8ec4b92375e7eb0b9ccb3b3563553779180acf4e7ab7fea05c81d13b"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::verify_bindings_recorded (cognitive 17): LoweringContext::verify_bindings_recorded has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (6 pts), boolean chains 1, match/switch 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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":2919}}}],"partialFingerprints":{"codehealthFindingId/v1":"17fe2cb14576ecd1b235b629e59a076e04229ea73c6ed35c10330f6d91fcd8a7"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::build_tagged_body_closure (cognitive 17): LoweringContext::build_tagged_body_closure has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3, match/switch 1 (nesting depth added 4). 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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":5513}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcec544f31bd50b90180182f2e2b452778536b1ab42a7279eb9df6c1d56bd138"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::bind_pattern_inner (cognitive 17): LoweringContext::bind_pattern_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":14370}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5a6acd4b070029be7c26ca38f639fbd51e8dd440ca69a71a0ee6ca99931b8e"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_mir::optimize::values::simplify_boolean_diamonds (cognitive 17): baml_compiler2_mir::optimize::values::simplify_boolean_diamonds has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/optimize/values.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"601d455467d0e22d814d1f89c616353e291b124ec64d6bfb1fb34e4e064662ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator::constant (cognitive 17): Generator::constant has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (5 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_rust/src/codegen/constant.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b829f3ee3b57415fb76819a2ca0ee508b4f6154d20ac7be6a27b2975eb020d13"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator::request (cognitive 17): Generator::request has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_rust/src/codegen/mod.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed6aada91b64e401daeb6c84237f1d9fee3d099f6a4bc5616a2edef633621af"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler_diagnostics::render::render_agent (cognitive 17): baml_compiler_diagnostics::render::render_agent has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler_diagnostics/src/render.rs"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ca28f2e83ac53f2c60ccb1992577f3931f011d9e540d3d3ccde554736fa2f2"}},{"ruleId":"D2","level":"warning","message":{"text":"Walk::token (cognitive 17): Walk::token has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, 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":"baml_language/crates/baml_ide/src/tokens.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"67981fd860a8b4c673b5b2ac3d23787d098df5ab54433f26f7c3c64c35976160"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_lsp_server::decode_lsp_message (cognitive 17): baml_lsp_server::decode_lsp_message has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/lib.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"024838f665a246f828ec19dbdac96a9ee0fb4ca4ea0e3991569ab19ea8287b4a"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_parser::items::enum_def (cognitive 17): baml_parser::items::enum_def has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e359be41ff4214255d5dd727ceb063ed3c62e441e0c886113edab2bc5c3c48"}},{"ruleId":"D2","level":"warning","message":{"text":"Applier::function (cognitive 17): Applier::function has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f94f725a9e368a5228ff885bcb324a5913d82781adb12a6ffd8e3c4f2871eb2"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_sdkgen_types::output_writer::collect_unknown_files_in (cognitive 17): baml_sdkgen_types::output_writer::collect_unknown_files_in has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_sdkgen_types/src/output_writer.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba1180b680f8d16ac0b6b33f13b6b59823624a8dfaf399c18e884117c816a31"}},{"ruleId":"D2","level":"warning","message":{"text":"Id::print (cognitive 17): Id::print has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":1908}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e8c4cbf791c4f068e3c6f9cddb6c3381f9c6ad96a4b0c5f58990a85b2a60fd"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_type::json_inhabit::has_empty_value_within (cognitive 17): baml_type::json_inhabit::has_empty_value_within has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/json_inhabit.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"2faafa80a70a48c41f55b17fa1cba27e8b0fca8852e0f8cc76cea47ca0a420de"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_type::normalize::mu::convert (cognitive 17): baml_type::normalize::mu::convert has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 3 (5 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/normalize/mu.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"15db4c53b904a7af8c13e987df434f57fb8b164dc1a30b49ca09ae1bccc07c87"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_type_macros::interned_member::interned_ty (cognitive 17): baml_type_macros::interned_member::interned_ty has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 1 (nesting depth added 4). 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":"baml_language/crates/baml_type_macros/src/interned_member.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e61bce05d1a02b0bcdaeddf1f4a46bb803b666d1a1d4a7c4d6f59ff5cea6672"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_type_runtime::absorbed_type_vars (cognitive 17): baml_type_runtime::absorbed_type_vars has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 2 (5 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type_runtime/src/lib.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ab0c564aa0eb226b81fad8a1df7ec40fbd9c063ff0f96a93fe0fa29d94d4e5"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_events::history::path::find_boundary_dir (cognitive 17): bex_events::history::path::find_boundary_dir has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_events/src/history/path.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19d041c9822273e8919d4a74e985f9fe904801492d17c169cf34cfd0ebeae94"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_sap::deserializer::coercer::coerce_class::class_from_entries (cognitive 17): bex_sap::deserializer::coercer::coerce_class::class_from_entries has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_class.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d02f2b26785bcd6846a6d1875e304eab435e34ee3a3a565d8554bbf6e8473f5"}},{"ruleId":"D2","level":"warning","message":{"text":"BexVm::begin_error_evidence (cognitive 17): BexVm::begin_error_evidence has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 4, match/switch 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm/error_evidence.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"e942441d107216471eee1182ed9edaf284c575a04642a04fa2472080376a490b"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::debug::display_bytecode_expanded (cognitive 17): bex_vm::debug::display_bytecode_expanded has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 4 (7 pts), boolean chains 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/debug.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"1638e06de907795101f327b3b39415e5061ec11da1b6a8fbaba21f6f8260e362"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_reflect::runtime_class_builder::build_group (cognitive 17): bex_vm::package_reflect::runtime_class_builder::build_group has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 5 (6 pts), match/switch 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3bf841d869385e061732fc1072557256afc70945318bccd066acc510ed46c5"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_reflect::type_kinds::enum_row (cognitive 17): bex_vm::package_reflect::type_kinds::enum_row has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 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":"baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"987ddd5eafd0922c6f7c493199caafebe27d07088f49b0f193545bf57c4b006d"}},{"ruleId":"D2","level":"warning","message":{"text":"bridge_cffi::control_projection::clone_outbound::clone_refs (cognitive 17): bridge_cffi::control_projection::clone_outbound::clone_refs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 pts), match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_cffi/src/control_projection.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82ae9f4e33e6d8c5b9b60e772ded970b85b3114a925b921838cf92d89a34237"}},{"ruleId":"D2","level":"warning","message":{"text":"bridge_cffi::invocation_protocol::validate_fields (cognitive 17): bridge_cffi::invocation_protocol::validate_fields has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (4 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":"baml_language/crates/bridge_cffi/src/invocation_protocol.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f736fa9291ba0772e3add8fa9712982a6f2d6c5364151e3a5ff7b4f70197fe3"}},{"ruleId":"D2","level":"warning","message":{"text":"bridge_ctypes::invocation::release_outbound_references (cognitive 17): bridge_ctypes::invocation::release_outbound_references has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 pts), match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_ctypes/src/invocation.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3def86e7fe22dbef38324c272d31d290f3fe42c132fa88f82cd908ea184db83b"}},{"ruleId":"D2","level":"warning","message":{"text":"CloudPublisher::service (cognitive 17): CloudPublisher::service has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_bcs/src/publisher.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c21b88206cbe7ed0a315fbcd99767500825acb646ea2f44baf6b55baf7909d"}},{"ruleId":"D2","level":"warning","message":{"text":"btel_bcs::plan::validate_proposal (cognitive 17): btel_bcs::plan::validate_proposal has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (3 pts), boolean chains 2, 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":"baml_language/crates/btel_bcs/src/plan.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04eca3d4ca7a91b5d1abda816e2b63efe8d7b2c83c66e31d87872a6f3887f4a"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::object (cognitive 17): Builder::object has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_reader/src/value/equality.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"03798abb7dea25d2cadf530ae4d003ba1b67e095669346b565a9e1f74e7914cf"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_size_gate::output::print_fix_hint_md (cognitive 17): cargo_size_gate::output::print_fix_hint_md has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (7 pts) (nesting depth added 9). 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":"baml_language/crates/tools_size_gate/src/output.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9044ef0f5e8579fbc48bd4d02d62e411a27a84b1ea7387d258a9ea6d7d1bac8"}},{"ruleId":"D2","level":"warning","message":{"text":"CSharpFileRoutes::allocate_with_hashers (cognitive 17): CSharpFileRoutes::allocate_with_hashers has cognitive complexity 17 (threshold 15). Drivers by points: loops 9 (15 pts), if/else 1 (2 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/sdkgen_csharp/src/routing.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1705e805f275e6d04a84660f67a7f08872f4d4ad609901b8e2718b53d76f1ad"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_csharp::semantic::collect_classes (cognitive 17): sdkgen_csharp::semantic::collect_classes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6c7d3720b0b63c8c51f3b3c35ea1c647557808f454bdcf5da9a1b1cda2a88c"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_csharp::semantic::render_returned_callable_wrappers (cognitive 17): sdkgen_csharp::semantic::render_returned_callable_wrappers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":7036}}}],"partialFingerprints":{"codehealthFindingId/v1":"77da628dacb7bf4af9454228bdc0618a248c37bb29a8c410611aaf24dbcc5e82"}},{"ruleId":"D2","level":"warning","message":{"text":"PyValue::shape (cognitive 17): PyValue::shape has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, boolean chains 3. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/bridge_python/src/encode.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"76bb6d4718728bab31c4fe62bc3d160ef73aa0aefbcebdd6423a8468ff74bec2"}},{"ruleId":"D2","level":"warning","message":{"text":"bridge_python::host_value::discard_host_call_args::discard (cognitive 17): bridge_python::host_value::discard_host_call_args::discard has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/bridge_python/src/host_value.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b22e7c60127d7becac3eaaeacc0507b99612129eb41067d0175498618958d70"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_swift::render_supported_class (cognitive 17): sdkgen_swift::render_supported_class has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 4, 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":"baml_language/sdks/swift/rust/sdkgen_swift/src/lib.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaad9fcb4f5c1a72aad550636ca93d6e0a53023ed01fc094c3609b1192d3f0ac"}},{"ruleId":"D2","level":"warning","message":{"text":"IRHelperExtended::distribute_type_with_meta (cognitive 17): IRHelperExtended::distribute_type_with_meta has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0a8b79c800741a11de319dd9107a8afbc75afcde3f147e0f28198d4c03265c"}},{"ruleId":"D2","level":"warning","message":{"text":"internal_baml_core::validate::validation_pipeline::validations::cycle::insert_required_class_deps (cognitive 17): internal_baml_core::validate::validation_pipeline::validations::cycle::insert_required_class_deps has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/cycle.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7b49cf9fc2bd1a5b7d3b6ca7a14a61aacfa0b695a34f678ea1631c816adb2b"}},{"ruleId":"D2","level":"warning","message":{"text":"DeliveryThread::run (cognitive 17): DeliveryThread::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/tracing/threaded_tracer.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd63ae01865f131a67abb7f3ad6dcdb4b5b2056b7555f5602c0f57f102f900b"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_runtime::internal::llm_client::primitive::openai::response_handler::scan_openai_responses_stream (cognitive 17): baml_runtime::internal::llm_client::primitive::openai::response_handler::scan_openai_responses_stream has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2, boolean chains 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/openai/response_handler.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"90fda866c55cb0288e1ee4af303eeb91b3a988f80580ec675d5ce20b3ff391cc"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_runtime::optimize::tui::format_compact_metric (cognitive 17): baml_runtime::optimize::tui::format_compact_metric has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 1 (nesting depth added 4). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/tui.rs"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6aca1a165cc81bc72807c9900ced1558f38361c9068dc3d74b055f951907838"}},{"ruleId":"D2","level":"warning","message":{"text":"WasmRuntime::get_function_at_position (cognitive 17): WasmRuntime::get_function_at_position has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":1667}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8fea1f7bfb7a3df7f636961fa52b9f9d441177c138ecd75aa180c8e419216f"}},{"ruleId":"D2","level":"warning","message":{"text":"boundary_udf::yaml2jinja::rebuild_from_flattened (cognitive 17): boundary_udf::yaml2jinja::rebuild_from_flattened has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 2 (4 pts), loops 1 (nesting depth added 9). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"engine/boundary-udf/src/yaml2jinja.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"d973434d5a24fd69d9c7f433c1d0080d6310b2676644ed200dc5713cc9d1df88"}},{"ruleId":"D2","level":"warning","message":{"text":"language_server::baml_project::common_version_up_to_patch (cognitive 17): language_server::baml_project::common_version_up_to_patch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/baml_project/mod.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c093ddce9345d39fc4c51648eebb39e123a61966a2dc79cd2a89d5fb7f4485"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlValue::baml_decode (cognitive 17): BamlValue::baml_decode has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (7 pts), if/else 3 (6 pts), loops 2 (4 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"languages/rust/baml/src/codec/baml_value.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81e7ea43cd125e9bdc7c47556599500adf56a4e462375312dbe7cfe5c14840e"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlType.compareTo (cognitive 17): BamlType.compareTo has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 2 (nesting depth added 4). 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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlType.java"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a31cf52b4ef2ee78f1b7fee2b73ba4d59c335c853db3a439d7662f058b01fb"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_bridge._build_type_args (cognitive 17): baml_bridge._build_type_args has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (9 pts), if/else 4 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/src/baml_bridge/__init__.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b1f5e4b67dd39670ffe7eec9d446f05b656c6f24bfc43dbd63666c89e4852b"}},{"ruleId":"D2","level":"warning","message":{"text":"profiler._count_samples (cognitive 17): profiler._count_samples has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/src/speedtest/profiler.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd3f0c3e74930fc5555ef5a8a521d0bc3bbb61b909976dff32fc32ea27beaa2"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.notify (cognitive 17): cli.notify has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 5, ternaries 1 (3 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bctl_src/oncall/cli.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c88bec0f88c4e99435a0b4a6aa59dff5f389e7ad2d261fce5ef2cfe46d8d21"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlMedia.construct (cognitive 17): BamlMedia.construct has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 1 (2 pts), match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/Media.swift"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"752b2cbb1bf179c6eb3e40080c38fec7330795a98887b1880ee5f53852b0b473"}},{"ruleId":"D2","level":"warning","message":{"text":"main.runConversation (cognitive 17): main.runConversation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (7 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/programs/agent-loop-300/main.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffef5b17ad3a457581db3f2ef476bcc3674415074daf7c79e41e28bea27b496b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.testNestedMaps (cognitive 17): index.testNestedMaps has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 8. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/map_types/typescript/index.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"49db4e0e1addba4c7f8bcdfc4a65cd38b0b6c0a29aa6de7cab54c789cc5f4afb"}},{"ruleId":"D2","level":"warning","message":{"text":"index.testOptionalFields (cognitive 17): index.testOptionalFields has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 8. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/optional_nullable/typescript/index.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7f610a986c179e0394187949db41409cd8ee9551c510abed5665993e95827a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.testMixedPrimitives (cognitive 17): index.testMixedPrimitives has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 8. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/primitive_types/typescript/index.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb7605eca98ebcc720f569b30314620369eed78a869261e0e505e7e2295d2a4"}},{"ruleId":"D2","level":"warning","message":{"text":"index.testComplexUnions (cognitive 17): index.testComplexUnions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 8. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/union_types_extended/typescript/index.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6683a6d55fb8e063fdfc02bdf219c73ae34df9efe6bbfdffcbfe9d9d55183b87"}},{"ruleId":"D2","level":"warning","message":{"text":"index.DiamondNode (cognitive 17): index.DiamondNode has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 10, boolean chains 5, if/else 2. Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to 3 function items inside it that branch (getStateStyle, a function literal at line 119, a function literal at line 105). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/nodes/DiamondNode/index.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5616fa2e69241b6ae1aec7e1d62dd49d67aec009b981d01f5ccd99e77fcaa0f2"}},{"ruleId":"D2","level":"warning","message":{"text":"users.upsertGitHubUser (cognitive 17): users.upsertGitHubUser has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/users.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1becd380ad22364e20ba13eeb93df42193a0fd5a259691682f36fc466dd367"}},{"ruleId":"D2","level":"warning","message":{"text":"route.GET (cognitive 17): route.GET has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7, ternaries 3 (6 pts), error handling 3, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/beps/route.ts"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1a4c19a57236f2dafb12718cdee5752eac3249bccbcec2c7fa6d80100df9ae"}},{"ruleId":"D2","level":"warning","message":{"text":"comment-thread.CommentThread (cognitive 17): comment-thread.CommentThread has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, if/else 4, ternaries 2, error handling 1. Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 453, 483, 479, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-thread.tsx"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"865d8ed3f8fc7f24ab345dc6b7340c3f9c0f5451182879d3a53993609a0873d9"}},{"ruleId":"D2","level":"warning","message":{"text":"export-utils.generateReadme (cognitive 17): export-utils.generateReadme has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 7). Of this number, 13 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. 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":"typescript2/app-beps/src/lib/export-utils.ts"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"21456176fe8bfb9bc1ddf52f8ab7029e02e8d2dff8706d21b28c1dbd63f19fa7"}},{"ruleId":"D2","level":"warning","message":{"text":"export-utils.generateAgentContext (cognitive 17): export-utils.generateAgentContext has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 10 (12 pts), boolean chains 5 (nesting depth added 2). Of this number, 9 points are the body\u0027s own statements and 8 belong to 6 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/export-utils.ts"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae04116c1098d6f7c73e472c29224dc5d1dfa3a01941c56d08fe93e2c2ed0913"}},{"ruleId":"D2","level":"warning","message":{"text":"generated-cli.CliCommandContent (cognitive 17): generated-cli.CliCommandContent has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 10 (17 pts) (nesting depth added 7). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 70, 95). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/components/generated-cli.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a6222a8db4230de2638255c92b1cdbfcca668a6fb326068878ddc008b6246d"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch-luma-eap.listEvents (cognitive 17): fetch-luma-eap.listEvents has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/jobs/fetch-luma-eap.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"215d458ab47c554586a0aacc3ecb9f65b5de8495e89fb653ff5328be201f3f06"}},{"ruleId":"D2","level":"warning","message":{"text":"send-slack-report.captureDashboardOnce (cognitive 17): send-slack-report.captureDashboardOnce has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 1 (2 pts), boolean chains 1, error handling 1, loops 1 (nesting depth added 4). Of this number, 12 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. 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":"typescript2/app-product-metrics/src/jobs/send-slack-report.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"f283def08b18abc7a4ecb28ae18f345d994ba49114e8957262a4f4f57a838afd"}},{"ruleId":"D2","level":"warning","message":{"text":"ProblemsBoard.ProblemsBoard (cognitive 17): ProblemsBoard.ProblemsBoard has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 8, boolean chains 4, if/else 4, loops 1. Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 53, 122, 44, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_components/ProblemsBoard.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a82754cc0ca0edf9dc489a2ed359b37a787881f6fba4bd86f202cd493b84fb"}},{"ruleId":"D2","level":"warning","message":{"text":"rehype-highlight-code.rehypeHighlightCode.\u003Creturned closure\u003E (cognitive 17): rehype-highlight-code.rehypeHighlightCode.\u003Creturned closure\u003E has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, ternaries 2, loops 1 (nesting depth added 2). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 22, 30, 49). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/rehype-highlight-code.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e578692abda3101743fa5e1188cdecb70473108dafb0bd0e9895873c195b5ea"}},{"ruleId":"D2","level":"warning","message":{"text":"rehype-preserve-code-props.rehypePreserveCodeProps.\u003Creturned closure\u003E (cognitive 17): rehype-preserve-code-props.rehypePreserveCodeProps.\u003Creturned closure\u003E has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 3). None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 24). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/rehype-preserve-code-props.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"634d1ad926114c0b5e65b55cf19038e467ca64ef6af13b2dac828bce558c14b1"}},{"ruleId":"D2","level":"warning","message":{"text":"route.POST (cognitive 17): route.POST has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, ternaries 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/api/completion/route.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"054205d307ae0e023342c1ef5d2a41f90b9a32421f7f38479b9b33f5e8e1ec9a"}},{"ruleId":"D2","level":"warning","message":{"text":"architecture.Lanes (cognitive 17): architecture.Lanes has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 8 (9 pts), boolean chains 8 (nesting depth added 1). None of this is in the body itself: all 17 points belong to 2 function items inside it that branch (a function literal at line 1813, side). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/adopt/architecture.tsx"},"region":{"startLine":1793}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0137aeb34a3eed43dcc6a1390c51de2dfb32b31c7602765c5785b8ce51e047"}},{"ruleId":"D2","level":"warning","message":{"text":"tracker.Reveal (cognitive 17): tracker.Reveal has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 10 (13 pts), boolean chains 4 (nesting depth added 3). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 1821, 1808, 1799). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/tracker.tsx"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e7c28eb78c3f08d9fc1394434c50d19e00256e058c9742cc29d56abdf7fbd7"}},{"ruleId":"D2","level":"warning","message":{"text":"improve.Collage (cognitive 17): improve.Collage has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7, if/else 6, boolean chains 4. None of this is in the body itself: all 17 points belong to 7 function literals inside it that branch (lines 831, 730, 790, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/improve.tsx"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e6619e0dfcd7d21d49b3d17d6fb3c4485471f5e272fe9efcc4b7600c2f1b86"}},{"ruleId":"D2","level":"warning","message":{"text":"new-post.generatePost (cognitive 17): new-post.generatePost has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 10 (11 pts), if/else 3 (4 pts), boolean chains 1, error handling 1 (nesting depth added 2). Of this number, 12 points are the body\u0027s own statements and 5 belong to 4 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/scripts/new-post.ts"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"6558b50ab5977f4cfa22bd41d775a714878097d50e0408c5af93e0dcbedeecc9"}},{"ruleId":"D2","level":"warning","message":{"text":"FunctionSidebar.FunctionSidebar (cognitive 17): FunctionSidebar.FunctionSidebar has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 11, ternaries 4, if/else 2. Of this number, 16 points are the body\u0027s own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/FunctionSidebar.tsx"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee725910e0f880045749271942edb6995cc18a8b9006ba63b1dc84c2bc2052f"}},{"ruleId":"D2","level":"warning","message":{"text":"run-await.awaitRunCompletion (cognitive 17): run-await.awaitRunCompletion has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, error handling 1 (2 pts), loops 1 (nesting depth added 4). 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":"typescript2/pkg-playground/src/run-await.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"525d148561447e8a7e4d9bb9fe3b021d06fd04f182e7f4e781adedd99aaf2066"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeCallbacks.OnResult (cognitive 16): NativeCallbacks.OnResult has cognitive complexity 16 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Cffi/NativeCallbacks.cs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8e842fe090de23c32477c1fc542a0937359703c42b1851e652a4d0b36fa88b"}},{"ruleId":"D2","level":"warning","message":{"text":"LiveHeads.Map (cognitive 16): LiveHeads.Map has cognitive complexity 16 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Proto/LiveHeads.cs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"80501949fe093bcf941bebc17d202879b9d82fbc00d85eff2518c518606e9da8"}},{"ruleId":"D2","level":"warning","message":{"text":"PrimitiveProtocol.DecodeStreamPull (cognitive 16): PrimitiveProtocol.DecodeStreamPull has cognitive complexity 16 (threshold 15). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Proto/PrimitiveProtocol.cs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2c925a92dc76c21f0be421b74b030412702cb22c457ec2796a83aae1aa0d43"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlValue.From (cognitive 16): BamlValue.From has cognitive complexity 16 (threshold 15). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Values/BamlValue.cs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3c953e2392d59f6ddb08fb5df26169a8cc68afe6b2e886f01f7895caa6e58c"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlValue.TryGet (cognitive 16): BamlValue.TryGet has cognitive complexity 16 (threshold 15). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Values/BamlValue.cs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8bb23e1574e34b23a9bace87b292debb53c48fd947c571c60ca6ab2aba73bc0"}},{"ruleId":"D2","level":"warning","message":{"text":"RunArgs::run_prepared_target (cognitive 16): RunArgs::run_prepared_target has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/run_command.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c958a5e6425eb1ce284bf6a09374767575d1eb79a4b838bb06c0edf06c99e2"}},{"ruleId":"D2","level":"warning","message":{"text":"RunArgs::run_expression (cognitive 16): RunArgs::run_expression has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), match/switch 6 (7 pts), boolean chains 2 (nesting depth added 2). 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":"baml_language/crates/baml_cli/src/run_command.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c473c87372a34a398c2aef7cd0c0dc8303ed91c35c2e93a7b1298766c11240"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_ast::lower_expr_body::synthesize_llm_spec_body (cognitive 16): baml_compiler2_ast::lower_expr_body::synthesize_llm_spec_body has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 3, match/switch 2, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"b097511c6da6d1e30bd51c73104a4a7c3d96b2728fd40614d45245e048dc70b0"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_ast::lower_type_expr::lower_from_type_name_with_generic_args (cognitive 16): baml_compiler2_ast::lower_type_expr::lower_from_type_name_with_generic_args has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 3 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/lower_type_expr.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b0efaa947430eeb5d1fc889b48f848ca77cfeeeb04afc6155a0fd2b27f63dc"}},{"ruleId":"D2","level":"warning","message":{"text":"StackifyCodegen::try_emit_class_aggregate_field_copy_sets (cognitive 16): StackifyCodegen::try_emit_class_aggregate_field_copy_sets has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/emit.rs"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"96468edcf608722e92bf1943b463a6be9ac3b9d1754712d1fcb15ab415dfbd79"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_emit::package::bodies::emit_bodies_parallel (cognitive 16): baml_compiler2_emit::package::bodies::emit_bodies_parallel has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 2 (5 pts), loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/package/bodies.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4369c34803b447420fe07d6ba46f9c73596544d8e403c206edbaed9cb8abc5"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_emit::package::bodies::merge_item (cognitive 16): baml_compiler2_emit::package::bodies::merge_item has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2, boolean chains 1, match/switch 1 (nesting depth added 4). 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":"baml_language/crates/baml_compiler2_emit/src/package/bodies.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2c58a0be3a69a8b12013d7cb63a5eae40dbf517479f071acb9f0a9b505b51d"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_emit::package::finish::emit_tail (cognitive 16): baml_compiler2_emit::package::finish::emit_tail has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (5 pts), match/switch 1 (3 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":"baml_language/crates/baml_compiler2_emit/src/package/finish.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e6e0c25e8a33427bc44ecb2da4b311650d4ade189247255250c10238717ccf"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::pattern_informative_ty (cognitive 16): InferenceContext::pattern_informative_ty has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c0e15b0245c8073137d97e69b59c246ac8acbdef64ae86f121222f0c093e32"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::type_pattern_outcome_inner (cognitive 16): InferenceContext::type_pattern_outcome_inner has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"0855407f5c590d957dcd245c6a9285373aaee57869b5f9ca8781857858b97dda"}},{"ruleId":"D2","level":"warning","message":{"text":"InferenceContext::union_member_access (cognitive 16): InferenceContext::union_member_access has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":10243}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ef03e7033ad1b2a6b975c41813ed81c38748a5a633d75fc5876cfe2bf8c3c4"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::impls::match_impl_head (cognitive 16): baml_compiler2_hir_ty::impls::match_impl_head has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 2 (4 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/impls.rs"},"region":{"startLine":1976}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c3ed83d05f999ef4fc0d4f98904f4fdd85c932ee44f791976b5926a3f43422"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::impls::match_pattern (cognitive 16): baml_compiler2_hir_ty::impls::match_pattern has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 4 (5 pts), match/switch 2 (3 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/impls.rs"},"region":{"startLine":2130}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd56cf8ef36110963bd7b998fb6f9e4c1374f56f68ce345d4db49d0fb45f9e46"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::interfaces::interface_closure_locs_with_args_and_assoc (cognitive 16): baml_compiler2_hir_ty::interfaces::interface_closure_locs_with_args_and_assoc has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 2 (6 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"07aff643de66df6cd684a9dcb06856df42b0ad847b424c2fe2ca20057a21ce50"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::interfaces::check_head_args (cognitive 16): baml_compiler2_hir_ty::interfaces::check_head_args has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs"},"region":{"startLine":1709}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d15466b9bebbcd6bf5e6c1f2e03835b1a2465e9b0dace9be0478ff2be19aa19"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_hir_ty::interfaces::impl_rules::impls_for_type (cognitive 16): baml_compiler2_hir_ty::interfaces::impl_rules::impls_for_type has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79da67fa1796d484c88e963eac1f81a45ba17cb129c0fb47521e9f7242ccc2c"}},{"ruleId":"D2","level":"warning","message":{"text":"LoweringContext::try_lower_interface_item_call (cognitive 16): LoweringContext::try_lower_interface_item_call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":3501}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0a0cfc42354806e0ed17c7d8c0afab6b2f743c43b5848d1aecabf4041784b1"}},{"ruleId":"D2","level":"warning","message":{"text":"Facts::branch (cognitive 16): Facts::branch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 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":"baml_language/crates/baml_compiler2_mir/src/optimize/effects.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2ff4584de80181c4737fdab26d07c9fd9d02d1618c7a9e3a969be695f0a4d4"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler2_rust::analysis::read_only_after_load (cognitive 16): baml_compiler2_rust::analysis::read_only_after_load has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 5, if/else 2 (5 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_rust/src/analysis.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3cd68fca3c3718a37a8a37b26d72ac9578de8fe1068b7418732aa1692606af"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_db::manifest::unknown_field_warnings (cognitive 16): baml_db::manifest::unknown_field_warnings has cognitive complexity 16 (threshold 15). Drivers by points: loops 9 (13 pts), if/else 2 (3 pts) (nesting depth added 5). 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":"baml_language/crates/baml_db/src/manifest.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"265ff41845b4024bb8e84d5bca9128c765554bdfc1cf02ab20d092ef49e063d2"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_fmt::ast::expressions::array_single_line (cognitive 16): baml_fmt::ast::expressions::array_single_line has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":2062}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a377fb72fdeb9ac520757ef970052fcb40d1b45ef64a061d30e41161a45ad2"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_fmt::ast::expressions::object_single_line (cognitive 16): baml_fmt::ast::expressions::object_single_line has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 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":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":2381}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd417ec37d10b1bc4126b9be24353e30203d97e1ad48af3187860278d0134a4"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::describe::describe_item_member (cognitive 16): baml_ide::describe::describe_item_member has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/describe.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe2dbca5226dfe8992cf6bfefa089ae25eb84c6b9b841e15e946f13c3ae1109"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_ide::describe::find_dependencies (cognitive 16): baml_ide::describe::find_dependencies has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 4 (7 pts), match/switch 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/describe.rs"},"region":{"startLine":2020}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ff3830b4914d7fa3f3e4f071b93f341ec2204a063a666a76f9521dba1fcf4e"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_lsp_server::playground_server::drain_logs_and_broadcast (cognitive 16): baml_lsp_server::playground_server::drain_logs_and_broadcast has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (6 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b0374bf01bd8cfc2124990d87aa5c08518a49fe4da277cd7962dbe56a388fe"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_parser::items::param (cognitive 16): baml_parser::items::param has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa799719d145a8f39bef2d134d954e6c6478080cb81a76b535b2b0f33d541aa0"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_parser::types::type_primary (cognitive 16): baml_parser::types::type_primary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_parser/src/types.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"da14cf3d0922717ef3ceff169aba19fe0fbb7e18fb41b700424a14ecd9026bf6"}},{"ruleId":"D2","level":"warning","message":{"text":"Translator::table_factor (cognitive 16): Translator::table_factor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/sql.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe67b4881ba394354c93b96d7d49b6f5c3a2602fcf6aaf68a5fe19325590bc5"}},{"ruleId":"D2","level":"warning","message":{"text":"Translator::binary (cognitive 16): Translator::binary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 4). 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":"baml_language/crates/baml_query_btel/src/sql.rs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"7361b4a2dcb9544391a65a655e9073db98286698769106adcb2fb4eb3d4a9f56"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_syntax_macros::token_table::parse_variant (cognitive 16): baml_syntax_macros::token_table::parse_variant has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_syntax_macros/src/token_table.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"92334329b4eba3200e3277ea6be26cd931b0fe9046e6b34b3c2f092757796153"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_type::decl_cycles::extract_type_alias_deps::visit (cognitive 16): baml_type::decl_cycles::extract_type_alias_deps::visit has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 2 (3 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/decl_cycles.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e146b7bd38b9666e80744616a65158e2b04b027e18273c6a7c0b5a59f71e7b3"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_type::normalize::mu::epsilon_sccs (cognitive 16): baml_type::normalize::mu::epsilon_sccs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/normalize/mu.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29c05a70a601eda5ca2dd71ea6cabf636ab4b8a1ad5e0b7bd032446a6321ebe"}},{"ruleId":"D2","level":"warning","message":{"text":"BexEngine::runtime_type_overlay (cognitive 16): BexEngine::runtime_type_overlay has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":2534}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4770b29bb9f8751818f8a25ae92e9493b6a3064573053143196003aecc4532"}},{"ruleId":"D2","level":"warning","message":{"text":"Flag::fmt (cognitive 16): Flag::fmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"382e6ba726ad733914b0f073b678d0a41aff061bd30b6557d5ee1c301c637918"}},{"ruleId":"D2","level":"warning","message":{"text":"ValueVisitor::visit_map (cognitive 16): ValueVisitor::visit_map has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/value.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4502151069eb34285a5e0d0234174c265bc8150b74fad65fe9d151362231f6a"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeValue::try_cast (cognitive 16): TypeValue::try_cast has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 8 (14 pts), if/else 2 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/deserializer/coercer/coerce_primitive.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d245180b39fd9d43d81a9fbfa97e6b7f16ab8c3b6a85a57f3bf1de95e8f597c"}},{"ruleId":"D2","level":"warning","message":{"text":"BoolTy::coerce (cognitive 16): BoolTy::coerce has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 3 (6 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"3098c0aceab81485c0c033dbedeba36ea8d7b69a4a77bd68d3d8893be2682e93"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_sap::deserializer::coercer::write_shape_key (cognitive 16): bex_sap::deserializer::coercer::write_shape_key has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80711acee3b47d427d566bf6086c8b43b24d71987ccce8fd89ddb5c3041c078"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptAssembly::finish (cognitive 16): PromptAssembly::finish has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, 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":"baml_language/crates/bex_vm/src/package_baml/prompt.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"34cb4e5e47ddeb6e0fe567b29b036763a5e7bf3ba308c4bacd67937dfdec8959"}},{"ruleId":"D2","level":"warning","message":{"text":"BexVm::any_frame_position (cognitive 16): BexVm::any_frame_position has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm/compiled_rt/record.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd0864d6bd1ef3dfabcc10c0f901f880529989873bed5211d597586afbf6995"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_baml::csv::find_raw_line_end (cognitive 16): bex_vm::package_baml::csv::find_raw_line_end has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac44513cdf6c65cec956a971a665b4e07fa43ad3bcd27ad43f0df614128bb541"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_baml::json::decode::open_class (cognitive 16): bex_vm::package_baml::json::decode::open_class has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/json/decode.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"bddad44cb5b9fa3e5c6d21d518363d3e3e1cd4dd398b3cabda54e11cabb97945"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_baml::json::encode::collect (cognitive 16): bex_vm::package_baml::json::encode::collect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (2 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":"baml_language/crates/bex_vm/src/package_baml/json/encode.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3e4d4f48987629ba13083e1773ca2f5d1e38dad84977fd218a3e3d4df45ea2"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm::package_trace::start_span_impl (cognitive 16): bex_vm::package_trace::start_span_impl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_trace.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"418f6d36b82cfe11576a81842a20285c2b0db1c81b4ee0272e9c71ad42b5317f"}},{"ruleId":"D2","level":"warning","message":{"text":"SwitchDispatch::hashed (cognitive 16): SwitchDispatch::hashed has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (5 pts), boolean chains 1 (nesting depth added 9). 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":"baml_language/crates/bex_vm_types/src/bytecode.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"55299a38d12bbccfc2adee845b37cd212ba7bfd0c9b425a904d986d72ce22da3"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm_types::head_walk::visit_function_heads (cognitive 16): bex_vm_types::head_walk::visit_function_heads has cognitive complexity 16 (threshold 15). Drivers by points: loops 7 (14 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (bex_vm_types::head_walk::visit_function_heads_mut) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm_types/src/head_walk.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e905d89c9fd0167c5895145053d250d164cb49fe7c38337d816e308f0e98385"}},{"ruleId":"D2","level":"warning","message":{"text":"bex_vm_types::head_walk::visit_function_heads_mut (cognitive 16): bex_vm_types::head_walk::visit_function_heads_mut has cognitive complexity 16 (threshold 15). Drivers by points: loops 7 (14 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (bex_vm_types::head_walk::visit_function_heads) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm_types/src/head_walk.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e91b5da18dda13a2694546f26910759ab8e0f9d373606f3e30389dd103f223c"}},{"ruleId":"D2","level":"warning","message":{"text":"Planner::class (cognitive 16): Planner::class has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_encode/src/plan.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa593fac7c18c6bd528d54b47a72b87200dc8553ca303d29e83e8eeb564089da"}},{"ruleId":"D2","level":"warning","message":{"text":"TelemetryRuntime::acquire_snapshot_slow (cognitive 16): TelemetryRuntime::acquire_snapshot_slow has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_processor/src/runtime.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"df167a57f8cf8b625b2c8e6ff22e821158d501bc4a48ba75a4cb68c8eb2e5b47"}},{"ruleId":"D2","level":"warning","message":{"text":"Span::load (cognitive 16): Span::load has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 9). 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":"baml_language/crates/btel_reader/src/value/span.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3fbeb2b4de8cf812c58e6153eebd503dbf9f95ffea8d8ac499185d7c376a06"}},{"ruleId":"D2","level":"warning","message":{"text":"RecordingBuilder::seal (cognitive 16): RecordingBuilder::seal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (14 pts), match/switch 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_recorder/src/recording.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"a588c5e99f5e2e4a51d1e9bc23d2e98b9c8e3d171b75b408e3f5d3b3d83cff54"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldType::attributes (cognitive 16): FieldType::attributes has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (8 pts), if/else 5 (7 pts), loops 1 (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/ir/repr.rs"},"region":{"startLine":1784}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d071777f94ed0b55d28ade8c261e856668b1b4c68940c0e4d66681b233cf5f"}},{"ruleId":"D2","level":"warning","message":{"text":"btel_snapshot::memory::type_bytes (cognitive 16): btel_snapshot::memory::type_bytes has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (7 pts), match/switch 2 (5 pts), if/else 1 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_snapshot/src/memory.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d304bb54fc414d7ec2308302d4fc7d49525541b0697654f253b0d36b1bd007"}},{"ruleId":"D2","level":"warning","message":{"text":"sys_native::installation::read_archive_file (cognitive 16): sys_native::installation::read_archive_file has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_native/src/installation.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0027724a2c7a1b98eba3e939440c96be35834bad97035c4ce27b504eaba0106"}},{"ruleId":"D2","level":"warning","message":{"text":"cargo_stow::check_crate_naming_convention (cognitive 16): cargo_stow::check_crate_naming_convention has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, 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":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"3beece4fb532b46fb6cc11490c041bdc4550e67d03edea250f80c3fab8dcbaa8"}},{"ruleId":"D2","level":"warning","message":{"text":"forked_aws_config::profile::load_profiles (cognitive 16): forked_aws_config::profile::load_profiles has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/forks/aws-config/src/profile.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a835851ca92e7e659f6abade6076984d6f83633565bf82f7dd9248392f886e1a"}},{"ruleId":"D2","level":"warning","message":{"text":"forked_google_cloud_auth::fetch_subject_token (cognitive 16): forked_google_cloud_auth::fetch_subject_token has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 1 (3 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":"baml_language/forks/google-cloud-auth/src/lib.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"007ad3029cf2e6b3a3896d8dd521b6a2251786664911a49062b6aa458616de91"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_cpp::emit_class (cognitive 16): sdkgen_cpp::emit_class has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (7 pts), if/else 2 (5 pts), match/switch 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"959d0e6c45192545354f6d21ea3be2cc50b01a047c093d8585b7d8701861802c"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_csharp::semantic::collect_enums (cognitive 16): sdkgen_csharp::semantic::collect_enums has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f8a76920405a7eddeca88ee848aa21fbf57be2af673d5f162d28b2fa478647"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_csharp::semantic::render_method_argument_builder (cognitive 16): sdkgen_csharp::semantic::render_method_argument_builder has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2, boolean chains 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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":3211}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2d83bec347c7be29ee81e30a3d9290367097a83559c8b19e475da6815df332"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_go::add_projected_type_imports (cognitive 16): sdkgen_go::add_projected_type_imports has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 3 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":2684}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b7e4c38f0aed0b0d30a4d93c9ab40c11f4d28ed69e58a295969b78963c7e70"}},{"ruleId":"D2","level":"warning","message":{"text":"LeafBody::generic_typevars (cognitive 16): LeafBody::generic_typevars has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (14 pts), match/switch 1 (2 pts) (nesting depth added 10). 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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c0ffb71f1ccb3fa1e37f7454a1da5b41202b58646148769c74dc904d988ddc"}},{"ruleId":"D2","level":"warning","message":{"text":"ProtocolCallables::collect (cognitive 16): ProtocolCallables::collect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (6 pts), loops 3 (6 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5bf1cd26acb0e6376f7322cd8a0ba88499756f152c8386d3edeebfdb6c7b6dc"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_rust::analyze::field_deps (cognitive 16): sdkgen_rust::analyze::field_deps has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 2 (5 pts), match/switch 3 (5 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/rust/sdkgen_rust/src/analyze.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"6400d6b2cf2cc9c75ece44c0ba4eeffbe488ae388f87270c19051192d3de58a6"}},{"ruleId":"D2","level":"warning","message":{"text":"sdkgen_typescript_shared::translate_ty::translate_return_ty (cognitive 16): sdkgen_typescript_shared::translate_ty::translate_return_ty has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/typescript/sdkgen_typescript_shared/src/translate_ty.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec76466f61b69bc7b0f9964dcdccffde35f9803db5610e165375f1bc0663df0"}},{"ruleId":"D2","level":"warning","message":{"text":"baml_compiler::thir::interpret::assign_to_expr (cognitive 16): baml_compiler::thir::interpret::assign_to_expr has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 1 (4 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79603d04f0ff7f5009e65728bb87031a9cd736bd78d00abc31471bd2171aa44"}},{"ruleId":"D2","level":"warning","message":{"text":"MermaidGeneratorContext::render_mermaid_graph::emit (cognitive 16): MermaidGeneratorContext::render_mermaid_graph::emit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 2 (4 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/baml_vis/diagram_generator.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d812db600e28c9bcad460b23d5fc22f848db5e5b18331f115c78f732395f343"}},{"ruleId":"D2","level":"warning","message":{"text":"HeaderCollector::visit_expression (cognitive 16): HeaderCollector::visit_expression has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (10 pts), match/switch 2 (4 pts), if/else 1 (2 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/baml_vis/header_collector.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd166c949ce2639aae3a77e7df28f0d140610440ee02da68c1d48ec6ad6be33"}},{"ruleId":"D2","level":"warning","message":{"text":"Stmt::fmt (cognitive 16): Stmt::fmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/stmt.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"57568d266372604522219a739a957dfefb869a0ff668e7d8418bd018ad9d5720"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr::temporary_same_state (cognitive 16): Expr::temporary_same_state has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 11, match/switch 3 (5 pts) (nesting depth added 2). 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":"engine/baml-lib/baml-types/src/expr.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdcc828dcbccdc265896d286a37dc2793491e56589d33423848d942fd7099a0"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeGeneric::to_union_name (cognitive 16): TypeGeneric::to_union_name has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 3 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-types/src/ir_type/mod.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"564e1d1ade9c87b7e9ab53f436a3f2b094499c7caebe2caf6bd5ab20d5f9e1bb"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolvable::fmt (cognitive 16): Resolvable::fmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-types/src/value_expr.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3d0d3e20abc155540865b558338e03c053c1ed3907457687a813115779b7d1"}},{"ruleId":"D2","level":"warning","message":{"text":"UnresolvedRolesSelection::resolve (cognitive 16): UnresolvedRolesSelection::resolve has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 2 (4 pts), match/switch 3 (4 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/llm-client/src/clientspec.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca020658b4557a5c6d515cfb47d61d1c4c339de9ea60c7c1c26ba02f39fe1eb0"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplState::parse_and_evaluate_baml_expression_with_status (cognitive 16): ReplState::parse_and_evaluate_baml_expression_with_status has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/cli/repl.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9b8d3e08ae121aab2730214d07770e9f8e9a921d83d9c18b71f4b5a61dac40"}},{"ruleId":"D2","level":"warning","message":{"text":"App::try_reload (cognitive 16): App::try_reload has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/tui.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17b0ae54433a60657b3dfe55098cdcf9098ab8d2485a7d31e116a35ddef4ee5"}},{"ruleId":"D2","level":"warning","message":{"text":"TypeBuilder::fmt (cognitive 16): TypeBuilder::fmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (4 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":"engine/baml-runtime/src/type_builder/mod.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2d6b7204bd761f1684b0777917b278dc86bd00087c8a8fba0079bfd3079935"}},{"ruleId":"D2","level":"warning","message":{"text":"WasmFunction::run_test_with_expr_events (cognitive 16): WasmFunction::run_test_with_expr_events has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 5, loops 3 (nesting depth added 4). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":2625}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4c8584066d3e406f29aee5b86e6100ab2f0e0e17d7a995bd98f66f0d1822df"}},{"ruleId":"D2","level":"warning","message":{"text":"Watch::link_edge (cognitive 16): Watch::link_edge has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (8 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-vm/src/watch.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab29b8c3a1029852470ee7860f4448dfd9c5ecd0c5593941202958471a75903"}},{"ruleId":"D2","level":"warning","message":{"text":"Watch::unlink_edge (cognitive 16): Watch::unlink_edge has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-vm/src/watch.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba1164e6c1e702c7f62a809152b7d6d991085a039de8bfdcc3d11ab54837063"}},{"ruleId":"D2","level":"warning","message":{"text":"ProtoReader.decodeCallable (cognitive 16): ProtoReader.decodeCallable has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 3, error handling 1 (2 pts), ternaries 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java"},"region":{"startLine":1712}}}],"partialFingerprints":{"codehealthFindingId/v1":"32950e5698a1a19f55bfadd89700676b1fac0e1b6c883ce41520cdad0f4ffca8"}},{"ruleId":"D2","level":"warning","message":{"text":"ProtoReader.decodeFqnWithDesc (cognitive 16): ProtoReader.decodeFqnWithDesc has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 2 (4 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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe580f912fb409c59576780d3ce2fe99a1b0a1c5d1ea2076c90b164c333a7227"}},{"ruleId":"D2","level":"warning","message":{"text":"ProtoReader.selfTypeArms (cognitive 16): ProtoReader.selfTypeArms has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b6e067149c8168a1c1e45bc87926304e0db4356b18572bccb4075423704023"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlType.matchesStructural (cognitive 16): BamlType.matchesStructural has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (6 pts), ternaries 1 (2 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlType.java"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9ac80cee3289d32103020181109b9e30171fa9fef28317f413a7a8222bff15"}},{"ruleId":"D2","level":"warning","message":{"text":"proto._try_rehydrate_host_value (cognitive 16): proto._try_rehydrate_host_value has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 1 (3 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/src/baml_bridge/proto.py"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7400c5c2760971fee921f2809557c6d4f70314feec518bfe31111f66c51f2e6"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.check (cognitive 16): cli.check has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 2 (6 pts), if/else 5, loops 2 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bctl_src/oncall/cli.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9c17069b13728182f5291e754fc1d57d3b08425f1a5fe50e1b13799715a4dc"}},{"ruleId":"D2","level":"warning","message":{"text":"parser._emit_body (cognitive 16): parser._emit_body has cognitive complexity 16 (threshold 15). Drivers by points: loops 7 (10 pts), if/else 2 (6 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bctl_src/oncall/parser.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ab8d59b7272b04614e0bc9c9722b38381c83b3c52d6b5912eecbfe32604c32"}},{"ruleId":"D2","level":"warning","message":{"text":"bump-version.main (cognitive 16): bump-version.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/bump-version.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f38d56c0437eed9efe3458bb366327e6b35ac28a3de640d0be7a4c238ed809"}},{"ruleId":"D2","level":"warning","message":{"text":"btel_query_smoke.main (cognitive 16): btel_query_smoke.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), boolean chains 4, loops 3, ternaries 2, error handling 1 (nesting depth added 2). 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":"baml_language/tools/btel_query_smoke.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"9103082af77e85c393af0c941190d652333c601e7d76f7a224bd5d25c3e62f7a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.testNumberEdgeCases (cognitive 16): index.testNumberEdgeCases has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 6. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/edge_cases/typescript/index.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ce17d4a9939a79e69392aff29e08eb49b52d3884cb3dcfb7051580dff9abe2"}},{"ruleId":"D2","level":"warning","message":{"text":"BamlRuntime.getBAMLFiles (cognitive 16): BamlRuntime.getBAMLFiles has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 3, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). 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":"typescript/packages/playground-common/src/sdk/runtime/BamlRuntime.ts"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6b55ca58134fa36074b018bc0f8545edae15d248acc6cdce8d00412c4a2b43"}},{"ruleId":"D2","level":"warning","message":{"text":"route.POST (cognitive 16): route.POST has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, ternaries 2 (3 pts), boolean chains 2, error handling 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/beps/[number]/comments/reply/route.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b12e71fb0534572c943f73552bdacebe3c49fdf812452ed11b3f33a89b2865"}},{"ruleId":"D2","level":"warning","message":{"text":"page.BcsIssues (cognitive 16): page.BcsIssues has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, ternaries 4 (6 pts), if/else 4 (nesting depth added 2). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 58). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/issues/page.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b98d0781a8af24b9535d3c9de653196027107b4b58f0bc11fe532cca075a045"}},{"ruleId":"D2","level":"warning","message":{"text":"bep-user-stance.BepUserStance (cognitive 16): bep-user-stance.BepUserStance has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 13, error handling 1, if/else 1, ternaries 1. Of this number, 12 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-user-stance.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dcf2e2460fe77f988a66dbd2507299dd1511ab444a3ddc34ee8d0e3eddc0bb3"}},{"ruleId":"D2","level":"warning","message":{"text":"issue-form.IssueForm (cognitive 16): issue-form.IssueForm has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 3, ternaries 3, error handling 1, loops 1. Of this number, 8 points are the body\u0027s own statements and 8 belong to 3 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/issues/issue-form.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1059c79a4920abff21d9615200d3c521909dfdd4fd6a127e3d9a53f160689d"}},{"ruleId":"D2","level":"warning","message":{"text":"bcs-auth.verify (cognitive 16): bcs-auth.verify has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 7, error handling 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/bcs-auth.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac56271f1c667ca02d977a9c5732436142e2b148ac6fe29ad78597cc3cfb9b2c"}},{"ruleId":"D2","level":"warning","message":{"text":"heading-utils.extractHeadings (cognitive 16): heading-utils.extractHeadings has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/heading-utils.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e719b1948f4d938153e23a6e9e8cbff66ea050dfe94a0b737ff6a7485707341b"}},{"ruleId":"D2","level":"warning","message":{"text":"generated-version-switcher.GeneratedVersionSwitcher (cognitive 16): generated-version-switcher.GeneratedVersionSwitcher has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), ternaries 4 (6 pts), boolean chains 2, error handling 1 (nesting depth added 3). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 6 function items inside it that branch (openMenu, a function literal at line 41, a function literal at line 103, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/components/generated-version-switcher.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb51f19bfbcaa60d2c9f5beb46c6b1b17c4661d279a4f1c18d1d0a30af137da"}},{"ruleId":"D2","level":"warning","message":{"text":"issue-detail.IssueDetail (cognitive 16): issue-detail.IssueDetail has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 12, ternaries 4. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/components/issues/issue-detail.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"353b60f4263e49bff5b34f462785c4cf233e7df061ec5bc1a8dc0f0580062ac0"}},{"ruleId":"D2","level":"warning","message":{"text":"discord.loadGuildMemberCounts (cognitive 16): discord.loadGuildMemberCounts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/clients/discord.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6b19c7bfa09eefd1963bf32a7dca062c9413e836cfe9e92361e3f3d157850d"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch-zoom-six-weeks.lumaEvents (cognitive 16): fetch-zoom-six-weeks.lumaEvents has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 3, loops 2 (3 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":"typescript2/app-product-metrics/scripts/fetch-zoom-six-weeks.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10d3eaee10c8ced9ec8db582c26500d6ba6386939bc42c02693a43b840182d7"}},{"ruleId":"D2","level":"warning","message":{"text":"PlaygroundProvider.loadPersistedFiles (cognitive 16): PlaygroundProvider.loadPersistedFiles has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, error handling 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/PlaygroundProvider.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f0fbd49c170220e3754d466d7973e90ee206eea9d4a7fa64198dbe7a6b5aa8"}},{"ruleId":"D2","level":"warning","message":{"text":"app.Reveal (cognitive 16): app.Reveal has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, ternaries 3 (4 pts), if/else 2, error handling 1 (nesting depth added 1). Of this number, 9 points are the body\u0027s own statements and 7 belong to 4 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-type-quiz/src/app.tsx"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cde3c5efeeae1c391a7fd4f40364c73ce3c2ec1a5dbe6a3ab570b223310b91"}},{"ruleId":"D2","level":"warning","message":{"text":"tracker.drawFrame (cognitive 16): tracker.drawFrame has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 6 (7 pts), loops 1, ternaries 1 (nesting depth added 1). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 8 function items inside it that branch (onLamb, a function literal at line 798, a function literal at line 815, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/tracker.tsx"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee44a4c6dd4aed8a3b5d31e2dc93d2f4f157aff0ab8abae83e45c8b086b2073"}},{"ruleId":"D2","level":"warning","message":{"text":"review.Comment (cognitive 16): review.Comment has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 14, boolean chains 1, if/else 1. Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 1097, 1155, 1055, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/review.tsx"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1472395249e616e59016d212022a661d3efdaefc81e1967d512ee34388d3851"}},{"ruleId":"D2","level":"warning","message":{"text":"meter.Images (cognitive 16): meter.Images has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, ternaries 7, if/else 2. Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 384, 299, 425). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/pricing/meter.tsx"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4e4c17a0f11f56334e02c7964f0b3096655ec45a5e5b7b3c9e1fd4f65a9d1e"}},{"ruleId":"D2","level":"warning","message":{"text":"luma.getEapEvents (cognitive 16): luma.getEapEvents has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"typescript2/app-website/lib/luma.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd173b22be739f4f7633fc5b9f805c2b479c54c27aa95b6cee7ea4e45c10a46"}},{"ruleId":"D2","level":"warning","message":{"text":"project-label.projectLabels (cognitive 16): project-label.projectLabels has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (4 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 6). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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":"typescript2/pkg-playground/src/project-label.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"aafc53a99f1a5691d145b2eed39ed96cdae5ff4bb9a4b8a25ccbb203787dba35"}},{"ruleId":"D2","level":"warning","message":{"text":"TelemetryView.ContextTreeRows (cognitive 16): TelemetryView.ContextTreeRows has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, ternaries 6 (7 pts), if/else 1 (nesting depth added 1). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":2985}}}],"partialFingerprints":{"codehealthFindingId/v1":"604ee94c636675f159bcdd4886f0edd5ae23c789d29ce02647641750bb5731ab"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InferenceContext: ClassTooLong \u2014 8200 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), 309 methods, 3 blocks, lines 2114-15923. The bar is 400 significant lines; this is 7800 over it, 20.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":2114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cd4fb8b7b71e35c9a9a72676fa0956b397bd4b3e3d2ffd5266dee68917985d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LoweringContext: ClassTooLong \u2014 7945 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), 300 methods, 15 blocks, lines 1752-15031. The bar is 400 significant lines; this is 7545 over it, 19.86\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f72d90d9f67fd88a5f51ebc5cf65971f001b14dd5d2a197ea6202e042b805f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/infer.rs: FileTooLong \u2014 9788 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 84% of them inside a single declaration: InferenceContext (3 blocks, 2114-15923), declaring 47 free functions. The bar is 500 significant lines; this is 9288 over it, 19.58\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"515e0b494c82f785a53381e9d25ef8d1ba73bb329019dcf54dff73820773be21"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lower.rs: FileTooLong \u2014 9040 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 88% of them inside a single declaration: LoweringContext (15 blocks, 1752-15031), declaring 53 free functions. The bar is 500 significant lines; this is 8540 over it, 18.08\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce94269b6c212116ad401731f51a1c24f73e80e7bc7957df15385fff2ecb220c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BexVm.run_compact: MethodTooLong \u2014 run_compact runs 1765 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 1665 over it, 17.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":9408}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cf3453d6dbc8fd134bd763809385fff48e5de6f86da9f6f9d09ee0adcfe475"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BexVm: ClassTooLong \u2014 6062 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), 451 methods, 4 blocks, lines 1557-12318. The bar is 400 significant lines; this is 5662 over it, 15.16\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":1557}}}],"partialFingerprints":{"codehealthFindingId/v1":"350c3d0de6f0d2aef5fe88957380de219f3c7e8a9f0bd1e55b16c1ee61c158ec"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BexVm: TooManyMethods \u2014 451 methods, declared across 16 files: src/vm.rs (247), compiled_rt/record.rs (43), compiled_rt/heap.rs (30), compiled_rt/call.rs (24), \u002B12 more file(s). The bar is 30 methods; this is 421 over it, 15.03\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":1557}}}],"partialFingerprints":{"codehealthFindingId/v1":"1607b1bf7b69c93c4ca0785368ee1ca4f063b756a8cd99bc38e1d571444af9b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/vm.rs: FileTooLong \u2014 6573 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 92% of them inside a single declaration: BexVm (4 blocks, 1557-12318). The bar is 500 significant lines; this is 6073 over it, 13.15\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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6e62943268b53aaf6e455aa5f634de7163fbd73b06cde8916fc3d4ef9137f0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TirTypeError.render: MethodTooLong \u2014 render runs 1261 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 1161 over it, 12.61\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":"baml_language/crates/baml_compiler2_hir_ty/src/diagnostics.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd60a19452ac0629c2fb2b792c42eb35c0d539573e951d0ddc7bebf12fe010f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.finish: MethodTooLong \u2014 finish runs 1078 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 978 over it, 10.78\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":12717}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc79d7a937f1e1896d2debdb89892ac3d62ff150283b2da4ef4656fe623ecc48"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InferenceContext: TooManyMethods \u2014 309 methods, declared across 5 files: src/infer.rs (237), infer/pat.rs (29), infer/obligations.rs (22), infer/flow.rs (15), \u002B1 more file(s). The bar is 30 methods; this is 279 over it, 10.30\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":2114}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab6a2cc215287fe0be524f0440c425bf6c02b488b51dd5755573de951a8bbcd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LoweringContext: TooManyMethods \u2014 300 methods. The bar is 30 methods; this is 270 over it, 10.00\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e30beaaf1d0db7ea37039df312a39ad8496a581d89f794164cc64c578e038a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BexEngine: ClassTooLong \u2014 3749 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), 154 methods, 3 blocks, lines 1101-7866. The bar is 400 significant lines; this is 3349 over it, 9.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4f4e9141535b39a7b720708c462fe206474f1527e1d8d3cec51f3a6b062b8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 4654 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 81% of them inside a single declaration: BexEngine (3 blocks, 1101-7866). The bar is 500 significant lines; this is 4154 over it, 9.31\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53aab071c44c5659773da7b232e04d1088184861270d43b21168c9884157f3e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler::thir::typecheck::typecheck_expression: FunctionTooLong \u2014 baml_compiler::thir::typecheck::typecheck_expression runs 928 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 828 over it, 9.28\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":"engine/baml-compiler/src/thir/typecheck.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"6192d21707497e8ba7bd1b6e29db471a881e9175989d2f6a5cc0ff9f8454e77a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 4332 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 90 free functions. The bar is 500 significant lines; this is 3832 over it, 8.66\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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa17a707ae3c7bfad4b6e19fa265403275360314ccbc39326b7b3cc2ad9b5ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bep-route-shell.BepRouteShell: FunctionTooLong \u2014 BepRouteShell runs 833 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 733 over it, 8.33\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":"typescript2/app-beps/src/components/bep/bep-route-shell.tsx"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"562964012b5359b9523d0c69a5adc8f63a94eb26bef0265c8838749c4239dbf5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/semantic.rs: FileTooLong \u2014 3900 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 100 free functions. The bar is 500 significant lines; this is 3400 over it, 7.80\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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6cb4ee8402e5a70a03ce578554bc609fd5ac33986a78c4e3fdfcaac2174c5de"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConversionBuffer.span: MethodTooLong \u2014 span runs 780 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 680 over it, 7.80\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":"baml_language/crates/btel_recorder/src/lib.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae6dc59580081a742c80fc9bf03bdf63ef8a9335959a48773395f7cd53bbb58"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler::thir::interpret::evaluate_block_with_control_flow: FunctionTooLong \u2014 baml_compiler::thir::interpret::evaluate_block_with_control_flow runs 655 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 555 over it, 6.55\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":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bbab0049eeb263c8bd80f9a3b186d19f18545fdd14d490506b98ac939f1e6e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: comment-sidebar.CommentSidebar: FunctionTooLong \u2014 CommentSidebar runs 639 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 539 over it, 6.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-sidebar.tsx"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"80894aedeb1075d37d9df2e11fefabf4ba1bf98409a2d69e5db90e46d5f271ca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Vm.exec: MethodTooLong \u2014 exec runs 614 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 514 over it, 6.14\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":"engine/baml-vm/src/vm.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e135a9c8d402e7c16234384902df6a53355fb25755adf0ecd3d90e6ed1d108"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/io_impls.rs: FileTooLong \u2014 2988 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: NativeSysOps (29 blocks, 37-4233), declaring 41 free functions. The bar is 500 significant lines; this is 2488 over it, 5.98\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":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f718c2defbfc5def981d79d601e82523fd15cd7d00190f272628cbe261f3e11"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Hir2Diagnostic.to_diagnostic: MethodTooLong \u2014 to_diagnostic runs 595 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 495 over it, 5.95\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":"baml_language/crates/baml_compiler2_hir/src/diagnostic.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4584d3ca8b32aabcb920655aede1b0b492cec44ef5626d4c0f5e152fbd1e1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml-monarch.registerBaml: FunctionTooLong \u2014 registerBaml runs 581 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 481 over it, 5.81\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":"typescript2/app-website/app/(home)/bamlcode/_lib/baml-monarch.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb108cf32d9c028738160e268c932e9c4ffaca0571a5058d1cd9a4ea5d95bd25"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cargo_stow::generate_dependency_graph_svg: FunctionTooLong \u2014 cargo_stow::generate_dependency_graph_svg runs 562 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 462 over it, 5.62\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":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"201071799320e04b437dc95c64eec1e173ab342b0a520c765753cb68bc212972"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReplArgs.run: MethodTooLong \u2014 run runs 555 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 455 over it, 5.55\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":"engine/baml-runtime/src/cli/repl.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61d13170061de75475fb446bab4d7792f96ce17fe590fd6f545668e3e91d8af"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StackifyCodegen: ClassTooLong \u2014 2206 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), 80 methods, 5 blocks, lines 213-3813. The bar is 400 significant lines; this is 1806 over it, 5.52\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":"baml_language/crates/baml_compiler2_emit/src/emit.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f71dcf1036f6e6e5ac09435697de6ec92756b75f3a411cd96a4cd2b2abb9cd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/expressions.rs: FileTooLong \u2014 2631 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 2131 over it, 5.26\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":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8c6b7af6f2516de95a63c45dff77905db1ef4862e7b2f8180a284aa4deda16"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BexEngine: TooManyMethods \u2014 154 methods, declared across 8 files: src/lib.rs (109), src/telemetry.rs (14), src/conversion.rs (9), src/hydrate.rs (9), \u002B4 more file(s). The bar is 30 methods; this is 124 over it, 5.13\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"298d1133e20c127c184b53136641f7d7c0807af4dfe3e61ce430de83477e2a16"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler::thir::interpret::evaluate_expr_with_context: FunctionTooLong \u2014 baml_compiler::thir::interpret::evaluate_expr_with_context runs 509 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 409 over it, 5.09\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":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":1639}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e841872aef674ac7c3518092340aa38a486c2eb638ae247f0696571b104475"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SpanRecord.completion: MethodTooLong \u2014 completion runs 483 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 383 over it, 4.83\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":"baml_language/crates/btel_records/src/lib.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f8ce6bb69c2b6f209dbe2610bbf0f9bb27ee2f55ce64424a7665f3702c02de"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BexEngine.run_thread_event_loop_inner: MethodTooLong \u2014 run_thread_event_loop_inner runs 471 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 371 over it, 4.71\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":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":6074}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f9ff2cd230703af7ea34c143f7676bf0ef1dfb8e95aee81032f3ec8805ebe5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/emit.rs: FileTooLong \u2014 2348 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: StackifyCodegen (5 blocks, 213-3813). The bar is 500 significant lines; this is 1848 over it, 4.70\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":"baml_language/crates/baml_compiler2_emit/src/emit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af96891fa0b0d9e255b00cee0fa555bedbcf435082d3c9c273c5bdf3e7f3620"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime_wasm/mod.rs: FileTooLong \u2014 2295 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 1795 over it, 4.59\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f38ca31122f104119b1cc8d406f652a025e26b7f05894e665ec6e5b4b7f377"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 2276 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 1776 over it, 4.55\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":"baml_language/crates/sys_ops/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe7c6cac465d43b12aafc780fcebafddb950b581a0b991f83fce109234dc5e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_lsp_server::playground_server::handle_ws_in_message: FunctionTooLong \u2014 baml_lsp_server::playground_server::handle_ws_in_message runs 455 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 355 over it, 4.55\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":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2b8f0f7aedd0110dc8db383f7c4ab5bf6efd5d6e6505788f24e5080c398c2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bep-import-dialog.BepImportDialog: FunctionTooLong \u2014 BepImportDialog runs 448 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 348 over it, 4.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-import-dialog.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc3b7e87b81e14cedbf66b15c4f725a452595d4b5ffc5f72817e59017375ab4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.lower_call_with_callee: MethodTooLong \u2014 lower_call_with_callee runs 442 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 342 over it, 4.42\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":8326}}}],"partialFingerprints":{"codehealthFindingId/v1":"094441330535276beb7840bd293e3d69eb118bed90ff2ac666be4028e7b70826"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_go::render_functions: FunctionTooLong \u2014 sdkgen_go::render_functions runs 434 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 334 over it, 4.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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":1960}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f563372f117b993dab0a8c73806c96fedb039293827c47118884699181ad97"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ir/repr.rs: FileTooLong \u2014 2138 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 1638 over it, 4.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/ir/repr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf2cfd18c469aaa87ade2483f91c6c2e1223f821d66ca67a535105787245f9e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: thir/interpret.rs: FileTooLong \u2014 2136 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 1636 over it, 4.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7ea907292485a37ea2b682f5c0b0bc04069a18bddd246f716a1f6eaab01e3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lower.rs: FileTooLong \u2014 2079 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 56 free functions. The bar is 500 significant lines; this is 1579 over it, 4.16\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":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c8853c3fa7bfc80adec27c0696e2626c258c9f6525a5f33d718a14cb1d11c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: home/tracker.tsx: FileTooLong \u2014 2053 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1553 over it, 4.11\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":"typescript2/app-website/components/home/tracker.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5a53487030a5bbfa10112dda27eedaff1bcf84d4d806314ebf24c288283357"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TirTypeError: ClassTooLong \u2014 1618 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), 1 methods, 2 blocks, lines 244-2863. The bar is 400 significant lines; this is 1218 over it, 4.05\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/diagnostics.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f29bdce651f468ac89edfb6686b143926a6d12832bc3cb51cfedef2f453248"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostics.rs: FileTooLong \u2014 1998 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 81% of them inside a single declaration: TirTypeError (2 blocks, 244-2863). The bar is 500 significant lines; this is 1498 over it, 4.00\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":"baml_language/crates/baml_compiler2_hir_ty/src/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"708b70347c2fc93f70b2a45097c544d22850c91df0cee0aa71e8d9a9a412c543"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: thir/typecheck.rs: FileTooLong \u2014 1973 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 1473 over it, 3.95\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":"engine/baml-compiler/src/thir/typecheck.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3189cc5b42d42942e9e642ccce1fefddb006ab888b5964c1086f2c0bced770f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: App.App: FunctionTooLong \u2014 App runs 388 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 288 over it, 3.88\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":"typescript2/app-speedtest/src/App.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79dfc9306f41edd52c3f9d7588f7b00c708ed532a3832c247889a3c765e31dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: package_baml/csv.rs: FileTooLong \u2014 1883 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 52 free functions. The bar is 500 significant lines; this is 1383 over it, 3.77\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd15a5ebc0fdaf010e675ece44476d927be16015c57e1849a8db7b3e704ba6e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_hir_ty::interfaces::impl_rules::validate_impl_signatures: FunctionTooLong \u2014 baml_compiler2_hir_ty::interfaces::impl_rules::validate_impl_signatures runs 376 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 276 over it, 3.76\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":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af2c727aca6275e2db8b50653e2e5e70be59fdb1f40789e5e460373069d8ffe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_cffi_macros::export_baml_fn: FunctionTooLong \u2014 baml_cffi_macros::export_baml_fn runs 376 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 276 over it, 3.76\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":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ac81f4c2e79ca67e59c3200aa72afadbe14ec718f991acaebc6459ba4facf0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BamlAsyncVmRuntime.call_function: MethodTooLong \u2014 call_function runs 370 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 270 over it, 3.70\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":"engine/baml-runtime/src/async_vm_runtime.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"21641dcb99b67dd5c56df5074aed41aaa1b2cfb3dcafa20551d6b3451e00e354"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/playground_server.rs: FileTooLong \u2014 1828 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 65 free functions. The bar is 500 significant lines; this is 1328 over it, 3.66\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":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2672d2ecd91c09cc37fefedea6c61398490df76f71e0cbb54c3f775717f452b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/leaf.rs: FileTooLong \u2014 1826 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 51 free functions. The bar is 500 significant lines; this is 1326 over it, 3.65\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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4637ed1d1fa99a68c685a70e20191d187e85ffb95d6796e7715acbef5beb767"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/bytecode.rs: FileTooLong \u2014 1797 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 1297 over it, 3.59\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm_types/src/bytecode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dade7ab5163bc25b4b914f42a58c3623365a9965ac1a1632f548a53016d0c64b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/codegen_io.rs: FileTooLong \u2014 1789 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 63 free functions. The bar is 500 significant lines; this is 1289 over it, 3.58\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":"baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"444dfbc0b933464cbc14d8da29c66a11067c1bd0f72144f4839df1ec9f1e9d8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/baml.ts: FileTooLong \u2014 1789 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1289 over it, 3.58\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":"typescript2/pkg-grammar/src/baml.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4a40931c5c13837ac4e8ac56e2df5a0a52460552c37cc4731bc434fe2106c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/normalize.rs: FileTooLong \u2014 1786 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 76% of them inside a single declaration: NormalTy (10 blocks, 682-3225). The bar is 500 significant lines; this is 1286 over it, 3.57\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":"baml_language/crates/baml_type/src/normalize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79a34b2b2b17c30e8a8a61d0ab303777584649b9aa92bee9dcd8dcb12745083"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/interfaces.rs: FileTooLong \u2014 1784 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 64 free functions. The bar is 500 significant lines; this is 1284 over it, 3.57\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":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0611dfd9bd2932a5413328ea661ff222d5b81031b26b5a5534562c37dcfab4cd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.infer_expr: MethodTooLong \u2014 infer_expr runs 356 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 256 over it, 3.56\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":2907}}}],"partialFingerprints":{"codehealthFindingId/v1":"a801d63d993a0f094d484cb252534ccc9a4cbc12943fe2d6c605beeb334c03cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ingest.rs: FileTooLong \u2014 1758 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 1258 over it, 3.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19b8ec461efbb83b2830df719fe969895e2e07403a231fbc5e0834b19e7324e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: signup-form.SignupForm: FunctionTooLong \u2014 SignupForm runs 341 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 241 over it, 3.41\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":"typescript2/app-website/app/(home)/eap/signup-form.tsx"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"1587521f8c7088a297d9971ecff74fb4648994b1559200e72dc73ca42e364570"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NormalTy: ClassTooLong \u2014 1357 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), 41 methods, 10 blocks, lines 682-3225. The bar is 400 significant lines; this is 957 over it, 3.39\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":"baml_language/crates/baml_type/src/normalize.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca9c4433f5ed205d0f522067fef959a3c5ac2b77795e7832182d26f96d45b35"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1685 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 48 free functions. The bar is 500 significant lines; this is 1185 over it, 3.37\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":"baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d267ed2b711eda63c5f21fd90027e6ea1536f87baf0d82c6db3be3c54c0e3415"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/items.rs: FileTooLong \u2014 1678 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 59 free functions. The bar is 500 significant lines; this is 1178 over it, 3.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"136444d43bd9cc8a6a792e3b952832f96b5d784e50174cd8ddfd03b93ceac4bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 1677 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 1177 over it, 3.35\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":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c84c3aa493f13ab4441598dae2d39a1350523ca5f038fff639cfe4bef4bc77"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Bytecode.lower: MethodTooLong \u2014 lower runs 328 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 228 over it, 3.28\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":"baml_language/crates/bex_vm_types/src/bytecode.rs"},"region":{"startLine":2632}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d0e6828a199f389b575b51eb07690f6791502f3e2d9fe0bf083908b99d4293"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/describe.rs: FileTooLong \u2014 1638 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 51 free functions. The bar is 500 significant lines; this is 1138 over it, 3.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/describe.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a809bca2e403a622c3ff2d44adfd25e2725ab87506bd15c1589d4bee87cf61a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SemanticIndexBuilder: ClassTooLong \u2014 1298 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), 50 methods, 2 blocks, lines 62-2108. The bar is 400 significant lines; this is 898 over it, 3.25\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":"baml_language/crates/baml_compiler2_hir/src/builder.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1b4eda10f45da901e0b2f727a46602bd6be4c87bf3b5ef3ab047eecefe70dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: deployment-status.DeploymentStatus: FunctionTooLong \u2014 DeploymentStatus runs 324 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 224 over it, 3.24\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":"typescript2/app-website/components/magicui/deployment-status.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e6dffca3ef5b1678f6c346085191c6f5228e08f61ac565093e5f303f243ebf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/impls.rs: FileTooLong \u2014 1617 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 61 free functions. The bar is 500 significant lines; this is 1117 over it, 3.23\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":"baml_language/crates/baml_compiler2_hir_ty/src/impls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5498c34e7dc8cafa94e0b973cf4c7296b3e73ea3d16977255e6460e2a7d4f4f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1614 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: BamlRuntime (8 blocks, 422-2235). The bar is 500 significant lines; this is 1114 over it, 3.23\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b8be1746c5279965da73c66b172353a415dae3916935a381ad39f3ac249f91"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: package_reflect/type_kinds.rs: FileTooLong \u2014 1613 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 39 free functions. The bar is 500 significant lines; this is 1113 over it, 3.23\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":"baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa09f9e4ed8fa3fddd24d7c045cc91b81254000acdc5972f48f9734195d514c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_csharp::semantic::generate_program_inner: FunctionTooLong \u2014 sdkgen_csharp::semantic::generate_program_inner runs 322 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 222 over it, 3.22\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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"337346abe8a42dcc95a08ab7ff53c3119478c1a477e616dc5cad58bd47ef2a8e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/package_interface.rs: FileTooLong \u2014 1607 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 44 free functions. The bar is 500 significant lines; this is 1107 over it, 3.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/package_interface.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f221233e10ea85544700478f8f14f0af6561c011acbbfa3601c3179a7b099a47"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_rust::emit::class::fields_struct: FunctionTooLong \u2014 sdkgen_rust::emit::class::fields_struct runs 321 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 221 over it, 3.21\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":"baml_language/sdks/rust/sdkgen_rust/src/emit/class.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d04bf3e9f049ddc1d5d344d5f30d3807ea01b104e67659f8ba809929a36c510"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BamlRuntime: ClassTooLong \u2014 1282 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), 39 methods, 8 blocks, lines 422-2235. The bar is 400 significant lines; this is 882 over it, 3.21\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":"engine/baml-runtime/src/lib.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d01ea4d336fec9e1373b67ce901fab38f1a2d01e762a0b0eddff44093ec76c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BexHeap: TooManyMethods \u2014 96 methods, declared across 5 files: src/heap.rs (55), heap_debugger/real.rs (18), src/gc.rs (14), src/functions.rs (7), \u002B1 more file(s). The bar is 30 methods; this is 66 over it, 3.20\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"baml_language/crates/bex_heap/src/heap.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f581547411ded2b134497be71440274a2039ae50adb48079156f13017f5661b5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ArgCoercer.coerce_arg: MethodTooLong \u2014 coerce_arg runs 314 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 214 over it, 3.14\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":"engine/baml-lib/baml-core/src/ir/ir_helpers/to_baml_arg.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"043dfcbcc58a92e88e041a173f980fece7f3eec08dcefaf7710fc2f8e6450df3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_mir::optimize::verify_definite_assignment: FunctionTooLong \u2014 baml_compiler2_mir::optimize::verify_definite_assignment runs 313 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 213 over it, 3.13\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":"baml_language/crates/baml_compiler2_mir/src/optimize.rs"},"region":{"startLine":1943}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5779a4d2777d2ec9ef012fa7ce948ed271cf6cf3c4d1f35e6702ef5983476ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ai-assistant-panel.AIAssistantPanel: FunctionTooLong \u2014 AIAssistantPanel runs 312 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 212 over it, 3.12\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":"typescript2/app-beps/src/components/ai-assistant/ai-assistant-panel.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"854cdd55e4275764d5f3cfdb369777d063d7f70140138e008f8af39bc1fc6d2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_java::to_source_code_internal: FunctionTooLong \u2014 sdkgen_java::to_source_code_internal runs 311 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 211 over it, 3.11\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":"baml_language/sdks/java/sdkgen_java/src/lib.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d198cef63170d44c3c0c88f5fbedc9f27af6b273c01c18f14705a86d28f86949"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_go::render_callback_codecs: FunctionTooLong \u2014 sdkgen_go::render_callback_codecs runs 310 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 210 over it, 3.10\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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":4444}}}],"partialFingerprints":{"codehealthFindingId/v1":"2952fc0e698b69240a36fd81932cc039f503f30760bcd35ea3fb8f08cb798d42"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: adopt/architecture.tsx: FileTooLong \u2014 1541 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1041 over it, 3.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/adopt/architecture.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"668a58a67fc828f67be6744e37b74e69b9823394a17fefcc4aa350af1e7b26cb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OptimizeArgs.run: MethodTooLong \u2014 run runs 308 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 208 over it, 3.08\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":"engine/baml-runtime/src/cli/optimize.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ecdfaf2f8974642abd153414f9aa73f75a05694a850cc366a0d5f5c66ed092"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BexEngine.new_with_config: MethodTooLong \u2014 new_with_config runs 307 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 207 over it, 3.07\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":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":1857}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf121eec9e65c94f9a107bc94b049f15c06418d732bb85eb12d93b29e23282d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/optimize.rs: FileTooLong \u2014 1528 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 33 free functions. The bar is 500 significant lines; this is 1028 over it, 3.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/optimize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a721873087b43097edbef3d6b31328f20933d135eb34718d801191f357cedb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/check.rs: FileTooLong \u2014 1526 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 1026 over it, 3.05\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":"baml_language/crates/baml_db/src/check.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d52acca64c8545f03254d68a004d7f1a2c845cf2f8613f363445e48873926bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: package_reflect/reflect.rs: FileTooLong \u2014 1487 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 49 free functions. The bar is 500 significant lines; this is 987 over it, 2.97\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":"baml_language/crates/bex_vm/src/package_reflect/reflect.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f108b73de57925c03ddfb51ed238fca3effd4dc2945e9678859e0edc4077d0e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/pat.rs: FileTooLong \u2014 1467 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 81% of them inside a single declaration: InferenceContext (60-1926). The bar is 500 significant lines; this is 967 over it, 2.93\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd2a5ea0dd204477bd6695d78e00c731a00c829cb3361d7f2ee7345e85f2124"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/info.rs: FileTooLong \u2014 1444 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 42 free functions. The bar is 500 significant lines; this is 944 over it, 2.89\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":"baml_language/crates/baml_ide/src/info.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24b48f56b2746a2bd08ebbcb6e785d6eb364640bca53319bc3fc06a70acd848"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DefaultIoOps: ClassTooLong \u2014 1154 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), 0 methods, 30 blocks, lines 1511-3707. The bar is 400 significant lines; this is 754 over it, 2.89\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":"baml_language/crates/sys_ops/src/lib.rs"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d901abacfe7f1249cf9bbf5c2498e45495d12d1264a8b8a8bd8b959ae327749"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GenerateArgs.run_generate: MethodTooLong \u2014 run_generate runs 287 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 187 over it, 2.87\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":"baml_language/crates/baml_cli/src/generate.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"70574bc2466b3e6c50bc09968788ddc360e94ef9041ba3d845711c0b7e9e44e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_ide::symbol_pool::build_symbol_pool: FunctionTooLong \u2014 baml_ide::symbol_pool::build_symbol_pool runs 287 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 187 over it, 2.87\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":"baml_language/crates/baml_ide/src/symbol_pool.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1c35e74723e64f6bcc5a8c88ca4661467499f02638819bfbf96803ce0dd7b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/escape.rs: FileTooLong \u2014 1433 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 933 over it, 2.87\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":"baml_language/crates/baml_compiler2_mir/src/escape.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3740ddb7ee13fad6c7313db4e32a5fff077a895244bc66bc06d3f16c346ef166"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page.ProfilePage: FunctionTooLong \u2014 ProfilePage runs 286 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 186 over it, 2.86\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":"typescript2/app-beps/src/app/profile/page.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f065abe33df188323176ed0b58f4d39fe014ee8c12212f7062857101b88d5fab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower_tree/body.rs: FileTooLong \u2014 1425 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 925 over it, 2.85\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":"baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ab6293d5bd0c53cd2470943764376a9db39eb46b5c5307d0fb8f3a245f2b24"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: interfaces/impl_rules.rs: FileTooLong \u2014 1424 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 924 over it, 2.85\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":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec37472be2048db410f8d16bcff34aff157c6ac18e60845b201e58e7a12deb8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_ast::lower_expr_body::synthesize_llm_spec_body: FunctionTooLong \u2014 baml_compiler2_ast::lower_expr_body::synthesize_llm_spec_body runs 284 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 184 over it, 2.84\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":"baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2bb653d26b5a25350a0835e744c2c361582dfb32756e5a120464a134bf7c67"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StackifyCodegen.emit_terminator: MethodTooLong \u2014 emit_terminator runs 284 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 184 over it, 2.84\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":"baml_language/crates/baml_compiler2_emit/src/emit.rs"},"region":{"startLine":2393}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db14e2d53b5d1fbe3a57ae0913bf4c33cd91003c812fad9456ce91b3d332c25"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/codegen.rs: FileTooLong \u2014 1415 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 59 free functions. The bar is 500 significant lines; this is 915 over it, 2.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_builtins2_codegen/src/codegen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9df237b03c71e586f08828d606945510cde40c8b9a69a93a9945280224afe03"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BexEngine.call_callable_with_outcome_impl: MethodTooLong \u2014 call_callable_with_outcome_impl runs 283 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 183 over it, 2.83\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":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":4141}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c73520667ab163ce9f3fcbb108c9930b0868625b6923e67f2c94b59fdf43a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_rust::emit::function::emit_binding: FunctionTooLong \u2014 sdkgen_rust::emit::function::emit_binding runs 283 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 183 over it, 2.83\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":"baml_language/sdks/rust/sdkgen_rust/src/emit/function.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"646910e579c207b2cc37197988557ff97ede69c37c863d87fb3582b3c04321e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/run.rs: FileTooLong \u2014 1411 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 911 over it, 2.82\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":"baml_language/crates/bex_events/src/run.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f8a5848ce45e7611e3328494bce3d0d3b52a22758830b382da4355692a40ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: comment-feed-view.FeedCommentCard: FunctionTooLong \u2014 FeedCommentCard runs 281 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 181 over it, 2.81\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":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"caefce9bea9f3ae2b3230899ec18260ea79135a88f348e09b288943324232a61"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_hir_ty::interfaces::impl_rules::impl_data: FunctionTooLong \u2014 baml_compiler2_hir_ty::interfaces::impl_rules::impl_data runs 280 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 180 over it, 2.80\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":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4d4408119f04d0189d23da54ada24c80011ec73cc51a5a679c2d6a692a9c05"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_db::check::check_file: FunctionTooLong \u2014 baml_db::check::check_file runs 276 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 176 over it, 2.76\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":"baml_language/crates/baml_db/src/check.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f15c0017eaf644983a60bcee291fb0e69250c85716aeaacf158f4fce6404e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler::thir::typecheck::typecheck_statement: FunctionTooLong \u2014 baml_compiler::thir::typecheck::typecheck_statement runs 274 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 174 over it, 2.74\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":"engine/baml-compiler/src/thir/typecheck.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8e32355e0f941bf970e45922059957cc83cc7d38fe81099024f5c598a114aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: issue-card.IssueCard: FunctionTooLong \u2014 IssueCard runs 272 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 172 over it, 2.72\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":"typescript2/app-beps/src/components/issues/issue-card.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"976b4409ba1a1e3ba17a7cb7a3c5afd6e9a37bab63127bda383530e8e8c2e2ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ingest/bulk.rs: FileTooLong \u2014 1358 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 70% of them inside a single declaration: Bulk (2 blocks, 391-1717). The bar is 500 significant lines; this is 858 over it, 2.72\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":"baml_language/crates/baml_query_btel/src/ingest/bulk.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2727808c27785d78e62e279d8e616ec3501311f6fbe2908bcac7e81c2d7f8ca9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_query_btel::ingest::reconcile: FunctionTooLong \u2014 baml_query_btel::ingest::reconcile runs 271 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 171 over it, 2.71\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":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"93823b6dca3de51aa8032a4da77917b3bfa2cea42d67cb09fbef3e30465f4e39"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runtime_compile.rs: FileTooLong \u2014 1354 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 854 over it, 2.71\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":"baml_language/crates/bex_project/src/runtime_compile.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f71181104967e8d49b199ebf2bd48335556378a3edb88877546861be9605c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lower_expr_body.rs: FileTooLong \u2014 1337 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 837 over it, 2.67\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":"baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7a2ee294879b10397c9211786e4a5f0cdcca2e99c405ef3abde232a689375e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StackifyCodegen: TooManyMethods \u2014 80 methods. The bar is 30 methods; this is 50 over it, 2.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/emit.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"2def8748160067bea07ec71c68b5d5da9273a3c8804e9c39b1d9f7d720624079"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/builder.rs: FileTooLong \u2014 1331 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: SemanticIndexBuilder (2 blocks, 62-2108). The bar is 500 significant lines; this is 831 over it, 2.66\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":"baml_language/crates/baml_compiler2_hir/src/builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6f67b397b2e7b0df45f724220d1bc5555bee1ccd8e60e11a3f84a83d7d2489"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/delivery.rs: FileTooLong \u2014 1326 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 826 over it, 2.65\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":"baml_language/crates/btel_bcs/src/delivery.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"409504d1964963017106f8add72ec8c964ef8a2a682dd2667e5afb57c41477bb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.try_lower_as_switch: MethodTooLong \u2014 try_lower_as_switch runs 262 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 162 over it, 2.62\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":12735}}}],"partialFingerprints":{"codehealthFindingId/v1":"41968e984e561b4fbc2c36ab60ee42e4a07b3588eaa1c8752cc56f6df236c934"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: internal_baml_jinja_types::evaluate_type::expr::tracker_visit_expr: FunctionTooLong \u2014 internal_baml_jinja_types::evaluate_type::expr::tracker_visit_expr runs 262 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 162 over it, 2.62\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":"engine/baml-lib/jinja/src/evaluate_type/expr.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6b6c9b65b2e153f0dfeea5cc6c55764a59f7ea910159d106ab211e6ed75ff0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: comment-feed-view.FeedThreadCard: FunctionTooLong \u2014 FeedThreadCard runs 259 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 159 over it, 2.59\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":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea00f6112faf7f6276f2d559c67d0f9e199935e6f429d8dd4cbecf09f02613d1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.lower_stmt: MethodTooLong \u2014 lower_stmt runs 258 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 158 over it, 2.58\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":11905}}}],"partialFingerprints":{"codehealthFindingId/v1":"81efd6984066fb4f9417198996387cc97ef8690e20bc5aee209be7ecc1163824"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Program.validate: MethodTooLong \u2014 validate runs 257 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 157 over it, 2.57\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":"baml_language/crates/bex_vm_types/src/types.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d1b5a2c490720ccfe7d192084a9b9856b16c4d802622ee5b63e6685b61b794"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bex_vm::debug::display_instruction_textual: FunctionTooLong \u2014 bex_vm::debug::display_instruction_textual runs 256 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 156 over it, 2.56\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":"baml_language/crates/bex_vm/src/debug.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"b064296419249ab6196880c01ff6fbd260eb88008ba7c9abbfcdc706e571a66d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: internal/ProtoReader.java: FileTooLong \u2014 1275 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 775 over it, 2.55\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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22cd9514ddfcd74fd33f10b261c12a3c0412b2197e0ffdfaf15d15c51653a21"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_runtime::internal::llm_client::orchestrator::stream::orchestrate_stream: FunctionTooLong \u2014 baml_runtime::internal::llm_client::orchestrator::stream::orchestrate_stream runs 253 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 153 over it, 2.53\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":"engine/baml-runtime/src/internal/llm_client/orchestrator/stream.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9ac39bf49cd61340fd6da06c6f2e1a64710e19451e5b04549c20f894562671"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.resolve_value_path: MethodTooLong \u2014 resolve_value_path runs 252 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 152 over it, 2.52\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":7459}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e14b9638a48844f4173bb38e55b2b53c52955fc16bcc52948e8076e585581c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler::thir::typecheck::typecheck_returning_context: FunctionTooLong \u2014 baml_compiler::thir::typecheck::typecheck_returning_context runs 252 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 152 over it, 2.52\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":"engine/baml-compiler/src/thir/typecheck.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b25babd83470d95d7c1c47066329827402ee10d58fb4e3483fb0d3f3407cd4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: home/stack.tsx: FileTooLong \u2014 1253 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 753 over it, 2.51\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":"typescript2/app-website/components/home/stack.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff74b0a1c40722124e73af852f50e3f8a37181aa81d1b0e47234eaedaabecce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: json/decode.rs: FileTooLong \u2014 1251 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 751 over it, 2.50\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":"baml_language/crates/bex_vm/src/package_baml/json/decode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5310d62d947f7dba56a63aa76333bfd487fe1bf9f22db81d95256f1a90397763"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BamlType: TooManyMethods \u2014 75 methods. The bar is 30 methods; this is 45 over it, 2.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlType.java"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e378aa50d199042156ee05f3c34b9ffc3edde217a44ad1b9d92134a808656f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: home/hyperobs.tsx: FileTooLong \u2014 1246 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 746 over it, 2.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/hyperobs.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66152a2a04711da993392fa755e7befddca8fb67bd39852e2fef9efba097084d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bep-user-stance.BepUserStance: FunctionTooLong \u2014 BepUserStance runs 248 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 148 over it, 2.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-user-stance.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4bd3ac62a056087209a0652c273f124a26b96145946eece90e566b820abba1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: comment-thread.SingleComment: FunctionTooLong \u2014 SingleComment runs 246 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 146 over it, 2.46\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":"typescript2/app-beps/src/components/comments/comment-thread.tsx"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbeb869de4270e577803e61490cae19670b6fbce919f3f457f14824d80763640"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_rust::emit::union::emit: FunctionTooLong \u2014 sdkgen_rust::emit::union::emit runs 245 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 145 over it, 2.45\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":"baml_language/sdks/rust/sdkgen_rust/src/emit/union.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef21540ab289b32790cd7883c3e9b910240b72de66c3bcd2d188392398b27fe3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml.baml: FunctionTooLong \u2014 baml runs 245 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 145 over it, 2.45\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":"typescript2/pkg-grammar-hljs/src/baml.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e76d24d48431110789d15bfa268133e32cae25a2fb692bf7b5d9e857fcd51a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BexVm.execute_call_from_locals_offset: MethodTooLong \u2014 execute_call_from_locals_offset runs 244 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 144 over it, 2.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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":7473}}}],"partialFingerprints":{"codehealthFindingId/v1":"01864c96ab72dcdea6cb3e585377bff946c31a2651987a5a49b59e1efb56f819"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_hir_ty::package_interface::validate_row_identities: FunctionTooLong \u2014 baml_compiler2_hir_ty::package_interface::validate_row_identities runs 243 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 143 over it, 2.43\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":"baml_language/crates/baml_compiler2_hir_ty/src/package_interface.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"36da75a2b7c5257c518e7b009d258c1d92c6274345d3f85b3ea299507bd698fe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BamlAsyncInterpreterRuntime.call_function: MethodTooLong \u2014 call_function runs 242 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 142 over it, 2.42\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":"engine/baml-runtime/src/async_interpreter_runtime.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5029d7b82b0ed3cd5b0194e6f14cde7a7f60052ec4e2e597ac15c24d541e6492"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page.BcsProposal: FunctionTooLong \u2014 BcsProposal runs 242 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 142 over it, 2.42\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":"typescript2/app-beps/src/app/bcs/[number]/page.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9fb2c0dceea12fb65a021bd5a21901116aa139b6883ac564239a34480528d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/telemetry.rs: FileTooLong \u2014 1204 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 704 over it, 2.41\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":"baml_language/crates/bex_vm/src/telemetry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92548a99f1a90ff8702f8b52d792c84f16da279f90bbaa63d1e10d830ac0534"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Class.coerce: MethodTooLong \u2014 coerce runs 240 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 140 over it, 2.40\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":"engine/baml-lib/jsonish/src/deserializer/coercer/ir_ref/coerce_class.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0e7030c53e3a5892448c30de52e038627a4c46829a1b9e11fc43cbdda76487"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RunArgs: ClassTooLong \u2014 957 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), 32 methods, 4 blocks, lines 180-1727. The bar is 400 significant lines; this is 557 over it, 2.39\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":"baml_language/crates/baml_cli/src/run_command.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c10d40a29daef0dd75da5ca2f60beb648af7839130b1f03452ad5c3fffff30c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Bulk: ClassTooLong \u2014 953 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), 32 methods, 2 blocks, lines 391-1717. The bar is 400 significant lines; this is 553 over it, 2.38\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":"baml_language/crates/baml_query_btel/src/ingest/bulk.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"9107f09951503ca6e32e83d499a3e75cadcaccbd4d4ecf99587e9437c4bfff83"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_hir_ty::infer::trace_hooks::checked_declaration: FunctionTooLong \u2014 baml_compiler2_hir_ty::infer::trace_hooks::checked_declaration runs 238 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 138 over it, 2.38\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer/trace_hooks.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1d196e92bad8a5e0333b9d81374e07b080ca91bcd4b41cedff2994ce6ae071"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_syntax_macros::tree::emit: FunctionTooLong \u2014 baml_syntax_macros::tree::emit runs 238 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 138 over it, 2.38\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":"baml_language/crates/baml_syntax_macros/src/tree.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"fddc85f81bc7df0e0c3e92b5bb6dfba650f73222494a5efd88ab9e2e899bb368"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_go::generated_functions: FunctionTooLong \u2014 sdkgen_go::generated_functions runs 238 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 138 over it, 2.38\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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"358726861df174e72080a48861c7f0913bd3d3fd421e2ceab8efd666d8a28ab0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/method_resolution.rs: FileTooLong \u2014 1185 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 38 free functions. The bar is 500 significant lines; this is 685 over it, 2.37\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":"baml_language/crates/baml_compiler2_hir_ty/src/method_resolution.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb76202093dfaffc23714a9a85242e3a7622b949d2ec5b50c2d2513343cf551"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/repl.rs: FileTooLong \u2014 1182 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 682 over it, 2.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/cli/repl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5d5cb5036b55a6ecae147dd627faf2bf137a93c0704d705f53c5f409df0547"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Items: ClassTooLong \u2014 945 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), 34 methods, 2 blocks, lines 139-1457. The bar is 400 significant lines; this is 545 over it, 2.36\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":"baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b3fa26001ac05f866424e0d1a94ece58a83232ed8f24645608f711a6e34acf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/run_command.rs: FileTooLong \u2014 1181 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 81% of them inside a single declaration: RunArgs (4 blocks, 180-1727). The bar is 500 significant lines; this is 681 over it, 2.36\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":"baml_language/crates/baml_cli/src/run_command.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b64bce5e4baa53422636ea4d62305aaea85ce0c2e81b22f15bbb11071c4a89"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Processing.span: MethodTooLong \u2014 span runs 235 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 135 over it, 2.35\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":"baml_language/crates/btel_processor/src/lib.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2e45916ce4ba9a31b69afca3076ce6ae334b30a3256421348285443950107a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1167 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 33 free functions. The bar is 500 significant lines; this is 667 over it, 2.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a377f1aa5d9464a8b9504cb213c6e58dbef59a94fa3cb1bd9450a072b0ac41e5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ProtoReader: TooManyMethods \u2014 70 methods. The bar is 30 methods; this is 40 over it, 2.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ed759b64fdc4872d29a819f8cdf4f555e53af6448a7ca348fe159985d08e87"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_emit::compute_function_metadata: FunctionTooLong \u2014 baml_compiler2_emit::compute_function_metadata runs 233 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 133 over it, 2.33\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":"baml_language/crates/baml_compiler2_emit/src/lib.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66c6007cc20e977165e2c02aa1c8080b2aa1d174b8dde6ed9a5c2ee7493820d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/describe_command.rs: FileTooLong \u2014 1164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 664 over it, 2.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/describe_command.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69ea6e0fe2f92fd44c4961647f30b3c975b36e409dab0964d922d778e2d22ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_csharp::semantic::collect_methods: FunctionTooLong \u2014 sdkgen_csharp::semantic::collect_methods 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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fbf9c8b8d3227b7dafe2a608cc8c0ce63bf74f9c8cdded7b68244d1824ba8fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: optimize/tui.rs: FileTooLong \u2014 1150 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 650 over it, 2.30\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":"engine/baml-runtime/src/optimize/tui.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a0209b2263181606025c99395c74f97fb54ed2f0698414f3b5f239a6763c88"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.lower_pattern_test_with_catch_policy: MethodTooLong \u2014 lower_pattern_test_with_catch_policy runs 230 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 130 over it, 2.30\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":13930}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96268af62aae4e053b0129e5887cfab3c668f37194ff920d53c7017a01e884e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WithIr.encode: MethodTooLong \u2014 encode runs 229 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 129 over it, 2.29\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":"engine/language_client_cffi/src/ctypes/baml_value_with_meta_encode.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcb2b8ca2e13f04a0ba6ef116aeb13ede06a9e18c2099140e4c50eb81db2b19"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/output_writer.rs: FileTooLong \u2014 1144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 55 free functions. The bar is 500 significant lines; this is 644 over it, 2.29\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":"baml_language/crates/baml_sdkgen_types/src/output_writer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8659d4e717f4be089567a525ab54579a763c57362d6729c508f2aa6ae9d7f65"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/plan.rs: FileTooLong \u2014 1135 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 60% of them inside a single declaration: Planner (2 blocks, 274-1285). The bar is 500 significant lines; this is 635 over it, 2.27\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_encode/src/plan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ec471c30ae24d34804a534111d3cbd44a55080e3258ed0483cefbc6f4e443b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lower_tree/items.rs: FileTooLong \u2014 1133 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 83% of them inside a single declaration: Items (2 blocks, 139-1457). The bar is 500 significant lines; this is 633 over it, 2.27\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce9c22d4e2c4e4997bac6babb8b90ab59816da848882db25ac3d0b197d222a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ast.rs: FileTooLong \u2014 1132 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 632 over it, 2.26\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":"baml_language/crates/baml_compiler2_ast/src/ast.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dea0017b2fa79824828f4b4edf1051f1eaffac6b7ff992a0f175df825bcb16f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_emit::stack_carry::simulate_terminator_stack: FunctionTooLong \u2014 baml_compiler2_emit::stack_carry::simulate_terminator_stack runs 226 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 126 over it, 2.26\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":"baml_language/crates/baml_compiler2_emit/src/stack_carry.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ca2b808eea074095a906863c2d7888e648dd62e23da9d663accd6446cc935e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_mir::optimize::verify_mir: FunctionTooLong \u2014 baml_compiler2_mir::optimize::verify_mir runs 224 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 124 over it, 2.24\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":"baml_language/crates/baml_compiler2_mir/src/optimize.rs"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d357254210a08ee5807de46770f7eb622140985b1de8373ed5685518f81a23"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_query_btel::functions::register: FunctionTooLong \u2014 baml_query_btel::functions::register runs 224 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 124 over it, 2.24\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":"baml_language/crates/baml_query_btel/src/functions.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c35cdb07976a9ba27d21b77ea016ef078a578369f05dd97d41cd9bfa20c41aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/stack_carry.rs: FileTooLong \u2014 1117 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 617 over it, 2.23\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":"baml_language/crates/baml_compiler2_emit/src/stack_carry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea8b4f013e5b14c6e9ecd1827be4d6a40f5df7be219263adb4016b52b84ba6f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TelemetryState: TooManyMethods \u2014 67 methods, declared across 2 files: src/telemetry.rs (60), telemetry/host.rs (7). The bar is 30 methods; this is 37 over it, 2.23\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"baml_language/crates/bex_vm/src/telemetry.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5c135fb0b37e95f45054f0218c7eecad661eb253ab85eb13ca5e268f5d3aaf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sql.rs: FileTooLong \u2014 1114 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 75% of them inside a single declaration: Translator (2 blocks, 126-1547). The bar is 500 significant lines; this is 614 over it, 2.23\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/sql.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"881eb43b7a94f1455c61b895042eb3b0b1c509e36c03bd2e2542a112253138a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: normalize/mu.rs: FileTooLong \u2014 1111 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 611 over it, 2.22\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":"baml_language/crates/baml_type/src/normalize/mu.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b4afc7950d3d77a286e68faba53554ef5acd9961f35923da39803d8ca2ce9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/analysis.rs: FileTooLong \u2014 1110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 46 free functions. The bar is 500 significant lines; this is 610 over it, 2.22\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":"baml_language/crates/baml_compiler2_emit/src/analysis.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db14165746264bfe79e2376d40d2d8f334657e2a2c71999b35f044dfef6f7d3a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ConversionBuffer: ClassTooLong \u2014 885 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), 18 methods, 3 blocks, lines 58-1132. The bar is 400 significant lines; this is 485 over it, 2.21\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":"baml_language/crates/btel_recorder/src/lib.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f3e3baf32f8e119d652b9654cca5445b473a0c81b9813f175bdb5320da41cb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.check_call_args: MethodTooLong \u2014 check_call_args runs 221 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 121 over it, 2.21\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":6349}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7dd0edaa6187295df69052e744891b12f89ea723a14fd17245c02742a903308"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LowerCtx: ClassTooLong \u2014 883 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, 2 blocks, lines 144-1643. The bar is 400 significant lines; this is 483 over it, 2.21\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":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"1182399292d62291de6df59eeb1ddb0e632dcae048ea932679ad7266262f26d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/decode.rs: FileTooLong \u2014 1103 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 603 over it, 2.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_snapshot/src/decode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce3e359465eddc12a65d2ec3ba9a75cece0c8746cfa343ebf7b899a3136e74d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Applier: ClassTooLong \u2014 882 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), 11 methods, 2 blocks, lines 1019-2044. The bar is 400 significant lines; this is 482 over it, 2.21\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":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"750727319899c28b71284aac154997d61a412ccebc8a3fac78e0175d1c3c48a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_go::render_types: FunctionTooLong \u2014 sdkgen_go::render_types runs 219 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 119 over it, 2.19\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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":5136}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f952900468f41ce34c94faabb23f75c09bf0d35749e6b236e8db64ded6c0f15"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BamlType: ClassTooLong \u2014 871 significant lines (blank, comment-only and punctuation-only lines excluded), 75 methods. The bar is 400 significant lines; this is 471 over it, 2.18\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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlType.java"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d43a8ec791226cbfacdd1bd70aa8010c4a902ad6e19f509ec8e0e6aeccfe934"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/functions.rs: FileTooLong \u2014 1086 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 586 over it, 2.17\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":"baml_language/crates/baml_query_btel/src/functions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b42a12a056e7e79989532cea1bf49877be0860c21d6a57b4bb7c5adedb00a8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/output_format.rs: FileTooLong \u2014 1086 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 586 over it, 2.17\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":"baml_language/crates/sys_ops/src/output_format.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9a6374276363873602623712cc747e098088d8ee8ab0c9789f6eb4bed44f88"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.lower_path_expr: MethodTooLong \u2014 lower_path_expr runs 217 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 117 over it, 2.17\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":6424}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2b00f2359b9ebe88e00266ec5d6fa6d007826fbe7b9ede077d286cbcc38442"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1083 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 74% of them inside a single declaration: SpanRecord (5 blocks, 45-1478). The bar is 500 significant lines; this is 583 over it, 2.17\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_records/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bebbdc870b2746be156bc18360aec1efafd01d690ee980f5d0a112b59ddad49a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lsp_ingress.rs: FileTooLong \u2014 1080 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 580 over it, 2.16\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":"baml_language/crates/baml_lsp_server/src/lsp_ingress.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10501f470fe866dd8a0b870bf8e6a1fa635f72340e8c2c62c60e1948f5d9e2cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/conversion.rs: FileTooLong \u2014 1079 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 579 over it, 2.16\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":"baml_language/crates/bex_engine/src/conversion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b13831d494f876feecf93d3e861491b2b5ceb4e348c926c0d9e2e01aa91f1ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runs.rs: FileTooLong \u2014 1072 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 572 over it, 2.14\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":"baml_language/crates/bridge_wasm/src/runs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d5d396044057a8b15c611b83ec2413df065d79b254c102d3e01e70469695e2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Applier.apply: MethodTooLong \u2014 apply runs 214 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 114 over it, 2.14\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":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b0ddbd5ecd90cb1b9a7d7ffc69f0b5ce7deacc316b67a6f67b55d2de90e665"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/debug.rs: FileTooLong \u2014 1067 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 567 over it, 2.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/debug.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ebd50b6fed81cfded32da48ad9beeab52ae64d9f59dab97a4aef61d9486d1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: package_baml/sap.rs: FileTooLong \u2014 1065 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 565 over it, 2.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/sap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"275e4304fcacdd76511a902d2a3dd8ac10908cb80860c92acc6f0df669c80edd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/names.rs: FileTooLong \u2014 1065 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 565 over it, 2.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/sdkgen_go/src/names.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9bab0421ccb73fe160aa2f0f7a8be975474cc90abc3c0e376289480b37d98b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/baml_value.rs: FileTooLong \u2014 1063 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 563 over it, 2.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-types/src/baml_value.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d511899832b6235a7e8002e28e721bd20d09d204ab7300e45bb78fee1fcdef13"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: aws/aws_client.rs: FileTooLong \u2014 1058 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 75% of them inside a single declaration: AwsClient (9 blocks, 156-1503). The bar is 500 significant lines; this is 558 over it, 2.12\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"706d14d7898aabd4fe440104e964da76097ac8da7b389bf1a714200256610456"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/resolve.rs: FileTooLong \u2014 1051 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 551 over it, 2.10\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":"baml_language/crates/baml_ide/src/resolve.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a455ddf19b0a2d46e57bdd85ebc62bf018c9776555213f1b76fe689e6334ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: EmbedDialog.EmbedDialog: FunctionTooLong \u2014 EmbedDialog runs 210 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 110 over it, 2.10\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":"typescript/apps/fiddle-web-app/app/[project_id]/_components/EmbedDialog.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e5e522894260a677b7f62261471227fc9b68a39f87dcb594651250124bec03"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Translator: ClassTooLong \u2014 839 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), 23 methods, 2 blocks, lines 126-1547. The bar is 400 significant lines; this is 439 over it, 2.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":"baml_language/crates/baml_query_btel/src/sql.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22c228b8bc0757672804a39375d6b1722a6f10186aa42a9cf7f5686e5245d36"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_rust::to_source_code_with_optional_metadata: FunctionTooLong \u2014 sdkgen_rust::to_source_code_with_optional_metadata runs 209 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 109 over it, 2.09\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":"baml_language/sdks/rust/sdkgen_rust/src/lib.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c394afeb954fedeb6e35485f844cbbab9f7681eef1a9bc6883db1f3447e8a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: home/review.tsx: FileTooLong \u2014 1035 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 535 over it, 2.07\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":"typescript2/app-website/components/home/review.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a06de0f49be024d22d5ce4a6a10078bfa6703386c736cfef75827245712abe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Hydrator.value: MethodTooLong \u2014 value runs 207 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 107 over it, 2.07\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":"baml_language/crates/bex_engine/src/hydrate.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a91721b76e897728b2134c8215156abf54669daf8a8c3e1f0c09f74242af34e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Bulk.apply: MethodTooLong \u2014 apply runs 206 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 106 over it, 2.06\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":"baml_language/crates/baml_query_btel/src/ingest/bulk.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba2131cf3913b38ee5dd1324531a00282cbd5a0a4f822942b2ddd85130a845f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bex_vm::debug::display_compact_bytecode: FunctionTooLong \u2014 bex_vm::debug::display_compact_bytecode runs 206 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 106 over it, 2.06\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":"baml_language/crates/bex_vm/src/debug.rs"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c012d975b77fa95b2928ef8a125fa7ae1d2e2ea31c8cc206c9706ea32673fc0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: baml_project/mod.rs: FileTooLong \u2014 1028 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 528 over it, 2.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/baml_project/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11811fe5ed5c3a7cbcc7f4effbdc41e5256f176294847c013c518210e8a05b5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_hir_ty::defaults::collect_default_expr_forward_references: FunctionTooLong \u2014 baml_compiler2_hir_ty::defaults::collect_default_expr_forward_references runs 205 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 105 over it, 2.05\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":"baml_language/crates/baml_compiler2_hir_ty/src/defaults.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"365b8091d12664c2e4ad0f2c1e24aa1390e4e7df6872aa353f8b6d00b25965fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: App.App: FunctionTooLong \u2014 App runs 204 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 104 over it, 2.04\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":"typescript2/app-vscode-webview/src/App.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e961e08d1077edcd53786240cdfda577746a0aa72f3aab5d6fd01e6257715f6d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BamlAsyncVmRuntime: ClassTooLong \u2014 808 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), 20 methods, 5 blocks, lines 49-1471. The bar is 400 significant lines; this is 408 over it, 2.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/async_vm_runtime.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0bd3b73f571d4f9825f8f20586b6f2f471b810bada3e52195f438d05c85c6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler::hir::lowering::lower_stmt_with_options: FunctionTooLong \u2014 baml_compiler::hir::lowering::lower_stmt_with_options runs 202 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 102 over it, 2.02\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":"engine/baml-compiler/src/hir/lowering.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"186f188d66c8fc053903e265d8f3568cf38fb73cafd8b3ef728d353c456ce037"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GlobalState: TooManyMethods \u2014 60 methods, declared across 5 files: src/state.rs (49), dispatch/events.rs (5), dispatch/mod.rs (3), src/discovery.rs (2), \u002B1 more file(s). The bar is 30 methods; this is 30 over it, 2.00\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"baml_language/crates/baml_lsp/src/state.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"374caf268a324729ec633bf74d787d2c2832709665ee51de5aaa21f6d3008e1e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SpanRecord: ClassTooLong \u2014 800 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), 5 methods, 5 blocks, lines 45-1478. The bar is 400 significant lines; this is 400 over it, 2.00\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":"baml_language/crates/btel_records/src/lib.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"017a2903316e8965fd4fa8741eff5e97f86d7dfb28fd0f4863bb8bd3251464c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_db::check::validate_ambiguous_typevar_associated_projection_in_type_expr: FunctionTooLong \u2014 baml_db::check::validate_ambiguous_typevar_associated_projection_in_type_expr runs 200 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 100 over it, 2.00\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":"baml_language/crates/baml_db/src/check.rs"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60e1845016cb75f97da51a0cc5c8cf48660c03a0b6c03329bbe403cad226850"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: setup.Setup: FunctionTooLong \u2014 Setup runs 200 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 100 over it, 2.00\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":"typescript2/app-type-quiz/src/setup.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2772021a6c04f9ca85b3b2a84abb12651a667ac90f6988a12e5e5a9ec32af573"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Vm: ClassTooLong \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), 17 methods, 2 blocks, lines 186-1842. The bar is 400 significant lines; this is 398 over it, 2.00\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":"engine/baml-vm/src/vm.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d6da53d36b3b61d569c1dfe97c46e7d262d8c71a2ce98c3df4603b041be693"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: search-menu.SearchMenu: FunctionTooLong \u2014 SearchMenu runs 199 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 99 over it, 1.99\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":"typescript2/app-developer-docs/components/search-menu.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc6730ef250cef378406bfe5a1142cd57dde7ca12334982643a9161be31c3c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: app.App: FunctionTooLong \u2014 App runs 199 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 99 over it, 1.99\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":"typescript2/app-type-quiz/src/app.tsx"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db49ef85859002097b0d495615a5e43d3fbb5bf4583ca1b90ccca63163536fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ir_helpers/mod.rs: FileTooLong \u2014 993 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 493 over it, 1.99\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":"engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f97486366edc3943530980d87d3071a5645a6d399aa27c4772ca6517fa2083b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AwsClient: ClassTooLong \u2014 792 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, 9 blocks, lines 156-1503. The bar is 400 significant lines; this is 392 over it, 1.98\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":"engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af9d7f250b645514a99571d7a6049aea38975721fe0d5330b5bfa482bc73de6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_ast::lower_tree::body::expression_in_chain: FunctionTooLong \u2014 baml_compiler2_ast::lower_tree::body::expression_in_chain runs 198 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 98 over it, 1.98\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":"baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"58cb92d0c38d7931fcea882173e8f173f6cad4e677fe513a3d0519c94c7f6698"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bex_sap::deserializer::coercer::array_helper::pick_best: FunctionTooLong \u2014 bex_sap::deserializer::coercer::array_helper::pick_best runs 197 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 97 over it, 1.97\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":"baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"062d2038adb4c115b37289e2dd3c216caef941d029105b1381ab2aa953ec1517"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BcsDeliveryHandle.submit: MethodTooLong \u2014 submit runs 197 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 97 over it, 1.97\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":"baml_language/crates/btel_bcs/src/delivery.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"801a8c3710ade5c70a2e50ebe9bebf6b0f3dad1d91c86d32dec923aac34071bf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DatamodelError: TooManyMethods \u2014 59 methods. The bar is 30 methods; this is 29 over it, 1.97\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":"engine/baml-lib/diagnostics/src/error.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5f468c328bcbfa469be0d2b18710d1ea814a0cae053ab6153dd89c38fb2a68"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/emit.rs: FileTooLong \u2014 982 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 482 over it, 1.96\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":"baml_language/sdks/java/sdkgen_java/src/emit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4607da53310eed55c7e111c9a1cca90ec94da07a4b026ed167b9a6cee8f614"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: newsletter-form.NewsletterForm: FunctionTooLong \u2014 NewsletterForm runs 196 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\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":"typescript2/app-website/components/newsletter-form.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb5010284210bb94f40c7fa3c8d330e52183c4206f6aa342f97d876e46126e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/value.rs: FileTooLong \u2014 979 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 479 over it, 1.96\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":"baml_language/crates/btel_reader/src/value.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d181f0d71e631822e26c74f59800de85a96557b5bd7c62bf2a3133b8515cf095"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Diagnostic.fmt: MethodTooLong \u2014 fmt runs 195 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 95 over it, 1.95\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":"baml_language/crates/bcs_api/src/diagnostics.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a452190a4c9a87ebe05288303f6feee7feb9d640248bdee02df8b2842502ea9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_rust::analyze::analyze: FunctionTooLong \u2014 sdkgen_rust::analyze::analyze runs 195 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 95 over it, 1.95\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":"baml_language/sdks/rust/sdkgen_rust/src/analyze.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4af93464c80e2c78d321d45e8f73c901bf3259cd802d70733f27be45134fdb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_runtime::internal::prompt_renderer::render_output_format::relevant_data_models: FunctionTooLong \u2014 baml_runtime::internal::prompt_renderer::render_output_format::relevant_data_models runs 195 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 95 over it, 1.95\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":"engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"703374972b9a9aae0c892ef855efcbec86da9b5eb674fe7ee1a86f290a92a79a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: generated-reference.GeneratedReferenceContent: FunctionTooLong \u2014 GeneratedReferenceContent runs 195 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 95 over it, 1.95\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":"typescript2/app-developer-docs/components/generated-reference.tsx"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"768535ecabd79d38c39510e3354e9ad580fc3283f9207248934f3e69b292ca72"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Workbench.Workbench: FunctionTooLong \u2014 Workbench runs 195 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 95 over it, 1.95\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":"typescript2/app-website/app/(home)/bamlcode/_components/Workbench.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1740d0744bd17bdbfd1cb212799fd85e024fe960594c76ead89f43060f7fbc0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BamlFfi: TooManyMethods \u2014 58 methods. The bar is 30 methods; this is 28 over it, 1.93\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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlFfi.java"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7223d4101cff3f8fc41b8148bdc4e4a50633e876ac8223c7e6f9c7231ce78d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_mir::pretty::write_terminator: FunctionTooLong \u2014 baml_compiler2_mir::pretty::write_terminator runs 193 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 93 over it, 1.93\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":"baml_language/crates/baml_compiler2_mir/src/pretty.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"727082235a333504f875a1630b145065f0e201eda38b631d5eab0faba213416d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_db::check::tir_type_error_to_diagnostic_id: FunctionTooLong \u2014 baml_db::check::tir_type_error_to_diagnostic_id runs 193 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 93 over it, 1.93\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":"baml_language/crates/baml_db/src/check.rs"},"region":{"startLine":2173}}}],"partialFingerprints":{"codehealthFindingId/v1":"596aacef3e8022c45910feff3051c92589cc4286d6bc3ada76b09e478406bc99"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_python_pydantic2::leaf::render_leaf_body_pyi: FunctionTooLong \u2014 sdkgen_python_pydantic2::leaf::render_leaf_body_pyi runs 193 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 93 over it, 1.93\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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":2653}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31613632d6a124bb94776fc09327e43f7bd349b1e30aec02f2f43fb199f45e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/async_vm_runtime.rs: FileTooLong \u2014 962 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 84% of them inside a single declaration: BamlAsyncVmRuntime (5 blocks, 49-1471). The bar is 500 significant lines; this is 462 over it, 1.92\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":"engine/baml-runtime/src/async_vm_runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b79692293dfce495ecc5074689c9af7d2caa11c9d719381075cf0219abe002"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Blob.logical_bytes_approx_v1: MethodTooLong \u2014 logical_bytes_approx_v1 runs 192 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 92 over it, 1.92\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":"baml_language/crates/btel_snapshot/src/logical_bytes.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"9762fece6a2bc5731d0d1fbe081e4cb36c1d83623f299ad95678bb02afe88d16"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: package_reflect/graft.rs: FileTooLong \u2014 956 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 456 over it, 1.91\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":"baml_language/crates/bex_vm/src/package_reflect/graft.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef5201ca85e37382a1d5bb523d2ed7714454846373fdf6d2a26802b18cb0c60"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/codegen.rs: FileTooLong \u2014 955 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 455 over it, 1.91\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":"engine/baml-compiler/src/codegen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5bf6129d733c1675c458292fb9c5919b9c589e0048c40f4b641de03a7278ecd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.lower_lvalue: MethodTooLong \u2014 lower_lvalue runs 191 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 91 over it, 1.91\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":12365}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36dfa47f00d7ff72cec86cd58335fa07f8459a47f982be2b24ed2d5b7774b3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_runtime::tracingv2::storage::storage::build_function_log: FunctionTooLong \u2014 baml_runtime::tracingv2::storage::storage::build_function_log runs 191 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 91 over it, 1.91\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":"engine/baml-runtime/src/tracingv2/storage/storage.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06460f23745ad122d8e65683f970a79c9ef11b386249be112b37b44b7b73fa9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bep-nav.BepNav: FunctionTooLong \u2014 BepNav runs 191 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 91 over it, 1.91\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":"typescript2/app-beps/src/components/bep/bep-nav.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"0762d95be4dd66a3dabc933b8d3c1d736bb0a6984359f8bd8885e2417df3f355"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: decision-card.DecisionCard: FunctionTooLong \u2014 DecisionCard runs 191 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 91 over it, 1.91\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":"typescript2/app-beps/src/components/decisions/decision-card.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a00f54bd4465c20dda0cc18609d903010f1a8b9914a4c2d658ac0a04b564c8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: package-generator.buildReferencePages: FunctionTooLong \u2014 buildReferencePages runs 191 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 91 over it, 1.91\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":"typescript2/app-developer-docs/lib/generated-content/package-generator.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a27c7056740277d249c9bd36b3639698124bcdac2f62e64cb0e614772eb9287"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Proto/PrimitiveProtocol.cs: FileTooLong \u2014 954 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 454 over it, 1.91\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":"baml_language/sdks/csharp/bridge_csharp/src/Proto/PrimitiveProtocol.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"237033f0576632a5d776d059d4847d83acf35aafc9fa3c7a7c672cd1410e0a02"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BexEngine.convert_heap_ptr_to_external_with_type: MethodTooLong \u2014 convert_heap_ptr_to_external_with_type runs 190 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 90 over it, 1.90\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":"baml_language/crates/bex_engine/src/conversion.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7b5a7ffe78558affa1102ca3cf31040797957aa077774398f03ab1899c610c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/render.rs: FileTooLong \u2014 945 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 445 over it, 1.89\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":"baml_language/crates/baml_compiler_diagnostics/src/render.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"078d719a59de15ef2b4499075160385a7d4241c354f348c271034caf6f49decd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: internal_baml_jinja::render_minijinja: FunctionTooLong \u2014 internal_baml_jinja::render_minijinja runs 188 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 88 over it, 1.88\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":"engine/baml-lib/jinja-runtime/src/lib.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"99acfbdfd0f735c810d5768b978c61313d83b492a44742d859f1de883c57f174"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: code-mirror-viewer.CodeMirrorViewer: FunctionTooLong \u2014 CodeMirrorViewer runs 188 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\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":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/codemirror-panel/code-mirror-viewer.tsx"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4f05cb1ed9dd7b9d5b322f220f647d2b45d9ffb94813a55cc4bf87034b8285"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.lower_lambda: MethodTooLong \u2014 lower_lambda runs 187 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 87 over it, 1.87\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":4958}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee435612a1521f8e8b12f816bb75ba6d69ceb10b9017cda66facab8ff93853bc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeError.to_diagnostic: MethodTooLong \u2014 to_diagnostic runs 187 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 87 over it, 1.87\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":"baml_language/crates/baml_compiler_diagnostics/src/to_diagnostic.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c342479b2e2b10c86538d0dafbf4711585b73f542ccad8490086afd86fb0e6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.infer_lambda: MethodTooLong \u2014 infer_lambda runs 186 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 86 over it, 1.86\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":8793}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f31643eeb83b7da1dd5295d2a099b49659c695ee3dc7d51de5f0cd7b1dc0fe8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.build_tagged_body_closure: MethodTooLong \u2014 build_tagged_body_closure runs 186 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 86 over it, 1.86\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":5513}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c156ce26dadf525287e6ffb1ac33def159c07fda72303ea7f527dfcb64e6fbd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/MonacoEditor.tsx: FileTooLong \u2014 928 significant lines (blank, comment-only and punctuation-only lines excluded), about 79% of them inside a single declaration: MonacoEditor (300-1411). The bar is 500 significant lines; this is 428 over it, 1.86\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":"typescript2/pkg-editor/src/MonacoEditor.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e76aeb9f2e9f8089277112e091c41d9809f24b9a8c731c7ca0eb45d1d1783e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: package_reflect/type_class.rs: FileTooLong \u2014 927 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 427 over it, 1.85\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":"baml_language/crates/bex_vm/src/package_reflect/type_class.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0024b8bda8f990efebb5723efbe1b9d47fe2c0235874456993ce8e4426c12158"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 926 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: ConversionBuffer (3 blocks, 58-1132). The bar is 500 significant lines; this is 426 over it, 1.85\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":"baml_language/crates/btel_recorder/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81770996a41874ef1f5bb8f8d957a8d6d978699d1d20265c8d7a28cf4f55f87"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.member_callee: MethodTooLong \u2014 member_callee runs 185 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 85 over it, 1.85\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":6945}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae862efaa183037fc94b19e554a507341955bdde0bae5cd1a4885990b35e9ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: internal_baml_core::ir::repr::annotate_variable: FunctionTooLong \u2014 internal_baml_core::ir::repr::annotate_variable runs 185 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 85 over it, 1.85\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":"engine/baml-lib/baml-core/src/ir/repr.rs"},"region":{"startLine":2437}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58be74feb03674a30727c1338bcb7f5d322659a4543d3fb085f319cd1df56ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: jsonish::deserializer::coercer::array_helper::pick_best: FunctionTooLong \u2014 jsonish::deserializer::coercer::array_helper::pick_best runs 185 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 85 over it, 1.85\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":"engine/baml-lib/jsonish/src/deserializer/coercer/array_helper.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5a2eb7ae456ed87eef2d9d64bbf241778b0efc9bb8e26c4233f531fca917d6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Expression.repr: MethodTooLong \u2014 repr runs 184 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 84 over it, 1.84\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":"engine/baml-lib/baml-core/src/ir/repr.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c7156eab83832279284c0e265f2a8374d702779ed6e880f8c86b34e4f01fb9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: vscode.VSCodeMock: FunctionTooLong \u2014 VSCodeMock runs 184 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\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":"typescript2/app-website/components/vscode.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4cfca0c199d2a9a53368f480f0ceee65ff5fb7703c2fa9299e59668fdae7c2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Translator.raw: MethodTooLong \u2014 raw runs 183 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 83 over it, 1.83\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":"baml_language/crates/baml_query_btel/src/sql.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb2baf1f05265ab52fa33ae213b56d1b01915a48ac8d056d7d50de9398fec7e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MonacoEditor: ClassTooLong \u2014 729 significant lines (blank, comment-only and punctuation-only lines excluded), 5 methods. The bar is 400 significant lines; this is 329 over it, 1.82\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":"typescript2/pkg-editor/src/MonacoEditor.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cea63b6eaac0849c3f4ae2c5acf11c7e415f2ed00da06a4cd11d86ef4dce5c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/declarations.rs: FileTooLong \u2014 910 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 410 over it, 1.82\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":"baml_language/crates/baml_fmt/src/ast/declarations.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fa8b91072ad3a0d796e34fa74baf078b9f96c08db5b9fca8ce7910ee3123b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fourth-bento-animation.FourthBentoAnimation: FunctionTooLong \u2014 FourthBentoAnimation runs 182 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\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":"typescript2/app-website/components/fourth-bento-animation.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"288b586be9f636126c69d60397618e0cb56c70301d07e109a557c702d6af0034"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Hir2Diagnostic: ClassTooLong \u2014 724 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), 1 methods, 2 blocks, lines 26-1069. The bar is 400 significant lines; this is 324 over it, 1.81\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir/src/diagnostic.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d69b8de777748afef73d7cdd8bbb23a55855723dbf46f3708f088a375d953c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: council-gate.Council: FunctionTooLong \u2014 Council runs 181 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 81 over it, 1.81\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":"typescript2/app-website/app/(home)/sheep-council/council-gate.tsx"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a9848e38982a014034ed463896462ecb791b8379b3578e9ba75e162b8da419"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/exhaustiveness.rs: FileTooLong \u2014 904 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 404 over it, 1.81\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":"baml_language/crates/baml_compiler2_hir_ty/src/exhaustiveness.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9739e5c3744cfdd8d5628052da395c9937c21cc71144c1f02c37e04dd38c9f43"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/export.rs: FileTooLong \u2014 903 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 403 over it, 1.81\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":"baml_language/crates/baml_ide/src/export.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ec45b9ee882785feb2649b8adf4e293e969a2200ed275330455de614c4741b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tracing/mod.rs: FileTooLong \u2014 902 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 402 over it, 1.80\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":"engine/baml-runtime/src/tracing/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0a2829c67c339c5da56abd2a278d7e69a02fb5ac32a61e936c5b2b6bf2fafb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BexVm.unwind_exception_frames: MethodTooLong \u2014 unwind_exception_frames runs 180 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 80 over it, 1.80\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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":6733}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fa7793b5ec1f12991ad020edb21012735f5c451c6740435a3c31c78a4c3fec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_go::render_source_code_with_bytecode_and_options: FunctionTooLong \u2014 sdkgen_go::render_source_code_with_bytecode_and_options runs 180 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 80 over it, 1.80\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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4302f14e06b7e0bc4fdfeea50b245170eba7716aadd14ba527c8609c2459712"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bep/bep-route-shell.tsx: FileTooLong \u2014 896 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: BepRouteShell (74-1124). The bar is 500 significant lines; this is 396 over it, 1.79\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":"typescript2/app-beps/src/components/bep/bep-route-shell.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d56acfb4e4a97b34b45f1ca761e07fc10049f49d1f1bd69f12255940374e68"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_csharp::semantic::render_program: FunctionTooLong \u2014 sdkgen_csharp::semantic::render_program runs 178 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 78 over it, 1.78\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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":3412}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2c0eac2591cfb47b398a0e70d179d42d7e14ee35a0a964dd6fe75fa929a801"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ImplResolver: ClassTooLong \u2014 711 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), 35 methods, 4 blocks, lines 102-1347. The bar is 400 significant lines; this is 311 over it, 1.78\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":"baml_language/crates/bex_vm/src/package_baml/resolve.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"823a986860ae7c0879be51312b1f6fb991961a6263cda7c65035eb0c0687338b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PropertyHandler.ensure_http_config: MethodTooLong \u2014 ensure_http_config runs 177 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 77 over it, 1.77\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":"engine/baml-lib/llm-client/src/clients/helpers.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75b1ac453aa69fc5c3180dfe3fd7e942a3cc72490eb6b712a72eef98226bd60"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_runtime::internal::llm_client::primitive::stream_request::make_stream_request: FunctionTooLong \u2014 baml_runtime::internal::llm_client::primitive::stream_request::make_stream_request runs 177 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 77 over it, 1.77\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":"engine/baml-runtime/src/internal/llm_client/primitive/stream_request.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e8bcffa8e5b7bbf73025731bda8aa1da1ba675d9696f2726e6f8eea2f90b0b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PrimitiveProtocol: TooManyMethods \u2014 937 significant lines (blank, comment-only and punctuation-only lines excluded), 53 methods. The bar is 30 methods; this is 23 over it, 1.77\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Proto/PrimitiveProtocol.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61218695b07b53365c15f119d385438aa4effdd0fd5c140b677d09fcf6f0003"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: baml_bridge/BamlType.java: FileTooLong \u2014 880 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: BamlType (103-1527). The bar is 500 significant lines; this is 380 over it, 1.76\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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlType.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b6ac0f64dd3b34025ab244cc814b4ce77365c787a54f9c3f8f397fd78699e3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BexEngine.execute_runtime_compile: MethodTooLong \u2014 execute_runtime_compile 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":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":7581}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dab6cb3d9157a7f0f48edc8cb1e287f61cea8b62a3bed15c3dd0286b6a6bbea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: decision-form.DecisionForm: FunctionTooLong \u2014 DecisionForm runs 175 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"typescript2/app-beps/src/components/decisions/decision-form.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e52956049702d13b8981f5176292bba0d8209a6d275661f3e739c9dff82e027"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: issue-detail.IssueDetail: FunctionTooLong \u2014 IssueDetail runs 175 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"typescript2/app-feedback/src/components/issues/issue-detail.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e0e619d49e9c3688542ebf1687231853c2959f801b86b68c5434c0cce877d0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.lower_interface_pattern: MethodTooLong \u2014 lower_interface_pattern runs 174 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 74 over it, 1.74\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"886a43de9ba3f810c43cbb3b81cf4f3095106953a4eceae1ecde175803f8209f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: software.Figure: FunctionTooLong \u2014 Figure runs 174 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\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":"typescript2/app-website/components/home/software.tsx"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dec36ec6c2329219552d87b77ce8f25f403cd17a936a6314a41ce3d6202644b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: new-post.generatePost: FunctionTooLong \u2014 generatePost runs 174 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\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":"typescript2/app-website/scripts/new-post.ts"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e948b58ee06ebbf886962297ecaa507bb83b27225ae85e76ebcd1f4f4808ea"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: InferenceContext: TooManyFields \u2014 52 stored fields beside 309 methods. The bar is 30 stored fields; this is 22 over it, 1.73\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":2114}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefb8b4ddde7d8364288425676589ad9ec6434c5a9d55ca4eda47fd6c374380f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/telemetry.rs: FileTooLong \u2014 863 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 363 over it, 1.73\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":"baml_language/crates/bex_engine/src/telemetry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8bb5be9863ef3bb4f518a6e26b5cf321c41c9b67a7dc7c10403f1253283774"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/emit.rs: FileTooLong \u2014 861 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 361 over it, 1.72\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":"baml_language/sdks/swift/rust/sdkgen_swift/src/emit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19bccc26dbd02136897bcc973c7777df334400e56ebfc8baebf88701a2d23ed4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.sub: MethodTooLong \u2014 sub runs 172 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 72 over it, 1.72\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":4559}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34dc9cdcc47c5f7cf46a73c3d30230ebce4f922fc42e1bcfec00dfb3ef8fb74"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IRSignature.new_from_ir: MethodTooLong \u2014 new_from_ir runs 172 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 72 over it, 1.72\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":"engine/baml-lib/baml-core/src/ir/ir_hasher/mod.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc744a9395764b83f14c18831e637861e7cb603bc7f296ab3e11925dac10422"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/vm.rs: FileTooLong \u2014 859 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 93% of them inside a single declaration: Vm (2 blocks, 186-1842). The bar is 500 significant lines; this is 359 over it, 1.72\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":"engine/baml-vm/src/vm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc5384b6f6c88a32ede3ba17a995cb276788299ca29e322dd50c8c452ec72a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page.UsersPage: FunctionTooLong \u2014 UsersPage runs 171 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\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":"typescript2/app-beps/src/app/users/page.tsx"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf974709b22f413cae4433e878cb4fedca5898a13d1d367bb87cdbabb8f52347"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: control_flow/from_ast.rs: FileTooLong \u2014 853 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 63% of them inside a single declaration: AstGraphBuilder (2 blocks, 67-818). The bar is 500 significant lines; this is 353 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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b691b6cc559f48404f4ecfedeac269608d6aea365261531a21528ddabdc3b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: json/encode.rs: FileTooLong \u2014 850 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 350 over it, 1.70\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":"baml_language/crates/bex_vm/src/package_baml/json/encode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43dfa1d331a3973d9f1841f678b6a367bfbda266d9b74fbae3e17b5c973c0dd8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_mir::pretty::write_rvalue: FunctionTooLong \u2014 baml_compiler2_mir::pretty::write_rvalue runs 170 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 70 over it, 1.70\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":"baml_language/crates/baml_compiler2_mir/src/pretty.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5e7b4bd4b6b62b6f549a160cb7e3b8280310a469865c330ef19e6c65f64c35"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Planner: ClassTooLong \u2014 676 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), 22 methods, 2 blocks, lines 274-1285. The bar is 400 significant lines; this is 276 over it, 1.69\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":"baml_language/crates/bridge_encode/src/plan.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"247e22d8f9ef16107f9157d08d92fe827dca8f574cfbb09784d024492df3ab29"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.infer_callee: MethodTooLong \u2014 infer_callee runs 169 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 69 over it, 1.69\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":6684}}}],"partialFingerprints":{"codehealthFindingId/v1":"0faba1c8495db6ae7efcbb59bb123ff9f3fb6f4fc980553c662b18fd45773363"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: comment-thread.CommentThread: FunctionTooLong \u2014 CommentThread runs 169 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\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":"typescript2/app-beps/src/components/comments/comment-thread.tsx"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"479b6d69c93de964817226d12c551e20bf28143ee644b1d1fb9a5e9cd5d5f5f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pkg-grammar-treesitter/grammar.js: FileTooLong \u2014 843 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 343 over it, 1.69\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":"typescript2/pkg-grammar-treesitter/grammar.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"750ff15e8dcb0aeb8e3c643259cea6ee51f4425736889b82dda20c5d9a808b2f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BamlAsyncInterpreterRuntime: ClassTooLong \u2014 672 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), 20 methods, 5 blocks, lines 51-1029. The bar is 400 significant lines; this is 272 over it, 1.68\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/async_interpreter_runtime.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ee72d553135168dc998dcc6405ac26cf0a9d352fb637486fbd48685701bfd0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: publisher.publishDocumentRelease: FunctionTooLong \u2014 publishDocumentRelease runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\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":"typescript2/app-developer-docs/lib/generated-content/publisher.ts"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a657ffc743dc122f14a1dd401eaed52142f0155026fb472c5e232d235317f07"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: signup.submitSignup: FunctionTooLong \u2014 submitSignup runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\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":"typescript2/app-website/app/actions/signup.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"530323c390b451ee121d6cd5faeec276c58118e3410c5d758306485c8470ee96"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BexVm.set_entry_point_with_type_args: MethodTooLong \u2014 set_entry_point_with_type_args runs 167 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 67 over it, 1.67\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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":5114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97713ef9b629f68033d1af76d5b6a262b8e6b6a69ec8581da2081e2d6138811"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeSysOps._send_sse: MethodTooLong \u2014 _send_sse runs 167 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 67 over it, 1.67\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":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":3428}}}],"partialFingerprints":{"codehealthFindingId/v1":"4881486bf6942f8a3ed1702e31bc65fa77702de9c3a9ac3685fce442555455e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: version-analysis-status.VersionAnalysisStatus: FunctionTooLong \u2014 VersionAnalysisStatus runs 167 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\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":"typescript2/app-beps/src/components/ai-assistant/version-analysis-status.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c87765825b2611999ebab7a907e990ceedce2c9c8e7f89ee7b1229a98d7abfb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: package_baml/array.rs: FileTooLong \u2014 834 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 334 over it, 1.67\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":"baml_language/crates/bex_vm/src/package_baml/array.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"566ba34bdc8263176172befc7ca2f147a7cde844329f4c62505d636486b751d2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InMemoryRunStore: ClassTooLong \u2014 667 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), 25 methods, 4 blocks, lines 680-1532. The bar is 400 significant lines; this is 267 over it, 1.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_events/src/run.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90e393684eaeb7b632d399f0d7da760a6b0fe8555a941b9aeed32683dca7823"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SemanticIndexBuilder: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir/src/builder.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0bc82753d23c1119829a36165e2072c8aacea6d60ea13992afd342afcbed4b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: package_reflect/runtime_class_builder.rs: FileTooLong \u2014 833 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 333 over it, 1.67\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":"baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45d6d53cbaf29a3775c8902f3c62b0ecabb6537deb02d415c93898273b02d26"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: issue-list.IssueList: FunctionTooLong \u2014 IssueList runs 166 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\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":"typescript2/app-feedback/src/components/issues/issue-list.tsx"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"31602823746d7948e638dcb8747e9e0444f1efdac7dd0caf34a84b7df414052a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Values/BamlValue.cs: FileTooLong \u2014 825 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 325 over it, 1.65\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":"baml_language/sdks/csharp/bridge_csharp/src/Values/BamlValue.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7f9281f086325f3c33612251d3a792d3be6d6faf0b2ccdc148ac1c8a42d699"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_hir_ty::impls::impl_facts: FunctionTooLong \u2014 baml_compiler2_hir_ty::impls::impl_facts runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/impls.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"c001d74ece604e723bcc1e669df441f5821655df3a771effb43be9a13df0d4c6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.lower_expr: MethodTooLong \u2014 lower_expr runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":5942}}}],"partialFingerprints":{"codehealthFindingId/v1":"595b05aabc2d57d908d3673f1a0d4ebf6b635ff4d8df362df24dc844c96dc844"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bex_vm::package_baml::root::render_to_sink: FunctionTooLong \u2014 bex_vm::package_baml::root::render_to_sink runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/root.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c2a308c382e269fade5bb8cd521a0228ea862630d4db5fd940270b561e4766"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_rust::translate_ty::translate_inner: FunctionTooLong \u2014 sdkgen_rust::translate_ty::translate_inner runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/rust/sdkgen_rust/src/translate_ty.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8cb4df35c7e94cf316aeea8b8a264f73e9fed0aff318e534875c91af160a43"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bep-export-all-dialog.BepExportAllDialog: FunctionTooLong \u2014 BepExportAllDialog runs 165 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-export-all-dialog.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02b6459d1cd5d9c2cc346fa0b3aded718b39636786a2515e2bd840ab639da1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: runtime.createSolveRuntime: FunctionTooLong \u2014 createSolveRuntime runs 165 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_lib/runtime.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82186b8b15c1a34222ff8ba20f9651b6e8d08e5a2625c7c7065f7f3caee3be5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AwsClient.stream_chat: MethodTooLong \u2014 stream_chat runs 164 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 64 over it, 1.64\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":"engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"75402802d7ecdd547aff502bebf74c388154e725f882512d9817ae7a2c70edf8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bep-submit-modal.BepSubmitModal: FunctionTooLong \u2014 BepSubmitModal runs 164 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\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":"typescript2/app-beps/src/components/bep/bep-submit-modal.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"057f5bffd7602eadab35c5eca2700a7f37989fc7d44714001a621061e551ae1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: comments/comment-feed-view.tsx: FileTooLong \u2014 819 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 319 over it, 1.64\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":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cecd3646a9a2a2e84c47ce5b4952073328cc28e4aadcf8c352f3cfdff0f67e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bex_vm::debug::display_instruction: FunctionTooLong \u2014 bex_vm::debug::display_instruction runs 163 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 63 over it, 1.63\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":"baml_language/crates/bex_vm/src/debug.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab677ef68f1ed15fc8ac36ee5a22584358a032c28e61907d21b201814cfd2359"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_go::render_union_codecs: FunctionTooLong \u2014 sdkgen_go::render_union_codecs runs 163 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 63 over it, 1.63\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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":4050}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9566a0c4f43af72479d2f5fd2da9a5ae1c668fb38c7062828c59f2852ef5798"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_query_btel::query::run: FunctionTooLong \u2014 baml_query_btel::query::run runs 162 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 62 over it, 1.62\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":"baml_language/crates/baml_query_btel/src/query.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ab2691d5b24373cf68bc2675f179b23e7aca0dc999974de7930cfdff155e67"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BexEngine.projected_surface: MethodTooLong \u2014 projected_surface runs 162 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 62 over it, 1.62\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":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":7113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3adaa2ef78abb29db1b2499bff82b03fcfe211801f2c785f9c9ace84352414a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GoNames.for_pool: MethodTooLong \u2014 for_pool runs 162 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 62 over it, 1.62\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":"baml_language/sdks/go/sdkgen_go/src/names.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30da8c1c0fcbf3b6c9ebddef489d9734cd77867672a5c1eba129829e0a2b538"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_hir_ty::impls::hash_eligible_within_depth: FunctionTooLong \u2014 baml_compiler2_hir_ty::impls::hash_eligible_within_depth runs 161 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 61 over it, 1.61\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":"baml_language/crates/baml_compiler2_hir_ty/src/impls.rs"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca90bac6b100944a808a177025630fbf85b347f9b231392d9006d1cbe2beb73"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_derive::derive_baml_hash: FunctionTooLong \u2014 baml_derive::derive_baml_hash runs 161 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 61 over it, 1.61\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":"engine/baml-lib/baml-derive/src/lib.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"019d6b400ed5031acc0a5ccb800524c94cca66e234fb3cfd98c8b7a8131b87d1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MirBuilder: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\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":"baml_language/crates/baml_compiler2_mir/src/builder.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4068de4069958ad76f6fcb57ce49f54037c95f3631ccb689a8ddb09698f7943f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_query_btel::ingest::apply_fresh: FunctionTooLong \u2014 baml_query_btel::ingest::apply_fresh runs 160 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 60 over it, 1.60\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":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b534ffd3172945f6bb8614a79c1309810d9da57c432a5b9bdbff461e8277969"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/expr.rs: FileTooLong \u2014 796 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 296 over it, 1.59\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_parser/src/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2697f2867634f8053c74196bfe0f527f5042a157e15e781c2d072b27338e2527"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cargo_stow::main: FunctionTooLong \u2014 cargo_stow::main runs 159 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 59 over it, 1.59\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":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":2577}}}],"partialFingerprints":{"codehealthFindingId/v1":"98fbf080f36cac89eab30f6f2b2b1cbbc5b54818c1afa2bbf1f55add7948723d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: annotation-svg.renderAnnotatedSnippet: FunctionTooLong \u2014 renderAnnotatedSnippet runs 159 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\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":"typescript2/app-developer-docs/lib/snippets/annotation-svg.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"06772a9d1fa8883e83abc65bd4f176cf99d38631981da87a2cea5a5bab8f3a7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: BamlBridge/BamlUnions.swift: FileTooLong \u2014 792 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 292 over it, 1.58\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":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"821f2e77ee08fc6ef50fd6638dac4609b838ab826773c3809a7d4954ec6857d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_lsp_server::run_server_inner: FunctionTooLong \u2014 baml_lsp_server::run_server_inner runs 158 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 58 over it, 1.58\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":"baml_language/crates/baml_lsp_server/src/lib.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b08ba385c52ae7c617b56f970f203485f75302579b648e183adc07b4a0d585"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Instruction.fmt: MethodTooLong \u2014 fmt runs 158 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 58 over it, 1.58\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":"baml_language/crates/bex_vm_types/src/bytecode.rs"},"region":{"startLine":1993}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea79a2e5a5f06e34f5119e8e0f1c5401b60e3c1b0e477a811012c2685d933d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page.TermsOfServicePage: FunctionTooLong \u2014 TermsOfServicePage runs 158 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\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":"typescript2/app-website/app/(home)/tos/page.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc963685ae728140b5c9d9932ee0245fd63dc9199e01643d2178bec44eb206b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BamlValueWithMeta: ClassTooLong \u2014 631 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), 12 methods, 8 blocks, lines 427-1467. The bar is 400 significant lines; this is 231 over it, 1.58\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":"engine/baml-lib/baml-types/src/baml_value.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7555651845f90c14fe994884c00f6c9d318467ba5d78991a7a5fe3bc3897876"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OutputFormatContent: ClassTooLong \u2014 630 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), 21 methods, 3 blocks, lines 106-1122. The bar is 400 significant lines; this is 230 over it, 1.58\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":"baml_language/crates/sys_ops/src/output_format.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8dd293c7f601f05815c76e9bd9b8e2490cf881ffcb723f8871830cdf600e3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/items.rs: FileTooLong \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). The bar is 500 significant lines; this is 285 over it, 1.57\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":"baml_language/crates/baml_compiler2_emit/src/items.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"776dc1db81385280ddd06be4419dc6fd59f44f7c63453c32033f8b034fce5c9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 784 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 44 free functions. The bar is 500 significant lines; this is 284 over it, 1.57\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":"baml_language/forks/google-cloud-auth/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"467c63c684cf91aab3aaa8e5f4fe9087a30b1ecc516b0b0faffe0761a0f91fe7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Cursor: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\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":"baml_language/crates/baml_parser/src/cursor.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb6e9f6f089d04011bbc6aec29c2c402694da57d94a142f6a2f4ad15f1f37ed"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypeBuilder: TooManyMethods \u2014 47 methods, declared across 4 files: type_builder/mod.rs (15), types/type_builder.rs (15), raw_objects/type_builder.rs (11), types/type_builder.rs (6). The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"engine/baml-runtime/src/type_builder/mod.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aeed61a3524fb2fc95b4f854da8f6d20639efa18d718218095a26fa81f3f33d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DiagnosticId.code: MethodTooLong \u2014 code runs 156 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 56 over it, 1.56\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":"baml_language/crates/baml_compiler_diagnostics/src/diagnostic.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b096d5b5fecdbd300f371e05be464effa60c8989ee73456d801d7aa757dd74"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Bytecode.instruction_to_opcode: MethodTooLong \u2014 instruction_to_opcode runs 156 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 56 over it, 1.56\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":"baml_language/crates/bex_vm_types/src/bytecode.rs"},"region":{"startLine":3099}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24b284f3e6a1b10c3433058169363b1de8f5f3c03b76dcf530af2f91efa32ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_java::emit::render_callable_pair: FunctionTooLong \u2014 sdkgen_java::emit::render_callable_pair runs 156 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 56 over it, 1.56\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":"baml_language/sdks/java/sdkgen_java/src/emit.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0285a156e9109983dd10a33e91834da2d9573722ab62f27717f73dd46c0126"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_bridge::capi::load_inner: FunctionTooLong \u2014 baml_bridge::capi::load_inner runs 156 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 56 over it, 1.56\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":"baml_language/sdks/rust/bridge_rust/src/capi.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec5b5f88c2cab579faacf4aeabc8f614ccec0f2048827a49311b0dc1158087e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page.LoginContent: FunctionTooLong \u2014 LoginContent runs 156 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\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":"typescript2/app-beps/src/app/login/page.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"678d4f66fa6d5466865728e2e43aa148e5c2a35ae9497c1fbae0d15d78128078"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: issue-form.IssueForm: FunctionTooLong \u2014 IssueForm runs 156 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\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":"typescript2/app-beps/src/components/issues/issue-form.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41dcc597a8364b70095747518e1f9c107e0cdffc8ef3dd5240ea6c8e57de3c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: baml_bridge/proto.py: FileTooLong \u2014 778 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 278 over it, 1.56\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":"baml_language/sdks/python/src/baml_bridge/proto.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bdd247c80f054e76a35395176d5386a8cbcdee41c0222ef1f260ad941a37cb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ReplArgs: ClassTooLong \u2014 620 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), 2 methods, 2 blocks, lines 226-1703. The bar is 400 significant lines; this is 220 over it, 1.55\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/cli/repl.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"f426dfd6460f679ede5197bb33b7ee0da0ccfcaf7dacd0505f22f43b4aea9564"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: package_baml/resolve.rs: FileTooLong \u2014 775 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 92% of them inside a single declaration: ImplResolver (4 blocks, 102-1347). The bar is 500 significant lines; this is 275 over it, 1.55\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/resolve.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac87c3ccf236e0839e7d6042163d840c36463defbd794629a6e7606a9e78a34"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: home/hero-video.tsx: FileTooLong \u2014 775 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 275 over it, 1.55\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":"typescript2/app-website/components/home/hero-video.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a57016ffe5e699ce8349f0c376ed8261ec0937706927a9ca926968b390527e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/obligations.rs: FileTooLong \u2014 771 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 85% of them inside a single declaration: InferenceContext (254-1320). The bar is 500 significant lines; this is 271 over it, 1.54\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer/obligations.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd2a4e4a2b7daf8e4e7f104882889b2e165c772b01eea3067e162802730d40f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: comments/comment-sidebar.tsx: FileTooLong \u2014 768 significant lines (blank, comment-only and punctuation-only lines excluded), about 83% of them inside a single declaration: CommentSidebar (177-997). The bar is 500 significant lines; this is 268 over it, 1.54\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":"typescript2/app-beps/src/components/comments/comment-sidebar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9c70ab2f3caf07a1cc119c4f4282d3fd11ebcfef7d0e7ee945734b9346ba00"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LowerCtx: 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":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2457d6c77497a0d929cf14cf5bb20fcd0270b5522561c296ef4d03400cbc0e9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LoweringContext: ClassTooLong \u2014 612 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), 29 methods, 2 blocks, lines 1154-2160. The bar is 400 significant lines; this is 212 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":"baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8599c9818b49ba626df2416be8260de8e0d151e2f382d0dc9d40585902da130"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_emit::items::build_interface_def: FunctionTooLong \u2014 baml_compiler2_emit::items::build_interface_def runs 153 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 53 over it, 1.53\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":"baml_language/crates/baml_compiler2_emit/src/items.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad02231a58799907a9e1b60a0f0196efb7f81e37f2c261d0fc8a3e8e52525db"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Statement.to_doc: MethodTooLong \u2014 to_doc runs 153 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 53 over it, 1.53\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":"engine/baml-compiler/src/hir/dump.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7111531acb2bd34bf3938d5198974e8841cf069bd5d1372aaa4c808e2d1297e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: meter.Images: FunctionTooLong \u2014 Images runs 153 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\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":"typescript2/app-website/components/pricing/meter.tsx"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a556d5510a800ba3f6526fb36fd10edd931a22bbde89fbcae23836989ffb1b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/coherence.rs: FileTooLong \u2014 762 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 34 free functions. The bar is 500 significant lines; this is 262 over it, 1.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39d722094c6f347cfe3546e0513b6b49c299a99f360a2dae8d79629d2693fca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/async_interpreter_runtime.rs: FileTooLong \u2014 760 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 88% of them inside a single declaration: BamlAsyncInterpreterRuntime (5 blocks, 51-1029). The bar is 500 significant lines; this is 260 over it, 1.52\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/async_interpreter_runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70ff444f544143276c5177a729bc500c1b36900f3d22b9633d9e9a157719184"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_emit::stack_carry::is_stack_carry_use_safe: FunctionTooLong \u2014 baml_compiler2_emit::stack_carry::is_stack_carry_use_safe runs 152 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 52 over it, 1.52\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":"baml_language/crates/baml_compiler2_emit/src/stack_carry.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0656ad8759ebab830668e3375686e70deeae0cfd852ca688a95dc960c65cb0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OpCode.try_from: MethodTooLong \u2014 try_from runs 152 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 52 over it, 1.52\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":"baml_language/crates/bex_vm_types/src/bytecode.rs"},"region":{"startLine":1565}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ea01a99e9a814892a83849086fc85ca9941cd6b1e00402461d9fcc38cd624e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler::thir::interpret::evaluate_method_call: FunctionTooLong \u2014 baml_compiler::thir::interpret::evaluate_method_call runs 152 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 52 over it, 1.52\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":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":2797}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be5bd8a42a992dead1a28ed228b453982dfa199e5766760417188ec3041528b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: generators_openapi::builtin_schemas::builtin_schemas: FunctionTooLong \u2014 generators_openapi::builtin_schemas::builtin_schemas runs 152 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 52 over it, 1.52\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":"engine/generators/languages/openapi/src/builtin_schemas.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c252e400fc3e1453be657e728ace2d562647d3dbb5ec604f96762dfb3f437d6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ProtoWriter: ClassTooLong \u2014 606 significant lines (blank, comment-only and punctuation-only lines excluded), 44 methods. The bar is 400 significant lines; this is 206 over it, 1.52\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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoWriter.java"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"066523bc65314d4f07b53c4c07c634d8c8a0d0e37d20bbce774862959f50f25f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OpCode: ClassTooLong \u2014 606 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), 1 methods, 4 blocks, lines 1155-1885. The bar is 400 significant lines; this is 206 over it, 1.52\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":"baml_language/crates/bex_vm_types/src/bytecode.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a53d9773fb139338baab7bd63fdf91ea93d28e11fa33250e9ee577a70b68fa1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MermaidDiagramGenerator: ClassTooLong \u2014 605 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), 31 methods, 3 blocks, lines 13-935. The bar is 400 significant lines; this is 205 over it, 1.51\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":"engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7129a38e60ecb611b894559e600be08d896225ce76c89e2795250c47751c6b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Expr: ClassTooLong \u2014 604 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), 11 methods, 6 blocks, lines 15-869. The bar is 400 significant lines; this is 204 over it, 1.51\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":"engine/baml-lib/baml-types/src/expr.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a3cca8d9f5b70947db25863239f269d2834f9bf61f07d456cde37afd6e61d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bex_vm::package_baml::csv::scan_record: FunctionTooLong \u2014 bex_vm::package_baml::csv::scan_record runs 151 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 51 over it, 1.51\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":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"51153e0a661a9e4866a7178b696dae6fa590cd5b662f2822a921953ec3de47db"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OpCode.fmt: MethodTooLong \u2014 fmt runs 151 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 51 over it, 1.51\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":"baml_language/crates/bex_vm_types/src/bytecode.rs"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc572bc1311c48402406ece9a8053ab1eb52b0fab50aea94832389abbc77ae66"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: publisher/publisher.rs: FileTooLong \u2014 754 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 254 over it, 1.51\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":"engine/baml-runtime/src/tracingv2/publisher/publisher.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdd9bc564b97c6b6ceaa50bf9a26cb3a74c82e1b966fa88647da921b9a6505d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: logo-ideas/generated.tsx: FileTooLong \u2014 751 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 251 over it, 1.50\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":"typescript2/app-website/app/(home)/logo-ideas/generated.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4782b28270ff5ff63b8febdb4ee8c706b3a79bca92028a5d3b912e4ec6f8cd07"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: BexEngine: TooManyFields \u2014 45 stored fields beside 154 methods. The bar is 30 stored fields; this is 15 over it, 1.50\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8b9a40366ac7f95efbb401522bab6b59bb4ff292ac95a1718a449c29892edc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LowerCtx.lower_path: MethodTooLong \u2014 lower_path runs 150 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 50 over it, 1.50\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":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c3d9023e63acb44eee8dd0f42d72ce7f58af1b8618affd0146e65b3b5a2e9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_ide::info::type_info_for_source_definition: FunctionTooLong \u2014 baml_ide::info::type_info_for_source_definition runs 150 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 50 over it, 1.50\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":"baml_language/crates/baml_ide/src/info.rs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bb3328a7b786037d66185a8e62acbdf96a86857c9f056f591a9d3b7b5fb714"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page.EpisodePage: FunctionTooLong \u2014 EpisodePage runs 150 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\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":"typescript2/app-website/app/(home)/podcast/[slug]/page.tsx"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44a1d71c98ffe3dd3293694b2d65a6fbbc5fd32d2d91611b356cf7f99882620"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/parse_expr.rs: FileTooLong \u2014 749 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 249 over it, 1.50\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":"engine/baml-lib/ast/src/parser/parse_expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81ebc1646bd0b93bff0de136e197df49f03916d7d72ad6933280fbe59d4ae34"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IngressScheduler: ClassTooLong \u2014 597 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), 31 methods, 2 blocks, lines 566-1427. The bar is 400 significant lines; this is 197 over it, 1.49\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":"baml_language/crates/baml_lsp_server/src/lsp_ingress.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"935803cc1d28068efe3ebf45b45c9cf24f9599389696856b9b2b5b2493bccbe4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_mir::optimize::collect_place_bound_locals: FunctionTooLong \u2014 baml_compiler2_mir::optimize::collect_place_bound_locals runs 149 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 49 over it, 1.49\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":"baml_language/crates/baml_compiler2_mir/src/optimize.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ea87821de23691e29959a7868b8cbdb5f1c9c972d70e0b87f71c1bc19872e0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OpCode.encoded_size: MethodTooLong \u2014 encoded_size runs 149 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 49 over it, 1.49\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":"baml_language/crates/bex_vm_types/src/bytecode.rs"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"98788cf2b7ba0ebd8c2a30181dccfa35a7e6da81001ee6d8e954c053115e9552"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/bytecode_cache.rs: FileTooLong \u2014 744 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 76% of them inside a single declaration: CacheContext (6 blocks, 74-1427). The bar is 500 significant lines; this is 244 over it, 1.49\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":"baml_language/crates/baml_cli/src/bytecode_cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b397ce8641275be895648ae95a3c113c34cb418e6d3c202d7c3044ec271a041"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IntermediateRepr: ClassTooLong \u2014 592 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), 42 methods, 3 blocks, lines 40-1528. The bar is 400 significant lines; this is 192 over it, 1.48\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":"engine/baml-lib/baml-core/src/ir/repr.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ade68928ddb2a9e9366d406e6d0b7cc90f0941cc06edc07bdbfa559fa55741"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/generate.rs: FileTooLong \u2014 740 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 240 over it, 1.48\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":"baml_language/crates/baml_cli/src/generate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5155d4c6adfb744d37699751cabab8eabb49a973055ba45546cfc413def2842"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_go.decodeDynamicValue: FunctionTooLong \u2014 decodeDynamicValue runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/dynamic.go"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fabf560163e9d9960aadb0c24c1fcc04406c1832cb4d6bff1f87b37056c344"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_go.validateBAMLTypeAt: FunctionTooLong \u2014 validateBAMLTypeAt runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/value.go"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8c31d83b80b18e23ddeaf7158c2b64f13bab8f655b98d23f0d4c645af7e50d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Renderer.object: MethodTooLong \u2014 object runs 148 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 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_reader/src/value.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad01b1464cdcaadf817b1aae87c17aba328a79044f6f601a21b41bf7eba02d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sys_ops::output_format::walk_ty: FunctionTooLong \u2014 sys_ops::output_format::walk_ty runs 148 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 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_ops/src/output_format.rs"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c9a65272ec9e673f1b195aa334b26716de7ac424d1d986f0bd921d07dcf0bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diagnostic.rs: FileTooLong \u2014 735 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 99% of them inside a single declaration: Hir2Diagnostic (2 blocks, 26-1069). The bar is 500 significant lines; this is 235 over it, 1.47\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":"baml_language/crates/baml_compiler2_hir/src/diagnostic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02aa8a55d99173a443b91bcdeb1baddee23211b4b5970a13ae10ed2ffd91805"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassTy.coerce: MethodTooLong \u2014 coerce runs 147 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 47 over it, 1.47\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":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_class.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"042138569c99be0c9e8ad5f9aadf30917e93bbc69737d7d3129ede527e3a2909"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ProtoWriter: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoWriter.java"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4513521b4b78d4ac3266ea172cc67f0bb12c1d8dce55befdeed1bb18504e853"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CacheContext: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\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":"baml_language/crates/baml_cli/src/bytecode_cache.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9faade65a7b88e6120ea7f371fcd708d030e6d012532ef3fac9b7fdfdacd016"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Ty: TooManyMethods \u2014 44 methods, declared across 2 files: src/interned.rs (23), src/lib.rs (21). The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"baml_language/crates/baml_type/src/interned.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"579f0ae3e9d20efa924d0a5fe3736b1bb8f22276c904a43bc07e6bc9d0426106"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Applier.finish: MethodTooLong \u2014 finish runs 146 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 46 over it, 1.46\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":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":1879}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f928dba6412c04dcaabc6a15bb92594c5b64527feffebcd79ac89a07cc8d1bf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GraphBuilder.build_header: MethodTooLong \u2014 build_header runs 146 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 46 over it, 1.46\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":"engine/baml-lib/ast/src/ast/baml_vis/graph.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a477e98862096d531b3a68410400f1e8e2f9203a3f22a55eed42a87c2916cae"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeCli.run: MethodTooLong \u2014 run runs 146 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 46 over it, 1.46\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":"engine/cli/src/commands.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5321cae1051d2c1270588b8903afc316cf84beedfea436a2c78fd57cf05a63b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/leaf.rs: FileTooLong \u2014 728 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 228 over it, 1.46\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":"baml_language/sdks/typescript/sdkgen_typescript_shared/src/leaf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"075567fabb6f0c6dece4f21c41a15cf7ed863b1e3129382477f21c1054c8234c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.infer_stmt: MethodTooLong \u2014 infer_stmt runs 145 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 45 over it, 1.45\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":3458}}}],"partialFingerprints":{"codehealthFindingId/v1":"342b654925fce4c3a72f23f7fe954874768ef00fe5e117f6779c3c91f718e6ab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BamlRuntime.run_test_with_expr_events: MethodTooLong \u2014 run_test_with_expr_events runs 145 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 45 over it, 1.45\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":"engine/baml-runtime/src/lib.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"6353e1c3c0d0dee72f37bc9db61811e36e52fc4a06eb7715037a716bcb286942"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 721 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 221 over it, 1.44\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":"baml_language/crates/bex_chunkedringbuffer/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd00b8dd4a8b543e81719cfc7be3e13a334b13cbf8265032072d480afa4dd64"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OutputFormatContent.render_type_hoisted: MethodTooLong \u2014 render_type_hoisted 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":"baml_language/crates/sys_ops/src/output_format.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ee82d41873b4ec401bf999df7081b5a49241addf9792fabe9160ca4061c4f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bep-list.BepList: FunctionTooLong \u2014 BepList runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"typescript2/app-beps/src/components/bep/bep-list.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3f2f26d7d0fe1a8c2d67f793f743ba07b1fa37a5d0bbd43c054f000064ea7a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/unify.rs: FileTooLong \u2014 718 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 218 over it, 1.44\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":"baml_language/crates/baml_type/src/unify.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89fcf7055e7495d024db1919bcd02be3858e9a454959bd320707ee3dc3b5f797"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.infer_catch: MethodTooLong \u2014 infer_catch runs 143 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 43 over it, 1.43\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":11412}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f4aceb7eacb5c73213edfc34056455394f8e78cc9e35f21a813db23341c2ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_csharp::semantic::collect_functions: FunctionTooLong \u2014 sdkgen_csharp::semantic::collect_functions runs 143 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 43 over it, 1.43\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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":1682}}}],"partialFingerprints":{"codehealthFindingId/v1":"610682ad0da5e5aba84e5206a6f4da422d84eded4de0dd129959d4cb6c2e35a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page.PrivacyPolicyPage: FunctionTooLong \u2014 PrivacyPolicyPage runs 143 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\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":"typescript2/app-website/app/(home)/privacy-policy/page.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be6ec8933ba86c9cd86b675b3ba11fbbb7c1fcb8d39cc84c49967f2a5d81ff8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 713 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 213 over it, 1.43\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":"baml_language/crates/baml_compiler2_emit/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2240d27c1b7d7832d91f39fb37b42a31d6535f356b87435a9d21a09c1d10a5b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/control_flow.rs: FileTooLong \u2014 712 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 212 over it, 1.42\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":"engine/baml-runtime/src/control_flow.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffe12d95a64c30a4b2157e0b84300ff15a2329fd75f0f121737c0668c3ebadf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/expr.rs: FileTooLong \u2014 710 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 85% of them inside a single declaration: Expr (6 blocks, 15-869). The bar is 500 significant lines; this is 210 over it, 1.42\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":"engine/baml-lib/baml-types/src/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"367d3c95ea282da6a3510e33e51bc75bf42facbb6e0d0d9ea5029fa9ca4d7f80"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Expression.from_ast: MethodTooLong \u2014 from_ast runs 142 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 42 over it, 1.42\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":"engine/baml-compiler/src/hir/lowering.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0e9651ba07270a7b9896819aeeac420df427f21df8d7baef73775c7416a50b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: second-bento-animation.SecondBentoAnimation: FunctionTooLong \u2014 SecondBentoAnimation runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\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":"typescript2/app-website/components/second-bento-animation.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"308cfefe24fd183d30ee6bbd409e91402d52da45f34e6b374b0af290a63b3a7f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CacheContext: ClassTooLong \u2014 567 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), 44 methods, 6 blocks, lines 74-1427. The bar is 400 significant lines; this is 167 over it, 1.42\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":"baml_language/crates/baml_cli/src/bytecode_cache.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd932328e29b85835a3575029c42f97d32553b0e0fe0a3a114830007d2f3158"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/shape.rs: FileTooLong \u2014 705 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 205 over it, 1.41\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":"baml_language/crates/btel_snapshot/src/shape.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ea256290d0fac16e5e3d616f2ff2938c98489d10db8f2c7a0363014291ea9d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bep-table-of-contents.BepTableOfContents: FunctionTooLong \u2014 BepTableOfContents runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\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":"typescript2/app-beps/src/components/bep/bep-table-of-contents.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"576cd0dc1ee81286a2c2640279e9845a025de71e849a1dbf58d130f6b190213f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Bytecode: ClassTooLong \u2014 561 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), 11 methods, 4 blocks, lines 2461-3291. The bar is 400 significant lines; this is 161 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm_types/src/bytecode.rs"},"region":{"startLine":2461}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf41c1bf5c7f20b201cad670027d2cf28e2df681c1e8c53b94b41e7eb1359b5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IntermediateRepr: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/ir/repr.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2aff20b774e3bcd53cbcbdd604702a94d77f041ab07a34ed298a52d9f1d3e4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.lower_class_pattern: MethodTooLong \u2014 lower_class_pattern runs 140 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 40 over it, 1.40\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"252c03f3b367f7eecc924d0c7d4c77e421c7dbbf58e7eb330cd83c3397b96bae"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.lower_catch: MethodTooLong \u2014 lower_catch runs 140 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 40 over it, 1.40\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":14801}}}],"partialFingerprints":{"codehealthFindingId/v1":"0effb90b5b492661a054c82c19f736c7aa173e72c74f1c0de7838d8e60c38055"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BexEngine.telemetry_diagnostics: MethodTooLong \u2014 telemetry_diagnostics runs 140 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 40 over it, 1.40\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":"baml_language/crates/bex_engine/src/telemetry.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2591aab090f702ac17620ec2441a2459fb5eec006b8e7678ffe6624a2f98e69"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: jsonish::jsonish::parser::entry::parse_func: FunctionTooLong \u2014 jsonish::jsonish::parser::entry::parse_func runs 140 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 40 over it, 1.40\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":"engine/baml-lib/jsonish/src/jsonish/parser/entry.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"419b4a04ca387d8c15393e442f467650c791923f124f3b23cbc3ee190a5d1400"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProtoWriter.encodeInboundValue: MethodTooLong \u2014 encodeInboundValue runs 139 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoWriter.java"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f38dcd684c87399a45ddcbf0bbe75865df98520cf6eb88aa6ba9cb422ec45ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: home/improve.tsx: FileTooLong \u2014 686 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 186 over it, 1.37\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":"typescript2/app-website/components/home/improve.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefb45c414489b82a8b0a2df8e39b6ddd25e305664fa3bec6fc2c3566579db0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bex_sap::jsonish::parser::entry::parse_func: FunctionTooLong \u2014 bex_sap::jsonish::parser::entry::parse_func runs 137 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 37 over it, 1.37\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":"baml_language/crates/bex_sap/src/jsonish/parser/entry.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9022489dea511a897afca369236ac08de5d7088a8157b259c97d76a832828f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: generators_rust::ir_to_rust::stream_type_to_rust: FunctionTooLong \u2014 generators_rust::ir_to_rust::stream_type_to_rust runs 137 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 37 over it, 1.37\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":"engine/generators/languages/rust/src/ir_to_rust/mod.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"37860feee63a24e02731880c1b557ec82554ddb2d8e0ec3e3cae4dcaac544b78"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Server.new_with_connection: MethodTooLong \u2014 new_with_connection runs 137 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 37 over it, 1.37\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":"engine/language_server/src/server.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"2597e7e9c40982e31b09ca704f2e3591611963ede9f5ec364978aef14638b7e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/host_value.rs: FileTooLong \u2014 684 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 184 over it, 1.37\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":"baml_language/sdks/rust/bridge_rust/src/host_value.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7595745fe5828bf81859fac4ee73aa6ad73234b9f01e2fa06d5793b1eb82f82b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NormalTy: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/normalize.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b693b2f62ee3b5558cf12f8511dbc2ffcfda69ccbaca06d238f7220d602849c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.infer_match: MethodTooLong \u2014 infer_match runs 136 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 36 over it, 1.36\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd48acf7cc0d929bdee8b02b8569e2dab80f5e37c4ec793822c06797872516f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_mir::lower::lower_tir_template: FunctionTooLong \u2014 baml_compiler2_mir::lower::lower_tir_template runs 136 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 36 over it, 1.36\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac69c2e8a73248961d8fca098be8988f26900bc4728d040e52a5b456598f176"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PlaygroundHttp._send: MethodTooLong \u2014 _send runs 136 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 36 over it, 1.36\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":"baml_language/crates/baml_lsp_server/src/playground_http.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"a703c0a1f3252b711818628a96bb86b1741678d010f7adb00208c6701c475c68"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_types::ir_type::converters::streaming::from_type_ir: FunctionTooLong \u2014 baml_types::ir_type::converters::streaming::from_type_ir runs 136 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 36 over it, 1.36\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":"engine/baml-lib/baml-types/src/ir_type/converters/streaming.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d54d5d152d037a3ee8004405d3381a1bdcf38287defbb94b7440d1710e67f71"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: docs-shell.DocsShell: FunctionTooLong \u2014 DocsShell runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\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":"typescript2/app-developer-docs/components/docs-shell.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"24bc260d1eb26fc8746e598231bfbf10caf76961bc60565175794f6912dabf5b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PlaygroundSeam: ClassTooLong \u2014 542 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), 30 methods, 5 blocks, lines 123-1045. The bar is 400 significant lines; this is 142 over it, 1.36\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":"baml_language/crates/baml_lsp_server/src/playground_seam.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd27afccb424d90047a3f701a30a00dde14ffbd53a2bad142d8327fccb1b251d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: clients/helpers.rs: FileTooLong \u2014 677 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: PropertyHandler (2 blocks, 61-868). The bar is 500 significant lines; this is 177 over it, 1.35\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/llm-client/src/clients/helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0cedc55a130812fe631878849a201ca33c030903d4e101dc1a748ba3c8a4e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cfg.rs: FileTooLong \u2014 676 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 176 over it, 1.35\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":"baml_language/crates/baml_ide/src/cfg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85313d7a88bd79fe801737bc2e54b364786b21012f1512398e65e9a4c10a4542"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsonParseState.process_token: MethodTooLong \u2014 process_token runs 135 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 35 over it, 1.35\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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"86934541a3ed9f890b100efc4a8bb292b5923b414dc3a03c783171908fe9f295"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsonParseState.process_token: MethodTooLong \u2014 process_token runs 135 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 35 over it, 1.35\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":"engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45ae5a076ba8f29831de594e9412dfbb37a6d3fdaf20d9ba0e45368b0e23c35"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ProblemsBoard.ProblemsBoard: FunctionTooLong \u2014 ProblemsBoard runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\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":"typescript2/app-website/app/(home)/bamlcode/_components/ProblemsBoard.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3711941e93f83ef6e2db231d0117ef9eacf51dd2abfc6663c420b15a144774e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hir/lowering.rs: FileTooLong \u2014 674 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 174 over it, 1.35\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":"engine/baml-compiler/src/hir/lowering.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5370c02eb10ba902f20565298ea8d7a0a2ad02a9830c7ac462a4218b4302e78"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ir_type/mod.rs: FileTooLong \u2014 674 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 174 over it, 1.35\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":"engine/baml-lib/baml-types/src/ir_type/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecf410e5c2b88945a4c79724fd29081990c6b15eed8b9026ad1e3e6e53f5db2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AstGraphBuilder: ClassTooLong \u2014 539 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), 23 methods, 2 blocks, lines 67-818. The bar is 400 significant lines; this is 139 over it, 1.35\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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87d573d4160b3cdf99a67e93f0c1b5c65ea92dbeee9c18c345d136b29840d9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/playground_seam.rs: FileTooLong \u2014 671 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 81% of them inside a single declaration: PlaygroundSeam (5 blocks, 123-1045). The bar is 500 significant lines; this is 171 over it, 1.34\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":"baml_language/crates/baml_lsp_server/src/playground_seam.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b2215ab241ec86a03fc7cfc9a49d958934770f58ed1c6fd784c237686f9392"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IngressScheduler.admit_message_with_policy: MethodTooLong \u2014 admit_message_with_policy 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":"baml_language/crates/baml_lsp_server/src/lsp_ingress.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83705d61737892c9fd014b4930e92c8679120af1115ab588de6f79c742819cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler::thir::interpret::evaluate_binary_op: FunctionTooLong \u2014 baml_compiler::thir::interpret::evaluate_binary_op 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":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":2341}}}],"partialFingerprints":{"codehealthFindingId/v1":"4081589e51a24c479b722cdf1f21f68b7aa9c25b134aa35878037402b5a35d91"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TracePublisher.process_baml_src_upload_impl: MethodTooLong \u2014 process_baml_src_upload_impl 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":"engine/baml-runtime/src/tracingv2/publisher/publisher.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f088dfb4c1ebf5327bd0fb5d2535f6941c515540acb58f1bd96335c0cf5b7d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: TopNavbar.TopNavbar: FunctionTooLong \u2014 TopNavbar runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"typescript/apps/fiddle-web-app/app/[project_id]/_components/TopNavbar.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6015552d09bbf050da98055b26cd3831e6ac2ed0c58d62fa093665eff39b6639"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hydrate.rs: FileTooLong \u2014 669 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 169 over it, 1.34\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":"baml_language/crates/bex_engine/src/hydrate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50d0cac6d99c8752aebc0d62c94246963c74832748fae4584329df1170b3714"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/token.rs: FileTooLong \u2014 668 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 168 over it, 1.34\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":"baml_language/crates/baml_syntax/src/token.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5c2e2060450daf07093bff274c3eb809ffe8b86959b3152e0f1d65874325cc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Reader: ClassTooLong \u2014 534 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), 31 methods, 2 blocks, lines 518-1412. The bar is 400 significant lines; this is 134 over it, 1.34\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":"baml_language/crates/btel_snapshot/src/decode.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6e79b13242afee62d87400f003899cd9505c12913098ad9f870a1e3214d49a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/convert.rs: FileTooLong \u2014 667 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 51 free functions. The bar is 500 significant lines; this is 167 over it, 1.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type_macros/src/convert.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab77abe013ddcf92920fc41796d33882f1ae647120a85d9d15d1c9bddc247753"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: BexVm: TooManyFields \u2014 40 stored fields beside 451 methods. The bar is 30 stored fields; this is 10 over it, 1.33\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":1557}}}],"partialFingerprints":{"codehealthFindingId/v1":"879ac425171843fed59897672a44e2d5b8c4be46906d625bf5dd99e8026d3a9e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypeGeneric: TooManyMethods \u2014 40 methods, declared across 4 files: ir_type/builder.rs (22), ir_type/mod.rs (14), ir_type/union_type.rs (3), simplify/ir.rs (1). The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"engine/baml-lib/baml-types/src/ir_type/mod.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"168f18c9c1662bfbea31bd65576efd8caaf399fd0f75f604ef27d4f85e63e2bb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ParserDatabase: TooManyMethods \u2014 40 methods, declared across 2 files: walkers/mod.rs (30), src/lib.rs (10). The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"engine/baml-lib/parser-database/src/lib.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fa4ac7e3d61a4b5689a38fdac788cef2a7f36dca60c171713b910d232bd840"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PropertyHandler: ClassTooLong \u2014 532 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), 29 methods, 2 blocks, lines 61-868. The bar is 400 significant lines; this is 132 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/llm-client/src/clients/helpers.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a086b83b4788e982a8c8319da6e777f8d3bb28ac4d8dd92d49e8e9fb185e925"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/emit.rs: FileTooLong \u2014 665 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 36 free functions. The bar is 500 significant lines; this is 165 over it, 1.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type_macros/src/emit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5cb2ec8a65551b89ff992f3d3e4a5245e018f656e1e31b6b77541228545cde"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StackifyCodegen.emit_statement: MethodTooLong \u2014 emit_statement runs 133 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 33 over it, 1.33\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":"baml_language/crates/baml_compiler2_emit/src/emit.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed08254c41d5ca1380a24085f1a6b934cb93d892a3098bea0a68f8a2ebd47340"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_hir_ty::lower::interface_lowering_diagnostics: FunctionTooLong \u2014 baml_compiler2_hir_ty::lower::interface_lowering_diagnostics runs 133 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 33 over it, 1.33\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":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":2901}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83a39c3b79d30a49d6f31ed46029b84355fc44ec65d640a04366450c1fb7040"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_ide::info::target_type_info: FunctionTooLong \u2014 baml_ide::info::target_type_info runs 133 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 33 over it, 1.33\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":"baml_language/crates/baml_ide/src/info.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0421c85fc0792fa797fa638fe7dbd68436440c8227ad7fcb940a514933937a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OutputFormatContent.render_impl: MethodTooLong \u2014 render_impl runs 133 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 33 over it, 1.33\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":"baml_language/crates/sys_ops/src/output_format.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6783936d1e2f31072ddbf1b05c3922199cb0ee9c58adde173dbc6ed6b8b1bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: reader.BcsReader: FunctionTooLong \u2014 BcsReader runs 133 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\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":"typescript2/app-beps/src/app/bcs/[number]/reader.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"396a862b49dc854f344c9fe3a0fef9cef1da3b94a4ab4ed78361af24dfee61a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: MonacoEditor.EditorSkeleton: FunctionTooLong \u2014 EditorSkeleton runs 133 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\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":"typescript2/pkg-editor/src/MonacoEditor.tsx"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d6fcee148f0a346bb0d56dabf5b3b76c5a585a255f5362ac46d7740911be41"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/web_sysops.rs: FileTooLong \u2014 660 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 160 over it, 1.32\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":"baml_language/crates/sys_wasm/src/web_sysops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d61cb654d5391bfd1098256ce0e0635184413538b9d06c77dcec9d137a28f7d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BexEngine.shutdown_with_deadline: MethodTooLong \u2014 shutdown_with_deadline runs 132 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 32 over it, 1.32\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":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":2843}}}],"partialFingerprints":{"codehealthFindingId/v1":"88837d1da6fd892bcb6ec8243a5b86017ec59098bd0fe225054010490762754e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_typescript_shared::translate_ty::translate_ty: FunctionTooLong \u2014 sdkgen_typescript_shared::translate_ty::translate_ty runs 132 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 32 over it, 1.32\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":"baml_language/sdks/typescript/sdkgen_typescript_shared/src/translate_ty.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"5062e1dbc620a3d02d5ac4e45e24329c0743f6c49d011e8c15bef8d0cf1c2a57"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: boundary_udf::yaml2jinja::rebuild_from_flattened: FunctionTooLong \u2014 boundary_udf::yaml2jinja::rebuild_from_flattened runs 132 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 32 over it, 1.32\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":"engine/boundary-udf/src/yaml2jinja.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31a05c65fcada2e384c4394ce6eed8414149edf28d1231e92951ff784ebcde8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: docs-page-actions.DocsPageActions: FunctionTooLong \u2014 DocsPageActions runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\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":"typescript2/app-developer-docs/components/docs-page-actions.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6491c06c2416066d80ae4bd926a7b2eb97805bacc392b11154213f8a4d4f4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/extract.rs: FileTooLong \u2014 658 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 158 over it, 1.32\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":"baml_language/crates/baml_builtins2_codegen/src/extract.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"887359852e51e5624f70c3814be0c4b83c764886a8082383917f37493e405a86"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dispatch/requests.rs: FileTooLong \u2014 658 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 158 over it, 1.32\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":"baml_language/crates/baml_lsp/src/dispatch/requests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa0225b7683bd071527d3d6d729f6fe20ffe0bc554b3b4c64df82c094a8a28f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/db.rs: FileTooLong \u2014 655 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 74% of them inside a single declaration: ProjectDatabase (6 blocks, 130-1330). The bar is 500 significant lines; this is 155 over it, 1.31\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_db/src/db.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"258912a8b4e40f7457345cebb23e248a3ad4c4b4e8c232de77b9e3613274980c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_python_pydantic2::leaf::render_leaf_body: FunctionTooLong \u2014 sdkgen_python_pydantic2::leaf::render_leaf_body runs 131 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 31 over it, 1.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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":1737}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39a0cec09896fa42de38231ea59d7ce508a9849b7a72425034b8bf18a6f2a30"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Expression.to_doc: MethodTooLong \u2014 to_doc runs 131 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 31 over it, 1.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":"engine/baml-compiler/src/hir/dump.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7e5955b066f9a193c79d5c953a24599c9900f5cf98daa7a3616f390c57815f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeContext.infer_type: MethodTooLong \u2014 infer_type runs 131 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 31 over it, 1.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":"engine/baml-compiler/src/thir/typecheck.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb36e32839bcecad1a412688fc711360e275abc1e03c13f5b5bc9bf84f45fac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/http_server.rs: FileTooLong \u2014 652 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 152 over it, 1.30\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":"baml_language/crates/sys_native/src/http_server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b073632a2e83d8aa353d72f1a8141683300fa69a899d77f7071a18b07fe19330"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypeRegistry: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/TypeRegistry.java"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"452fb124548392094c9242b61f71b5fa6ce6c27a0b2ada6fedd7a5cd292d7584"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BamlRuntime: TooManyMethods \u2014 39 methods, declared across 4 files: src/lib.rs (36), runtime_methods/call_function.rs (1), runtime_methods/prepare_function.rs (1), runtime_methods/stream_function.rs (1). The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"engine/baml-runtime/src/lib.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b89d8fdc87c328aab3cbc7040b7fb90a39441c16058f7b354513bb706fecac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_emit::package::type_pass: FunctionTooLong \u2014 baml_compiler2_emit::package::type_pass runs 130 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 30 over it, 1.30\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":"baml_language/crates/baml_compiler2_emit/src/package/mod.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e69bf365521c3d2fa72a9d993ce5f866ce0e8ee1f580c185874399ba06a62d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.infer_binary: MethodTooLong \u2014 infer_binary runs 130 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 30 over it, 1.30\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":5251}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b783cbccbf3c52d621e5eda4c7df5118b28f8636ef9d6730d2ab12c6b09ab9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: FileViewer.FileViewer: FunctionTooLong \u2014 FileViewer runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\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":"typescript/apps/fiddle-web-app/app/[project_id]/_components/Tree/FileViewer.tsx"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a96656804d305aee35f7133d6720fb8055ebb9fa78a6a9f109b1c863a9f56a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bep-status-select.BepStatusSelect: FunctionTooLong \u2014 BepStatusSelect runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\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":"typescript2/app-beps/src/components/bep/bep-status-select.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"cececf5f555a8164d9c8ee7b003747e953e94fe348c870dfa36b7abc910282a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: intro.WhatIsSAP: FunctionTooLong \u2014 WhatIsSAP runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\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":"typescript2/app-website/lib/mdx/sap/intro.tsx"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc0b62e82e42cfa52385d2090455088e1ae8736edee9738bc869c05afb131e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: openai/openai_client.rs: FileTooLong \u2014 648 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 148 over it, 1.30\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":"engine/baml-runtime/src/internal/llm_client/primitive/openai/openai_client.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d041a261aa20b4175216b5a79a006f1475ec9e78989aa9e2b506ef0fb08f21"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/trace_value_encode.rs: FileTooLong \u2014 646 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 146 over it, 1.29\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":"baml_language/crates/bex_engine/src/trace_value_encode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8392ea5b3db79613e12f5632bab83deaae6ac7aa3419ace05efdf0a13c3b600"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compiled_rt/record.rs: FileTooLong \u2014 646 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 75% of them inside a single declaration: BexVm (254-953). The bar is 500 significant lines; this is 146 over it, 1.29\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":"baml_language/crates/bex_vm/src/vm/compiled_rt/record.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f15b63608491ca7d8385ca3d703db526f6fc5fd2fb64c1d11aac3b5fe555b7e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Program: ClassTooLong \u2014 516 significant lines (blank, comment-only and punctuation-only lines excluded), 20 methods. The bar is 400 significant lines; this is 116 over it, 1.29\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.NuGetNormalizer/Program.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5c7e7fa265a184435d02feeebd06031c81f27d2dd1580ca487c5e0c8d5867b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_cli::generate::discover_generators: FunctionTooLong \u2014 baml_cli::generate::discover_generators runs 129 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 29 over it, 1.29\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":"baml_language/crates/baml_cli/src/generate.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8c100478cb58ee8e5b957d8f2711cbff94261b2dccaac1d7b14cbdbb4900b7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HashDriver.drive: MethodTooLong \u2014 drive runs 129 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 29 over it, 1.29\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":"baml_language/crates/bex_vm/src/package_baml/hashing.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49c903175059777fe56546fd792d4ec842aa2fa07d54182a66b737cdcad3b01"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: jsonish::helpers::relevant_data_models: FunctionTooLong \u2014 jsonish::helpers::relevant_data_models runs 129 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 29 over it, 1.29\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":"engine/baml-lib/jsonish/src/helpers/mod.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bf822a88627a1e7d1fe7b6456a63fc29bbe8548f997afe13d5d727d789c1c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: package_baml/root.rs: FileTooLong \u2014 643 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 143 over it, 1.29\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":"baml_language/crates/bex_vm/src/package_baml/root.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c620dd813af9d032d88bcbdf83c4435fa7463d81ba14375d2cd08f99f0129cc1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/extern_loc.rs: FileTooLong \u2014 640 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 45 free functions. The bar is 500 significant lines; this is 140 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/extern_loc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51577455d634afb1bc9dd02d5c5ee41a7383b28ade8b11b3b49a822107cf28c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_db::check::check_interfaces: FunctionTooLong \u2014 baml_db::check::check_interfaces runs 128 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 28 over it, 1.28\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":"baml_language/crates/baml_db/src/check.rs"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c496775cc15461f2304aa25eb7ab5a497c4fe46117248175ecb4bad99133507"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Applier.function: MethodTooLong \u2014 function runs 128 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 28 over it, 1.28\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":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae222d651b31a8db094f70785b89f26b197f0d3395a58d1f06c60655af37f6dc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TraceSnapshotBuilder.copy_object: MethodTooLong \u2014 copy_object runs 128 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 28 over it, 1.28\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":"baml_language/crates/bex_engine/src/trace_heap.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b133fb58bb1bb78783d13ed049792de0f846dd654b99542340223bfb1135b00"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OutputFormat.call: MethodTooLong \u2014 call runs 128 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 28 over it, 1.28\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":"engine/baml-lib/jinja-runtime/src/output_format/mod.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31e6d91106a5e0ee045b611b7290e56200b84d05d20f2a11364f3341b0ded57"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: generators_go::ir_to_go::stream_type_to_go: FunctionTooLong \u2014 generators_go::ir_to_go::stream_type_to_go runs 128 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 28 over it, 1.28\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":"engine/generators/languages/go/src/ir_to_go/mod.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"586ec2b76d75719ea1508bc575d600ecb83b3cf656a789d8460c2ccfefdcb8ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pledge-form.PledgeForm: FunctionTooLong \u2014 PledgeForm runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\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":"typescript2/app-website/app/(home)/fight-slop-with-slop/_components/pledge-form.tsx"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"22651541ec9161d57195b3e95ce4ffbea2275098d23fb0960fdb104c7a3316fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: evaluate_type/expr.rs: FileTooLong \u2014 638 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 138 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jinja/src/evaluate_type/expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df3ae4b7a01cfbc89d99018a3e52938f367b97a8162c8128e61a538501ed4c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_builtins2_codegen::extract::extract_from_class: FunctionTooLong \u2014 baml_builtins2_codegen::extract::extract_from_class runs 127 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 27 over it, 1.27\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":"baml_language/crates/baml_builtins2_codegen/src/extract.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"4105c2798003dda1dd3cc2f2f78130208a7b751508e84baf179b4637b8b60ea6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.lower_array_pattern: MethodTooLong \u2014 lower_array_pattern runs 127 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 27 over it, 1.27\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc04f43dc2a2441fe04606338dcaa74fb37b15e5c2a95274dd614ceedc3ad91"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: internal_baml_ast::parser::parse_expr::parse_statement_inner_rule: FunctionTooLong \u2014 internal_baml_ast::parser::parse_expr::parse_statement_inner_rule runs 127 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 27 over it, 1.27\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":"engine/baml-lib/ast/src/parser/parse_expr.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a03b2290ea226f939e76065e5ccbf5355ccac4dda4815d1df1ae5406e6f58e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: board.BcsBoard: FunctionTooLong \u2014 BcsBoard runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\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":"typescript2/app-beps/src/app/bcs/board.tsx"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"09632848d1f3caaf7e2c92d6d2f1baf4e46b81b6062cfe59e59b4ed0b2e783d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/export-utils.ts: FileTooLong \u2014 634 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 134 over it, 1.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/export-utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9a8f87ddac35fa6d62a53b56382645c3d98b81b734a2e4d6ef812ad85f4799"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ProjectDatabase: TooManyMethods \u2014 38 methods, declared across 2 files: src/db.rs (36), src/check.rs (2). The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"baml_language/crates/baml_db/src/db.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7771d257a7533d2ad5b5d3d52814a7477a841a2888ef48ea7e5f6af130dbbb5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pretty.rs: FileTooLong \u2014 631 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 131 over it, 1.26\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":"baml_language/crates/baml_compiler2_mir/src/pretty.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a5981a44aebd90c7962b87c6cabe0ae873624bea6434031c5150d2a3c713d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/thir.rs: FileTooLong \u2014 631 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 131 over it, 1.26\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":"engine/baml-compiler/src/thir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb2c1820a4d1b6a9f02338a7420ea7cc8bebc69b571d5855289a7b6a05842aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bex_engine::host_instrumentation::capture_callback_inputs: FunctionTooLong \u2014 bex_engine::host_instrumentation::capture_callback_inputs runs 126 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 26 over it, 1.26\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":"baml_language/crates/bex_engine/src/host_instrumentation.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"1088dfc0fe659e1d97e9a6265253576840dd2f6cff60674f8df09605ccb981d7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TyResolvedRef.coerce: MethodTooLong \u2014 coerce runs 126 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 26 over it, 1.26\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":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_ty.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fd22b60196cdba385016c4227f69e8cc07be363192e026bbefece4293bd120"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bridge_ctypes::value_encode::external_to_outbound: FunctionTooLong \u2014 bridge_ctypes::value_encode::external_to_outbound runs 126 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 26 over it, 1.26\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":"baml_language/crates/bridge_ctypes/src/value_encode.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a65c977a66f9e0c911f933691633c234444e4b56e90674cad9d3a92afbb76bd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WasmHttp.do_send: MethodTooLong \u2014 do_send runs 126 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 26 over it, 1.26\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":"baml_language/crates/bridge_wasm/src/wasm_http.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9085428619e6109ec7dea067b8fa13a37ae0ae239eca7d614f5b4930d8c351d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OutputFormatContent.render: MethodTooLong \u2014 render runs 126 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 26 over it, 1.26\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":"engine/baml-lib/jinja-runtime/src/output_format/types.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f149ad6419b6a81987488a3249d0aef9eebce0a9bca4989faf1e7d2338caff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsonParseState.should_close_unescaped_string: MethodTooLong \u2014 should_close_unescaped_string runs 126 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 26 over it, 1.26\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":"engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"8633d3ce7144884be3cf8b530a29d927c844177ffa17796b67d7cf47b44427fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Node.Node: FunctionTooLong \u2014 Node runs 126 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\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":"typescript/apps/fiddle-web-app/app/[project_id]/_components/Tree/Node.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b9028078f309d41b588c2b6323c4a44d31370f2fdda71f19df4c074d666b99"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page.WhoAreWePage: FunctionTooLong \u2014 WhoAreWePage runs 126 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\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":"typescript2/app-website/app/(home)/who-are-we/page.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27195f971093e7c85582bb94ed32b53a7d851d133ae55b3e8d1c7c26af05571"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 629 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 129 over it, 1.26\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":"baml_language/crates/baml_type/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"704e84eef2759f40f633b83f7f4787900f0d2ac08e61360cf2bdd0e259322010"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: JsonParseState: ClassTooLong \u2014 503 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), 10 methods, 2 blocks, lines 26-899. The bar is 400 significant lines; this is 103 over it, 1.26\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f3afe9fdb987663b65d89456a7cdddb54523527c6cec790f93fad6692d2e45"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_go.decodeReflected: FunctionTooLong \u2014 decodeReflected runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"baml_language/sdks/go/baml_go/dynamic.go"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f7410d9b3004ff71f76ec83cae2d237f859f6f76c03a0247718675d73a28f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_emit::analysis::collect_uses_in_terminator: FunctionTooLong \u2014 baml_compiler2_emit::analysis::collect_uses_in_terminator 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":"baml_language/crates/baml_compiler2_emit/src/analysis.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"6176becf952753605026c177e747a6ecb4e13ad27325f7f88ee86bcfe3d729bc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.infer_source_object: MethodTooLong \u2014 infer_source_object 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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":9612}}}],"partialFingerprints":{"codehealthFindingId/v1":"706a48fc5d399b7b11f0c17ed8f95de65a98fda889d09bfb8c7dcfab59beddd3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JsonParseState.should_close_unescaped_string: MethodTooLong \u2014 should_close_unescaped_string 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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9039502051d8a92fb9c137d5c8c1954d8437aab53e064ce731efb88946dedf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bridge_cffi::baml_to_host::decode_invocation_request: FunctionTooLong \u2014 bridge_cffi::baml_to_host::decode_invocation_request 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":"baml_language/crates/bridge_cffi/src/baml_to_host.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26305b0ee627daacee16de774ea5f532cd3556cd495021eb39fa2bbf3ff93ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_runtime::internal::llm_client::primitive::request::execute_request: FunctionTooLong \u2014 baml_runtime::internal::llm_client::primitive::request::execute_request 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":"engine/baml-runtime/src/internal/llm_client/primitive/request.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95cbe541e520e480ca1f87c192677d22b5abeeb7e6e0bba35e94a6962c7aa5d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/interned.rs: FileTooLong \u2014 623 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 123 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":"baml_language/crates/baml_type/src/interned.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d778f03faf523f1ef90468fa06d1ed56be05e418d67ae94995bb5f4527de998"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: baml_go/lib_common.go: FileTooLong \u2014 622 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 122 over it, 1.24\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":"engine/language_client_go/baml_go/lib_common.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5806c3d0c5f3eb177184890e28e054445ad094c9a9706e9cc5e67074d5604873"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bex_engine::conversion::find_matching_union_member: FunctionTooLong \u2014 bex_engine::conversion::find_matching_union_member runs 124 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 24 over it, 1.24\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":"baml_language/crates/bex_engine/src/conversion.rs"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e6dc2c64b6c7ccbdd7ab5d2846cd2d4b06fcd510cd00b4161f6e55f3551b50"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MermaidDiagramGenerator.visit_expression: MethodTooLong \u2014 visit_expression runs 124 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 24 over it, 1.24\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":"engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e31969f3bfb69d1cb9e3aa7fc14ec02afa78396389b6c110f4850229ebf0b41"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BamlValue: TooManyMethods \u2014 553 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Values/BamlValue.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4118c6368faf718343b94e3c136a8d2e9e5abbb763d0156e4d2bbaf04b7fcb9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InferenceTable: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer/unify.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd17de2cacb0917919f9324285279b95dfec7909a1009b56756264519b4dccff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunArgs.run_expression: MethodTooLong \u2014 run_expression runs 123 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 23 over it, 1.23\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":"baml_language/crates/baml_cli/src/run_command.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"3016bfaf2c6d3ded00483d5a8be70dccbb386f9df30e59f3de761bee4172c123"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_ide::export::export_item: FunctionTooLong \u2014 baml_ide::export::export_item runs 123 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 23 over it, 1.23\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":"baml_language/crates/baml_ide/src/export.rs"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9201a85634856231dd009afcea1dca6029f3e5f3b47c1b7856912d4c6c8abc6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bex_heap::accessor::convert_object: FunctionTooLong \u2014 bex_heap::accessor::convert_object runs 123 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 23 over it, 1.23\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":"baml_language/crates/bex_heap/src/accessor.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1a343d4f9dd43cfc987076afc32eeb47fb98f0717b40822dbcc9f998e68d09"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: internal_baml_core::validate::generator_loader::v2::parse_generator: FunctionTooLong \u2014 internal_baml_core::validate::generator_loader::v2::parse_generator runs 123 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 23 over it, 1.23\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":"engine/baml-lib/baml-core/src/validate/generator_loader/v2.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"78359096362ddda5ef496854b668d6214e8e56987c866385bd2f018292dfb04f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: jsonish::deserializer::semantic_streaming::process_node: FunctionTooLong \u2014 jsonish::deserializer::semantic_streaming::process_node runs 123 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 23 over it, 1.23\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":"engine/baml-lib/jsonish/src/deserializer/semantic_streaming.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"793fe30f650d6d4832a25b911e6a45af141bbf4d7ca7e2213093e89f3108054c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: language_server::server::api::diagnostics::project_diagnostics: FunctionTooLong \u2014 language_server::server::api::diagnostics::project_diagnostics runs 123 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 23 over it, 1.23\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":"engine/language_server/src/server/api/diagnostics.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2262bed2b0704e9ef48712d01c9b195ec15997c2bc811a19d29a38f7dd6cd4b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sap_model/convert.rs: FileTooLong \u2014 614 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 74% of them inside a single declaration: TypeCtx (3 blocks, 271-987). The bar is 500 significant lines; this is 114 over it, 1.23\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/sap_model/convert.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a478c50fd65e7e80600175c9f636fc053cc5e0f59904dd772bd5bdff591aa2ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: internal/ProtoWriter.java: FileTooLong \u2014 613 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: ProtoWriter (49-1154). The bar is 500 significant lines; this is 113 over it, 1.23\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoWriter.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec10bcff3229960173cf71679195207a31a3cdfc0e524ce0ed9dd0893d79146e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/publisher.rs: FileTooLong \u2014 613 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 78% of them inside a single declaration: CloudPublisher (3 blocks, 86-906). The bar is 500 significant lines; this is 113 over it, 1.23\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_bcs/src/publisher.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7308e83f59459c4c598d13b686613093f616f93097f599c6f65fd88cb32afa29"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: baml_vis/mermaid_debug.rs: FileTooLong \u2014 613 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 99% of them inside a single declaration: MermaidDiagramGenerator (3 blocks, 13-935). The bar is 500 significant lines; this is 113 over it, 1.23\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a6a2e63260ee990af2f5281000c9abcf1332b728b66483a364dcb979667071"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: output_format/types.rs: FileTooLong \u2014 611 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 111 over it, 1.22\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":"engine/baml-lib/jinja-runtime/src/output_format/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b498090caddb42b68d4e15902a47eb4562327d97b6bc991dfc338b1f031e590"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.lower_pattern_inner: MethodTooLong \u2014 lower_pattern_inner runs 122 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 22 over it, 1.22\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"b009607b95286755d9d132e89328d16df8401ed48084d0f18df37760d8a71fb7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EqualsDriver.compare_objects: MethodTooLong \u2014 compare_objects runs 122 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 22 over it, 1.22\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":"baml_language/crates/bex_vm/src/package_baml/ops.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b301bf596944774e0ac42325d7a35bd35d7471eab36b403982a98f84877fef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: btel_snapshot::host::add: FunctionTooLong \u2014 btel_snapshot::host::add runs 122 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 22 over it, 1.22\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":"baml_language/crates/btel_snapshot/src/host.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c748fc4a1217f0301e06da9bdfdcf19894596e8d6ce5aca8efb19c9124a1fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: internal_baml_jinja_types::evaluate_type::expr::handle_enum_binary_operation: FunctionTooLong \u2014 internal_baml_jinja_types::evaluate_type::expr::handle_enum_binary_operation runs 122 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 22 over it, 1.22\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":"engine/baml-lib/jinja/src/evaluate_type/expr.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8d1d0e0565655f716cd7f37de91534daae2465101570417fcb52d36674fcd3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: emit-sublime.emitSublimeSyntax: FunctionTooLong \u2014 emitSublimeSyntax runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\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":"typescript2/pkg-grammar/scripts/emit-sublime.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"150f4ffacc59461fdaf301826c22ee92f166d146a2254b06acd062d0d7df9e83"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: BamlBridge/Encode.swift: FileTooLong \u2014 608 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 108 over it, 1.22\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":"baml_language/sdks/swift/Sources/BamlBridge/Encode.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e13618cd30a5679afa4474d9149adc712eb76210f04570cf9803d719fe8fcd7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/analysis.rs: FileTooLong \u2014 607 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 107 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_rust/src/analysis.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc98691ec3141a46053aa1de74d5f14891286a12ada8a95b8388bac74f396e9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ProjectDatabase: ClassTooLong \u2014 485 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), 38 methods, 6 blocks, lines 130-1330. The bar is 400 significant lines; this is 85 over it, 1.21\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":"baml_language/crates/baml_db/src/db.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59d4347ab8d0254d292f7ae1003812effd84ffc58bd9f5d57daa5a7755d3978"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/expression.rs: FileTooLong \u2014 605 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 71% of them inside a single declaration: Expression (3 blocks, 90-767). The bar is 500 significant lines; this is 105 over it, 1.21\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94133baf5d21b7808b17059c467b1b81005481008d6dd58e2c9693843a572fa6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_builtins2_codegen::codegen_io::emit_free_fn_glue: FunctionTooLong \u2014 baml_builtins2_codegen::codegen_io::emit_free_fn_glue runs 121 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 21 over it, 1.21\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":"baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"b992fa168bbc17188615c03f14825bc27586f44868ca43b618b4477ea44d8903"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Items.llm_function: MethodTooLong \u2014 llm_function runs 121 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 21 over it, 1.21\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":"baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c8584950b62212c7bb5b4ff6dc2c37b97ad84edbb979154ea7e3879c12bdb5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_csharp::semantic::render_functions: FunctionTooLong \u2014 sdkgen_csharp::semantic::render_functions runs 121 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 21 over it, 1.21\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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":2467}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbea63eda2d4b098dbc74ca7071162f02cdb8ab72f6eb4706ad91ff645d69c98"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AwsClient.chat: MethodTooLong \u2014 chat runs 121 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 21 over it, 1.21\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":"engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c89176f62a8efad90e3e42767a3265e0e58dc12cfd0e2677933d7cfb168f56"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/app.tsx: FileTooLong \u2014 604 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 104 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-type-quiz/src/app.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6917d47c8a563e2e70a46ea9d65f933535b434383717626a9e77a6d40e216863"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: JsonParseState: ClassTooLong \u2014 483 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-857. The bar is 400 significant lines; this is 83 over it, 1.21\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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9878c6b601dd48a9fbde09d0b683c9bf40a364b615bbf5a9c9786214bce2d43"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ir.rs: FileTooLong \u2014 602 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 102 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/ir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"675303dfe6cb33647e1f2c8f58be0b4dde28f91e53d0c0c252c6e5a223f1a02d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: StackifyCodegen: TooManyFields \u2014 36 stored fields beside 80 methods. The bar is 30 stored fields; this is 6 over it, 1.20\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/emit.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"6504c5fe958ac5b1d6556de42557144045e4ed6bffe986d831baf9299decf65a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Walker: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/ir/repr.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe609ddd769902ad2e30ea5cc1a46eacc62f55b8fc30d3718779aadcc7ea552"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: baml_vm::native: TooManyFunctions \u2014 36 free functions. The bar is 30 free functions; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-vm/src/native.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cbceb13dd37e8962534c5b7ebbe1c553523a22cbd92ebcebf162302b1594d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_python_pydantic2::to_source_code_internal: FunctionTooLong \u2014 sdkgen_python_pydantic2::to_source_code_internal runs 120 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 20 over it, 1.20\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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/lib.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"3479961068b6d54cc4cc8eacd18128acbd52179cd3afd95385bdd4a80b37a6e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: internal_baml_ast::parser::parse_value_expression_block::parse_value_expression_block: FunctionTooLong \u2014 internal_baml_ast::parser::parse_value_expression_block::parse_value_expression_block runs 120 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 20 over it, 1.20\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":"engine/baml-lib/ast/src/parser/parse_value_expression_block.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a8a6ce854b243acce1454ea46a58b9d1280b2e84698bff661f81a1347a735b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: baml_go/dynamic.go: FileTooLong \u2014 597 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 97 over it, 1.19\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":"baml_language/sdks/go/baml_go/dynamic.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23562401b8472e495484568baf4a151c62d2fc9f4fdfd9780f531023514a7a74"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lsp_runtime.rs: FileTooLong \u2014 597 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 76% of them inside a single declaration: LspRuntime (2 blocks, 159-862). The bar is 500 significant lines; this is 97 over it, 1.19\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":"baml_language/crates/baml_lsp_server/src/lsp_runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a1127e90b479f262b212da94c1cf24a8ba46a995a31e774f306a46a62b9ed1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CloudPublisher: ClassTooLong \u2014 476 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), 24 methods, 3 blocks, lines 86-906. The bar is 400 significant lines; this is 76 over it, 1.19\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":"baml_language/crates/btel_bcs/src/publisher.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d7f1518d2fe5cea8c0165de3a436cfd273f98c7f6cea7948a453493abbf8fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_builtins2_codegen::codegen_io::emit_glue_method: FunctionTooLong \u2014 baml_builtins2_codegen::codegen_io::emit_glue_method runs 119 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 19 over it, 1.19\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":"baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d342cb2c028f60f433f165804e1caafeeeabbd39761a54bd1747f1593f19b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_hir_ty::method_resolution::lookup_impl_member: FunctionTooLong \u2014 baml_compiler2_hir_ty::method_resolution::lookup_impl_member runs 119 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 19 over it, 1.19\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":"baml_language/crates/baml_compiler2_hir_ty/src/method_resolution.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"35752577a9c88ed01f62b94ec23f53c9449505551338e596d0aada40752f6e29"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NormalTy.from_interned: MethodTooLong \u2014 from_interned runs 119 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 19 over it, 1.19\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":"baml_language/crates/baml_type/src/normalize.rs"},"region":{"startLine":3057}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0a1ac32b588acbf75960463815dcd76a8f123c85a72a95a7659455d545bcd6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_go::render_reflect_facade: FunctionTooLong \u2014 sdkgen_go::render_reflect_facade runs 119 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 19 over it, 1.19\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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6526f139ba8f68768875660d320ee68e1cb4455b2d5e8eba056dbf6cee74bf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GoTypeProjection.project_inner: MethodTooLong \u2014 project_inner runs 119 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 19 over it, 1.19\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":"baml_language/sdks/go/sdkgen_go/src/types.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"3859e2718d97e986aa6ebd397a0a679c42f0fc4d56250cd367f0e8f5043922c4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UnresolvedAwsBedrock.resolve: MethodTooLong \u2014 resolve runs 119 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 19 over it, 1.19\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":"engine/baml-lib/llm-client/src/clients/aws_bedrock.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccde1e4fc57e0a2c783e3fa200bd6cd13a87b029ec5eff5055b3b7999023ab7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: app.renderDashboard: FunctionTooLong \u2014 renderDashboard runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\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":"typescript2/app-product-metrics/src/app.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92f4133da81bb348cbdcb7538e177dc672e15271eba02cd095a47b310937ce3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_hir_ty::infer::infer_body_impl: FunctionTooLong \u2014 baml_compiler2_hir_ty::infer::infer_body_impl runs 118 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 18 over it, 1.18\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":1774}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a9c258d1b55d06dfcfd5236ffb7b603b25d3c571975451dfb16be2005c7a76"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bep-version-history.BepVersionHistory: FunctionTooLong \u2014 BepVersionHistory runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\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":"typescript2/app-beps/src/components/bep/bep-version-history.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f324c9a96483c771a0578ec73f28df2f7592bf95ea0ac623b621799200734b34"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DatamodelError: ClassTooLong \u2014 471 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), 59 methods, 2 blocks, lines 11-731. The bar is 400 significant lines; this is 71 over it, 1.18\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":"engine/baml-lib/diagnostics/src/error.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8388d34ae414dc00ba4eb24571389d0f236cf9e4202bc4e5c8e0fd13adbd1e93"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _lib/baml-monarch.ts: FileTooLong \u2014 587 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: registerBaml (14-779). The bar is 500 significant lines; this is 87 over it, 1.17\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_lib/baml-monarch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd22cf70d30925f3b100336a9139b6ec4ec5f926f152b24041e5b8730edb57a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: type_builder/objects.rs: FileTooLong \u2014 585 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 85 over it, 1.17\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":"engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6652e7f7d38e84613c2c33c1c54960df887a5ae6de580cefd5f7986f3d33682"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_builtins2_codegen::extract::extract_from_implements_for: FunctionTooLong \u2014 baml_builtins2_codegen::extract::extract_from_implements_for runs 117 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 17 over it, 1.17\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":"baml_language/crates/baml_builtins2_codegen/src/extract.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b014651735629604261bd69be17ecd3a4697d2d14b2e14fd8dd946d188e8a76"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bex_vm::package_reflect::runtime_class_builder::build_group: FunctionTooLong \u2014 bex_vm::package_reflect::runtime_class_builder::build_group runs 117 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 17 over it, 1.17\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":"baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"aefcdfacb2983cf323c8b9a84e17e540d467b38b09532e1ffee04f7acd9ce787"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_java::emit::render_class: FunctionTooLong \u2014 sdkgen_java::emit::render_class runs 117 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 17 over it, 1.17\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":"baml_language/sdks/java/sdkgen_java/src/emit.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"791aa9c14778a1b07f6a43cc87450ebd8f576696d192b7b3e4547fe140a2b6c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_runtime::internal::llm_client::traits::process_media: FunctionTooLong \u2014 baml_runtime::internal::llm_client::traits::process_media runs 117 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 17 over it, 1.17\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":"engine/baml-runtime/src/internal/llm_client/traits/mod.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03322388b778b449c76f4d7496b6069ca35a26529afeddb683cdf0e3c3f5e61"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: baml_go/value.go: FileTooLong \u2014 584 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 84 over it, 1.17\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":"baml_language/sdks/go/baml_go/value.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be533f5cd0d2e77e1785f0b02eb96a67f667736be505359516318928a6321a0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 584 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 44 free functions. The bar is 500 significant lines; this is 84 over it, 1.17\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":"baml_language/sdks/java/bridge_java/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe54b99e4afb7be9ec5aff3fcd99ebba6d2cbc3f4c7fd1e3ed8f1ff840d947b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ImplResolver: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/resolve.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2569790ac2e7ac03f8cc5fad3eb6fb52935829224b6c36fff0b2184d337d5e58"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: history/mod.rs: FileTooLong \u2014 583 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 83 over it, 1.17\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":"baml_language/crates/bex_events/src/history/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0830e40d671544e904d02cabd629837d84805dead997f77e5ab7cae74e96ede"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WasmHttp: ClassTooLong \u2014 464 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), 3 methods, 7 blocks, lines 35-798. The bar is 400 significant lines; this is 64 over it, 1.16\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_wasm/src/wasm_http.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea80f7c3e0a47ee653e24fabbc569ae988c311977ac1a58ba5ad163ce67aba5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hir/dump.rs: FileTooLong \u2014 580 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 80 over it, 1.16\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":"engine/baml-compiler/src/hir/dump.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8d60dcf8eb9bc800ebc0acf935284b2c7874704e55e5684c66cda35ecfae5d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.infer_exported_object: MethodTooLong \u2014 infer_exported_object runs 116 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 16 over it, 1.16\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":9819}}}],"partialFingerprints":{"codehealthFindingId/v1":"a387cd636a214cb9f0ea2d2a433f05b9ed591ff12589309d2e88f216fd32e1cb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Renderer.structural: MethodTooLong \u2014 structural runs 116 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 16 over it, 1.16\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":"baml_language/crates/baml_type/src/normalize/mu.rs"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"4381cee1c38c18aad541024397a7d9b2c9c8ed9017cb6059fcd8d426f8fd27a7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BexHeap.fixup_object_references: MethodTooLong \u2014 fixup_object_references runs 116 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 16 over it, 1.16\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":"baml_language/crates/bex_heap/src/gc.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aaded2481b4b71e4b28cc1750835a9dc6b2e38dc7bb648c40dbabbd9607e53b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_go::render_projected_go_type: FunctionTooLong \u2014 sdkgen_go::render_projected_go_type runs 116 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 16 over it, 1.16\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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":3047}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ccede59a6c428c649c339893def7c0bdac2fd0f1faad6c97b7e6c0f31a1409"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_rust::wire_ty::wire_ty: FunctionTooLong \u2014 sdkgen_rust::wire_ty::wire_ty runs 116 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 16 over it, 1.16\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":"baml_language/sdks/rust/sdkgen_rust/src/wire_ty.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd788a06bdb22ea8e15791d3b8d1046e3a7bb84af38b9734559289ed5b7bb4f0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReplState.parse_and_evaluate_baml_expression_with_status: MethodTooLong \u2014 parse_and_evaluate_baml_expression_with_status runs 116 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 16 over it, 1.16\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":"engine/baml-runtime/src/cli/repl.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"73271edbc5bd47bec32afc87a82c52ed896c55abf880b9f032f8078848a8d9ed"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Deployer.deploy_new_project: MethodTooLong \u2014 deploy_new_project runs 116 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 16 over it, 1.16\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":"engine/cli/src/deploy.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8b1b181fcef3ebfb3501988819805fc5bf7a92aa22a78a082aff92079a625f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 579 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 33 free functions. The bar is 500 significant lines; this is 79 over it, 1.16\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":"baml_language/crates/baml_release/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5c6619f4c5d59959c0e87b9251d37f136fb27da0956e981b7b0ac456fd08be"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TypeRegistry: ClassTooLong \u2014 462 significant lines (blank, comment-only and punctuation-only lines excluded), 39 methods. The bar is 400 significant lines; this is 62 over it, 1.16\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/TypeRegistry.java"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"064371e673e067a5af6b8dc8c9315efbb1f7e2f3e0c9ac7df75e6d8963b2ccf8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/generated-reference.tsx: FileTooLong \u2014 575 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 75 over it, 1.15\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":"typescript2/app-developer-docs/components/generated-reference.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a0083c96f076157835dd5189308d444dfcfa365942c664c7b8a7ecce388338"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StackifyCodegen.emit_rvalue_pull: MethodTooLong \u2014 emit_rvalue_pull runs 115 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 15 over it, 1.15\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":"baml_language/crates/baml_compiler2_emit/src/emit.rs"},"region":{"startLine":1801}}}],"partialFingerprints":{"codehealthFindingId/v1":"140e3accbb94b6a6a2f3dc5b202ec8288efe386480766e5d747d923f668cc80a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler_diagnostics::render::build_rendered_diagnostic: FunctionTooLong \u2014 baml_compiler_diagnostics::render::build_rendered_diagnostic runs 115 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 15 over it, 1.15\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":"baml_language/crates/baml_compiler_diagnostics/src/render.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0fc57aa935ee26005c2ad4abfbb8b7f3e1976a8dc383fc9803216ab390bd62"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BexVm.bigint_binop: MethodTooLong \u2014 bigint_binop runs 115 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 15 over it, 1.15\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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":5768}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcebdcfc428c0b81535ad6585bb6105f4ef797117504000dfc85c030fa54005"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BexVm.visit_roots: MethodTooLong \u2014 visit_roots runs 115 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 15 over it, 1.15\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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":12127}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd65004cd00227906942a3f53028252bc9c3065be0cf834124e92227686ec14f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_go::projected_input_encoder: FunctionTooLong \u2014 sdkgen_go::projected_input_encoder runs 115 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 15 over it, 1.15\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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":3302}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b4a065cc1a36bdd5602b254d379467dc767ee70cca1e83151d8158a3a818a0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BexHeap: ClassTooLong \u2014 459 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), 96 methods, 5 blocks, lines 171-1310. The bar is 400 significant lines; this is 59 over it, 1.15\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":"baml_language/crates/bex_heap/src/heap.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e5b3ee21ee609d1dddabfb4bbce512f035d83d1fcab4ab556934f8af322219"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LowerCtx.lower_type_ref_inner: MethodTooLong \u2014 lower_type_ref_inner runs 114 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 14 over it, 1.14\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":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"48404a6c1dd10c65a18fa3d8db20c463004f4439c07fa4672d0c8f82c664b4f3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.lower_multi_segment_path_as_field_chain: MethodTooLong \u2014 lower_multi_segment_path_as_field_chain runs 114 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 14 over it, 1.14\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":6810}}}],"partialFingerprints":{"codehealthFindingId/v1":"8533964d0450c85e3b87665d91426c8b92592a8e906de2ca434dc86e513324a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cargo_size_gate::output::render_aggregate_markdown: FunctionTooLong \u2014 cargo_size_gate::output::render_aggregate_markdown runs 114 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 14 over it, 1.14\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":"baml_language/crates/tools_size_gate/src/output.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78f5ced036a9d33ea324df55075ab14b187bad159ce5eee708d0b7e23b632cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_go::baml_type_descriptor_with: FunctionTooLong \u2014 sdkgen_go::baml_type_descriptor_with runs 114 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 14 over it, 1.14\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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":4910}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7e55ff9905d537cf7d11b2f153107848a729c29731039fed09a93c59b1e339"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: internal_baml_jinja_types::evaluate_type::pretty_print::pretty_print: FunctionTooLong \u2014 internal_baml_jinja_types::evaluate_type::pretty_print::pretty_print runs 114 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 14 over it, 1.14\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":"engine/baml-lib/jinja/src/evaluate_type/pretty_print.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7264d17fc32525161d19bccb5c4558879292caa01a459868e649f838dd8b4b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: internal_baml_parser_database::names::resolve_names: FunctionTooLong \u2014 internal_baml_parser_database::names::resolve_names runs 114 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 14 over it, 1.14\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":"engine/baml-lib/parser-database/src/names/mod.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1ef7968074368e88869cba4053858e677eae07a7284aac2e6900ed28607503"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WithIr.encode: MethodTooLong \u2014 encode runs 114 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 14 over it, 1.14\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":"engine/language_client_cffi/src/ctypes/baml_type_encode.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d909fbcadc39ac4663e0fd61ed203b087e15b0f4f1ce435e5e6f9aaf16f0592"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: comment-feed-view.CommentFeedView: FunctionTooLong \u2014 CommentFeedView runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\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":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"63814d64e152c9c14d1d0b3813a6d88247209b80a1d0ffd8e18456cbe46ffbb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli-generator.generateCliPublicationInput: FunctionTooLong \u2014 generateCliPublicationInput runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\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":"typescript2/app-developer-docs/lib/generated-content/cli-generator.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cbbf245eb8d8ba1181b9448e5d4d01bf316b67399bb002c7c4f47066bce3463"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: teammate-emails.TeammateEmails: FunctionTooLong \u2014 TeammateEmails runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\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":"typescript2/app-website/app/(home)/eap/teammate-emails.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb59a036a3f4c9dd95c3e1962a0d9eba194a1d156beaaeccfa137dacd09e285e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/bex_str.rs: FileTooLong \u2014 569 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 62% of them inside a single declaration: BexStr (15 blocks, 38-1022). The bar is 500 significant lines; this is 69 over it, 1.14\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_str/src/bex_str.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cd62dcbcb5d61f61dfb05788f10d0b01f9c54b8efe52719db857c7f3d2ee12"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TypeCtx: ClassTooLong \u2014 455 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), 14 methods, 3 blocks, lines 271-987. The bar is 400 significant lines; this is 55 over it, 1.14\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":"baml_language/crates/bex_sap/src/sap_model/convert.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"de43e8345d04fa6a6f66a85d0295443c642e9b8c63517fff9c68905e82f8ad13"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _lib/art.tsx: FileTooLong \u2014 568 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 68 over it, 1.14\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":"typescript2/app-website/app/(home)/blog/_lib/art.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a92790fd7208681e05f2027866a94038347e9e128fb7f5edbb2e2cacf3976f5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: LoweringContext: TooManyFields \u2014 34 stored fields beside 300 methods. The bar is 30 stored fields; this is 4 over it, 1.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"d055ab7480c45acb7874a5119e4962c738ddfe38a0b4a2bcd7f0990c2ffcef6c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Items: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"557fb9901bbe2ac51bb3b32cd463a14ee3a3d39fe21516d54bb284d5d5c07d53"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: BamlApiV1: TooManyFields \u2014 34 stored fields. The bar is 30 stored fields; this is 4 over it, 1.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_cffi/src/api.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ddd4570b3046e5df7779cd3e0bee2f8896cdfa9c15780a81af2d80585da2ffb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: BamlApiV1: TooManyFields \u2014 34 stored fields. The bar is 30 stored fields; this is 4 over it, 1.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/rust/bridge_rust/src/capi.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07a0981c8ca5d0b7b13b0d571ca6ee50f299d0b7b00d6c920383add0e49af62"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sap_model/mod.rs: FileTooLong \u2014 565 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 65 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/sap_model/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d708bc424a03c102115b1b6d299e3324ee8ce5386123bcc3fe9fc95c26031ce5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StackifyCodegen.compile: MethodTooLong \u2014 compile runs 113 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 13 over it, 1.13\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":"baml_language/crates/baml_compiler2_emit/src/emit.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"af08d5b17d84e1f1f90f21172524ff622e5c0dc2fa8c2a50779ea052fd1825c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_ide::info::type_info_for_served_definition: FunctionTooLong \u2014 baml_ide::info::type_info_for_served_definition runs 113 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 13 over it, 1.13\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":"baml_language/crates/baml_ide/src/info.rs"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"18166b1cabd547b0865966d1771a0e36a989047fb5caa3703944a2ed20e0783c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bex_vm::package_reflect::type_kinds::substitute_witness_field_type: FunctionTooLong \u2014 bex_vm::package_reflect::type_kinds::substitute_witness_field_type runs 113 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 13 over it, 1.13\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":"baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"df257b59f0dd6afdd1f1d55717d7b2206a4da021d245e3a57ba8d00376ab8796"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: btel_bcs::delivery::assemble: FunctionTooLong \u2014 btel_bcs::delivery::assemble runs 113 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 13 over it, 1.13\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":"baml_language/crates/btel_bcs/src/delivery.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e5b9992978a848e96794ed86e9361267c230f63e0112f2f4fd2605dbbaa661"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_go::projected_output_decoder: FunctionTooLong \u2014 sdkgen_go::projected_output_decoder runs 113 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 13 over it, 1.13\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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":3464}}}],"partialFingerprints":{"codehealthFindingId/v1":"d341c78d6ae2235f0fbd612fe5718719ae7c61acc6724bb53f6f5ae72ec278dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page.BlogPost: FunctionTooLong \u2014 BlogPost runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\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":"typescript2/app-website/app/(home)/blog/[slug]/page.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e335170e6ca8e7c35b43945ef89bc9ef79c99f02ed48321100c4834a60a7fa9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LspRuntime: ClassTooLong \u2014 451 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), 25 methods, 2 blocks, lines 159-862. The bar is 400 significant lines; this is 51 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":"baml_language/crates/baml_lsp_server/src/lsp_runtime.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c217a6b553a9a65a33697f49c66d7b38b7ea7b3741c58bfc66a414477f9276"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GEPAOrchestrator: ClassTooLong \u2014 451 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), 13 methods, 2 blocks, lines 82-807. The bar is 400 significant lines; this is 51 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":"engine/baml-runtime/src/optimize/orchestrator.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f403e843d6e7e4e2fb00a52e282fcea6fd467f711037ec78e71593221b1c455"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tokens.rs: FileTooLong \u2014 563 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 63 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/tokens.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f3f56065b49aefa6aad9bb1c5f678909549539933315db1cd8a49426de9238"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: traits/mod.rs: FileTooLong \u2014 562 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 62 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/traits/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2537fd582839298415f5372b6b78ab5a0b7aeec9be43dc08656a8a40c3b8d200"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/wasm_http.rs: FileTooLong \u2014 561 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 83% of them inside a single declaration: WasmHttp (7 blocks, 35-798). The bar is 500 significant lines; this is 61 over it, 1.12\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_wasm/src/wasm_http.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6314bca6fc4fc9ef9b152a1518af7a12eab45da1ac6eed953a4de0f22b3ba0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/sidebar.tsx: FileTooLong \u2014 561 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 61 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/sidebar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20024d6f8e4f3d9d5d7c270073f47fac40d80b61c89907d81445b019cb05f8b1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SemanticIndexBuilder.walk_expr_children: MethodTooLong \u2014 walk_expr_children runs 112 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 12 over it, 1.12\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":"baml_language/crates/baml_compiler2_hir/src/builder.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2a161dc49a111377f7f3811d195dac94ae190c6a4247bae1240e9050a12104"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.lower_member_access: MethodTooLong \u2014 lower_member_access runs 112 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 12 over it, 1.12\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":10524}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc6c9160e1925fa672e0ceeeef2fc8ec0a3f647f14b06102fb77f4bb859c714"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_type::normalize::mu::convert: FunctionTooLong \u2014 baml_type::normalize::mu::convert runs 112 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 12 over it, 1.12\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":"baml_language/crates/baml_type/src/normalize/mu.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9ecf3524a4adac20ffbd8a7c46c6da96d6e88fb792371b86765d2965806db4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: generators_openapi::type::convert_ir_type: FunctionTooLong \u2014 generators_openapi::type::convert_ir_type runs 112 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 12 over it, 1.12\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":"engine/generators/languages/openapi/src/type.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e449687dc7ca8881219d9225ca64d3c7a9a264eb0fc5de04fd0f7f89f7d83860"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: route.GET: FunctionTooLong \u2014 GET runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\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":"typescript2/app-beps/src/app/api/agent/beps/route.ts"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3949c4d8a805aa13c13776ac29a9d9d10b7488b347331f09f683bd865e867f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 559 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 59 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9cc0f2885057d9b131d6fb57053126449fbc9e2f4bafb085821dbf76e16f9e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: coercer/coerce_primitive.rs: FileTooLong \u2014 557 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 57 over it, 1.11\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":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c7c1ac2b54ddd8024dceb7821d1e0bcf9c02735b5536f3efca63a4d9f57696"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Structural: ClassTooLong \u2014 445 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), 19 methods, 2 blocks, lines 1290-1941. The bar is 400 significant lines; this is 45 over it, 1.11\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":"baml_language/crates/bex_vm/src/package_baml/json/decode.rs"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"482652474d2b09bc9cf1c93738f819536be89330db2b431a1054d23d7dbbfefb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/names.rs: FileTooLong \u2014 556 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 65% of them inside a single declaration: PythonNames (2 blocks, 105-614). The bar is 500 significant lines; this is 56 over it, 1.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/names.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"827b6a57ccf7971cc710f6fe87406e43fd30217c6878c97ad1e0a4e9d4117c1f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.field_access_resolved: MethodTooLong \u2014 field_access_resolved runs 111 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 11 over it, 1.11\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":10054}}}],"partialFingerprints":{"codehealthFindingId/v1":"439cd0d0c15a11888a34758785e79458d7d5d4ae7c03ba3839e50dfaa6fc49bd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BamlWasmRuntime.start_preview_run: MethodTooLong \u2014 start_preview_run runs 111 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 11 over it, 1.11\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":"baml_language/crates/bridge_wasm/src/runs.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f00c4251e756df554da345bc3dfcb3c9b5692783abae0fedf8e34f26f1e5d3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: docs-toc.DocsToc: FunctionTooLong \u2014 DocsToc runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\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":"typescript2/app-developer-docs/components/docs-toc.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3c7cd3a8d6e8ca63187c8c7178700838eebfb1860fa9e53b3f6af213dbd010"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IoSysOpsBuilder: ClassTooLong \u2014 440 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), 18 methods, 3 blocks, lines 2881-3582. The bar is 400 significant lines; this is 40 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":"baml_language/crates/sys_ops/src/lib.rs"},"region":{"startLine":2881}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf05e057018571a9bd944a09e8c685fd5c56ad82e156f6f0cfe47b36f9d110e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_builtins2_codegen::codegen_io::emit_result_conversion_for_ty: FunctionTooLong \u2014 baml_builtins2_codegen::codegen_io::emit_result_conversion_for_ty runs 110 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 10 over it, 1.10\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":"baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs"},"region":{"startLine":2720}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff02f2bfe09593375756adbdae1556b3ce3acad5ab7ea235fbadc48dcb246b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_hir::item_data::interfaces::lower: FunctionTooLong \u2014 baml_compiler2_hir::item_data::interfaces::lower runs 110 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 10 over it, 1.10\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":"baml_language/crates/baml_compiler2_hir/src/item_data/interfaces.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"56becff08f63b35b9b2260093a1c5584182fc10b89ba01e6ab096f15bb9e9277"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_lsp_server::playground_server::handle_function_run: FunctionTooLong \u2014 baml_lsp_server::playground_server::handle_function_run runs 110 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 10 over it, 1.10\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":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c752f4aa4ac1e822b3a6c673d837d4e64c0cf65c28024f99748e8c8c3527f8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_query_btel::ingest::profile::part_of: FunctionTooLong \u2014 baml_query_btel::ingest::profile::part_of runs 110 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 10 over it, 1.10\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":"baml_language/crates/baml_query_btel/src/ingest/profile.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d05d31ec9ae478461f82d824091557097622a312a7982d44ccb51cc87d3c99a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BexVm.begin_error_evidence: MethodTooLong \u2014 begin_error_evidence runs 110 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 10 over it, 1.10\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":"baml_language/crates/bex_vm/src/vm/error_evidence.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecb271e4e441fb2b5708b36e1ba0e9ea2ebcaecaa5a3d52d063cdf478ea5a3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_cffi_macros::generate_param_extraction: FunctionTooLong \u2014 baml_cffi_macros::generate_param_extraction runs 110 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 10 over it, 1.10\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":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a35d9df55a7b0a3a32ce584d54f7264c92f1c2023ecf1345babf4c67f5c437b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: http.createRequestHandler: FunctionTooLong \u2014 createRequestHandler runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\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":"typescript2/app-product-metrics/src/http.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fefcaef876cbf9e1741dc88585f3059c29bd86e5e2bc7076cf477c6c659d78d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MirBuilder: ClassTooLong \u2014 439 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), 48 methods, 2 blocks, lines 38-805. The bar is 400 significant lines; this is 39 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":"baml_language/crates/baml_compiler2_mir/src/builder.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c789af24a29594cda3868de7b851a67774306c9d4f1d98623b9fddf6a26f4477"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_builtins2_codegen::codegen_io::emit_one_namespace_trait: FunctionTooLong \u2014 baml_builtins2_codegen::codegen_io::emit_one_namespace_trait runs 109 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 9 over it, 1.09\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":"baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75f0b67a73b6589a84590848c9d556b7ce67aacd44ff41c0d874db7b0097cde"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_type::unify::unify_into_at: FunctionTooLong \u2014 baml_type::unify::unify_into_at runs 109 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 9 over it, 1.09\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":"baml_language/crates/baml_type/src/unify.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"31cd48b0643fb2aca913e6d0e8be6deb3a6b3498dbe78aa4883f864011efc227"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Recording.publish: MethodTooLong \u2014 publish runs 109 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 9 over it, 1.09\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":"baml_language/crates/bex_vm/src/telemetry/manual.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db1b24de04b073405ded6375605cf069ac863715a64a3f44b7c1362fe372c38"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bridge_ctypes::value_decode::decode_inbound: FunctionTooLong \u2014 bridge_ctypes::value_decode::decode_inbound runs 109 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 9 over it, 1.09\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":"baml_language/crates/bridge_ctypes/src/value_decode.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9be75b2765f3578aebda388198f3df39c5c2920ccf4827cd084e94b32e918ff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RecordingBuilder.seal: MethodTooLong \u2014 seal runs 109 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 9 over it, 1.09\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":"baml_language/crates/btel_recorder/src/recording.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb25db872c4b13b1ffcd1c49d04bcec47a88bbe838dce2a809266b1f0c0c25e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Reader.object: MethodTooLong \u2014 object runs 109 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 9 over it, 1.09\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":"baml_language/crates/btel_snapshot/src/decode.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"37bb2eb39a492ff4d5dbb3200ce4a0915d808398288dabf7cdd4b90a3eaa07d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_csharp::semantic::require_supported_type_inner: FunctionTooLong \u2014 sdkgen_csharp::semantic::require_supported_type_inner runs 109 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 9 over it, 1.09\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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":1885}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd59d024d72870837f66171d5b7c249a4fabf3728ca44cc938ff27842f9322f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: internal_baml_ast::parser::parse::parse: FunctionTooLong \u2014 internal_baml_ast::parser::parse::parse runs 109 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 9 over it, 1.09\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":"engine/baml-lib/ast/src/parser/parse.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48c7f3cf2e944ccee046df1eed354e715863d26d112d10bdef230f7f9323ed2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/state.rs: FileTooLong \u2014 543 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 69% of them inside a single declaration: GlobalState (2 blocks, 353-1011). The bar is 500 significant lines; this is 43 over it, 1.09\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":"baml_language/crates/baml_lsp/src/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41dedadfdf3a962bca287eba8631a799877e581a10e56289e69acf36faac944a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/accessor.rs: FileTooLong \u2014 543 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 43 over it, 1.09\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":"baml_language/crates/bex_heap/src/accessor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d80ce90f3105e71f407d962c72d8d02ea2eb6924a29ba7da7cc1f294803b87"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/value_expr.rs: FileTooLong \u2014 543 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 43 over it, 1.09\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":"engine/baml-lib/baml-types/src/value_expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd3e8911f34e3059406b91106b6159d0594fce7e3f6843ec70a68a8ce6b0073"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Expression: ClassTooLong \u2014 432 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), 17 methods, 3 blocks, lines 90-767. The bar is 400 significant lines; this is 32 over it, 1.08\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":"engine/baml-lib/ast/src/ast/expression.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f0d3d93b57bde1b7d289ca7c84d4f2bb7598c715a131a090c86be18ceec36d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NormalTy.is_subtype_of_inner: MethodTooLong \u2014 is_subtype_of_inner runs 108 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 8 over it, 1.08\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":"baml_language/crates/baml_type/src/normalize.rs"},"region":{"startLine":1963}}}],"partialFingerprints":{"codehealthFindingId/v1":"98203337f8f96aa88d306e4b5bae6fbe78144266fe03d0c91badd1d181426c46"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bex_vm::debug::instruction_style: FunctionTooLong \u2014 bex_vm::debug::instruction_style runs 108 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 8 over it, 1.08\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":"baml_language/crates/bex_vm/src/debug.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dba1caa29e1fae5c6accd0c0f4a1a669eef034bc13f114ee8860dc3097177f0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RenderDefinitionValidator.visit: MethodTooLong \u2014 visit runs 108 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 8 over it, 1.08\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":"baml_language/crates/bex_vm/src/package_reflect/type_class.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"457f8f91df7300a5daba2162d5dd1abe801cc88993cb1110cff27110416ace3c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BamlWasmRuntime.start_run: MethodTooLong \u2014 start_run runs 108 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 8 over it, 1.08\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":"baml_language/crates/bridge_wasm/src/runs.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"63df38906ef1839474d332b9aabfa63eba3244da4d327afcd1f81fbe336abbd5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_bridge::outbound::to_inbound: FunctionTooLong \u2014 baml_bridge::outbound::to_inbound runs 108 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 8 over it, 1.08\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":"baml_language/sdks/rust/bridge_rust/src/outbound.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ae07027e7261d3d1c7aca9ef1e0edc8fb7c9de4c6a85ece6af860893409dbe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Expr.temporary_same_state: MethodTooLong \u2014 temporary_same_state runs 108 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 8 over it, 1.08\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":"engine/baml-lib/baml-types/src/expr.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee2d1fbf8e74aa5dbb4f0f547ba242ccc867fccb8d801faeae0875231f1ca2d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GEPAOrchestrator.run: MethodTooLong \u2014 run runs 108 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 8 over it, 1.08\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":"engine/baml-runtime/src/optimize/orchestrator.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fcf94239eb94ceee569b67123ab90930cdfca16ab1d22c9ddd41d11e5ac7a2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WithIr.encode: MethodTooLong \u2014 encode runs 108 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 8 over it, 1.08\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":"engine/language_client_cffi/src/ctypes/baml_value_encode.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5e698ba6c61d9078f9b2901477077b3762b8b006fbd8bbac1271ef72787923"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: first-bento-animation.FirstBentoAnimation: FunctionTooLong \u2014 FirstBentoAnimation runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\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":"typescript2/app-website/components/first-bento-animation.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ba61d735bb67af614675716b3169adf81f2970ab150e2edf20b47270122ef3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/types.rs: FileTooLong \u2014 539 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 65% of them inside a single declaration: Program (2 blocks, 73-686). The bar is 500 significant lines; this is 39 over it, 1.08\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm_types/src/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1089d3f46453631a72154cc720849c22579a767059b3ce653332a7ef78e67f31"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OptimizeArgs: ClassTooLong \u2014 431 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), 3 methods, 2 blocks, lines 13-763. The bar is 400 significant lines; this is 31 over it, 1.08\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":"engine/baml-runtime/src/cli/optimize.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"339105e019449e21394381db4e19ea8675edb2331bb3c7b383b6ecd87337d0fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/translate_ty.rs: FileTooLong \u2014 538 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 38 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/sdkgen_java/src/translate_ty.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d049dffea59d13a7ab67f980eff5c5d908c497693d8e858a1539dd3e5feefbc4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: preview/main.ts: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 38 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar/preview/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d86ffb6948e893c9c9ff4c6a8cd96215d3eb08ec95c02489301a89853718460"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: emit/class.rs: FileTooLong \u2014 537 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 37 over it, 1.07\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":"baml_language/sdks/rust/sdkgen_rust/src/emit/class.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d731d8dd703be998d3b20c8bafd38cc084c0cd688c55dafb60cae7312f8a31"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Baml.NuGetNormalizer/Program.cs: FileTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 36 over it, 1.07\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":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.NuGetNormalizer/Program.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"293150138fea23622f89119e0d1b60efdc76b244289341f437839f5ef9d29922"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/template.rs: FileTooLong \u2014 536 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 36 over it, 1.07\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":"baml_language/crates/baml_type/src/template.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b8b052b9df903041c77081fc73603675bb2fcd9a8e59c3a99524bd8fc364fd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Analysis.new: MethodTooLong \u2014 new runs 107 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 7 over it, 1.07\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":"baml_language/crates/baml_compiler2_rust/src/structure.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd7e92278acc6167344c10ac645b0670ea6cd203594fd56d36ab7f23e93848e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bex_vm::package_trace::start_span_impl: FunctionTooLong \u2014 bex_vm::package_trace::start_span_impl runs 107 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 7 over it, 1.07\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":"baml_language/crates/bex_vm/src/package_trace.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"5033a51c9fe441b197825924e22d47aa89c41fc4a28bb9d831c73d933bd4ce3c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_python_pydantic2::translate_ty::translate_ty_from: FunctionTooLong \u2014 sdkgen_python_pydantic2::translate_ty::translate_ty_from runs 107 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 7 over it, 1.07\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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/translate_ty.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5fbe36b07ab1a0fc233f7d080ac1bb0947d0383178179351f140bf3352185d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: internal_baml_ast::parser::parse_expression::parse_expression: FunctionTooLong \u2014 internal_baml_ast::parser::parse_expression::parse_expression runs 107 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 7 over it, 1.07\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":"engine/baml-lib/ast/src/parser/parse_expression.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"946f49bb8e3cfe2fe5b13e0a71920d623113063a7f594bf4b55792e8ee3b17bf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AstSignatureWrapper.try_from: MethodTooLong \u2014 try_from runs 107 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 7 over it, 1.07\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":"engine/baml-runtime/src/runtime/publisher/mod.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cdc225698cad645bad06261b3af4079682dd8f03cf914932c04fbbcfb8ef50"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: war-scene.WarScene: FunctionTooLong \u2014 WarScene runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\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":"typescript2/app-website/app/(home)/fight-slop-with-slop/_components/war-scene.tsx"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"77862f6088e97b1633199fb4ec68f944b431b8b1e2257594eb6b49265c35956f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RunArgs: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/run_command.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69a5f50e6803565dcda2389beb9939c8cfee5c29a18596da3c8baf6d9d21e47"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Bulk: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/ingest/bulk.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b8074a9843c5208e306fa673a31367e8d78969f2b98341112c16b5b6441580"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TelemetryRecording: ClassTooLong \u2014 426 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), 16 methods, 2 blocks, lines 26-767. The bar is 400 significant lines; this is 26 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/telemetry.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a02aa0437d5b4fa3c7e4562fa8d5475ca7bb7300d00ebcd35c9745aba3c6d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/json_inhabit.rs: FileTooLong \u2014 532 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 64% of them inside a single declaration: JsonInhabitance (2 blocks, 243-738). The bar is 500 significant lines; this is 32 over it, 1.06\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":"baml_language/crates/baml_type/src/json_inhabit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70eea2ee50396d672930754d91a9f196b4d988531ce00a00b2f87841ed6d8d0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 532 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 32 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/rust/sdkgen_swift/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4993cfb8d05bf5c8eba57b03c8d058ee356988b81b2155dbe8c58c8566c0303"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runtime.rs: FileTooLong \u2014 531 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 76% of them inside a single declaration: TelemetryRuntime (3 blocks, 105-837). The bar is 500 significant lines; this is 31 over it, 1.06\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":"baml_language/crates/btel_processor/src/runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06b2698deff46612365d7b338057a82c623179289dd1eb80bdfb66035369845"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/types.rs: FileTooLong \u2014 530 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 30 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_parser/src/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f529e9d9309f2f36e0a24822da19b3feae740bfa635b5c2d99ab08da2fba8194"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeRefDisplay.fmt: MethodTooLong \u2014 fmt runs 106 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 6 over it, 1.06\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":"baml_language/crates/baml_compiler2_hir/src/type_ref.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af12b8baed34874c6bf3de4375eee69ab71f46194cb34df28780e4c271be7ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_visualization::control_flow::from_ast::render_expr_compact_ast: FunctionTooLong \u2014 baml_compiler2_visualization::control_flow::from_ast::render_expr_compact_ast runs 106 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 6 over it, 1.06\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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e04934b3405a9d08c47394715dcb36278fcd3b4e0038ecea683ab05025a681"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WasmHost.call_registered_callable_with_context: MethodTooLong \u2014 call_registered_callable_with_context runs 106 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 6 over it, 1.06\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":"baml_language/crates/sys_wasm/src/host_value.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"066712a6ad381cfd09673ba9022b2678a761957827f0c89f6733e748318bf5a8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Expression.assert_eq_up_to_span: MethodTooLong \u2014 assert_eq_up_to_span runs 106 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 6 over it, 1.06\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":"engine/baml-lib/ast/src/ast/expression.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"112b76c87409b8b6d037793d5603b720d240acf0403ddb575af20701ee4fe01c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: app.Question: FunctionTooLong \u2014 Question runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\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":"typescript2/app-type-quiz/src/app.tsx"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac8e918f2147dcca38d6510e4531ee1647d55a17844eaa9957da3ed118e8bf8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RubyToJson: ClassTooLong \u2014 422 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), 18 methods, 2 blocks, lines 21-651. The bar is 400 significant lines; this is 22 over it, 1.06\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":"engine/language_client_ruby/ext/ruby_ffi/src/ruby_to_json.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d918f9c3f1839db96ed8cbdfc7c3a28fb561b8aa75ce02a3de7b6634c9b533f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: baml_go/runtime.go: FileTooLong \u2014 527 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 27 over it, 1.05\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":"baml_language/sdks/go/baml_go/runtime.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d23da43589cf8a683434a6f3c93bddf38d67317f470936e3e661ffd1a5c428"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: infer/unify.rs: FileTooLong \u2014 527 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 80% of them inside a single declaration: InferenceTable (2 blocks, 269-999). The bar is 500 significant lines; this is 27 over it, 1.05\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer/unify.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"167a2db5c771d0b1fd486156dcd0ffa171167084383a69018a00e64a3db42356"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 527 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 61% of them inside a single declaration: Processing (2 blocks, 46-443). The bar is 500 significant lines; this is 27 over it, 1.05\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":"baml_language/crates/btel_processor/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3485e72b50ff6f500382102763e96de32c4caee5a6e87b5e21a0901c8edcf691"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/encode.rs: FileTooLong \u2014 526 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 26 over it, 1.05\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":"baml_language/sdks/python/rust/bridge_python/src/encode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec15262d31315a51b5bd0daaa80d4b16efea570db610df6498aa367fa12e8c85"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InferenceTable: ClassTooLong \u2014 420 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), 37 methods, 2 blocks, lines 269-999. The bar is 400 significant lines; this is 20 over it, 1.05\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer/unify.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"140d5b4cfe74d5ec921448ea03862da3105bff7553e986e44fc45c31c241cc71"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_db::check::source_aware_tir_type_error_message: FunctionTooLong \u2014 baml_db::check::source_aware_tir_type_error_message runs 105 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 5 over it, 1.05\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":"baml_language/crates/baml_db/src/check.rs"},"region":{"startLine":2026}}}],"partialFingerprints":{"codehealthFindingId/v1":"588e7ee8304b689884cfe599a29992b3b1f28cc6afd4e77a5bcf1d00ef3210cc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UnresolvedAwsBedrock.create_from: MethodTooLong \u2014 create_from runs 105 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 5 over it, 1.05\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":"engine/baml-lib/llm-client/src/clients/aws_bedrock.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebd7722250c5a85d7545d32d9a932b129455927b651661ac1aa327e143cad62"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GenerateArgs.generate_clients: MethodTooLong \u2014 generate_clients runs 105 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 5 over it, 1.05\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":"engine/baml-runtime/src/cli/generate.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"090c70e8d30314c2de2497eb899b6369bd06aee82881600303fa8112c2ee768e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VertexClient.build_request: MethodTooLong \u2014 build_request runs 105 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 5 over it, 1.05\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":"engine/baml-runtime/src/internal/llm_client/primitive/vertex/vertex_client.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c60a60f02335b3d823ab8e6f30e83e200d87cd5fba1464c6aa83453d573db8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: signup-form.SignupConfirmation: FunctionTooLong \u2014 SignupConfirmation runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\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":"typescript2/app-website/app/(home)/eap/signup-form.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"670a08c503db6ab10f9d0386cc5904d6170cff821e1c0b46f20232bca521b7d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fixing_parser/json_parse_state.rs: FileTooLong \u2014 524 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: JsonParseState (2 blocks, 26-899). The bar is 500 significant lines; this is 24 over it, 1.05\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":"engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1fbcdc62e8489b64c85779eb8ff1b7d6765ea5a694841aeb9c0c9f909de305"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: comments/comment-thread.tsx: FileTooLong \u2014 524 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 24 over it, 1.05\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":"typescript2/app-beps/src/components/comments/comment-thread.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62daac8739036f2b513411a4dab41c5f19ec8811415b79155221e490b138e75d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/types.rs: FileTooLong \u2014 523 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 23 over it, 1.05\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":"baml_language/sdks/go/sdkgen_go/src/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"232294c96fa67676f27dc673ed77a11eaae3d1d31f908bd2a222e6b8af9453d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/output.rs: FileTooLong \u2014 520 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 20 over it, 1.04\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":"baml_language/crates/tools_size_gate/src/output.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a482bf106a3ce2c2f1be56302a3df9a855f6cf1ac7673d42e0a0f72bc7a2464"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeExprKind.fmt: MethodTooLong \u2014 fmt runs 104 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 4 over it, 1.04\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":"baml_language/crates/baml_compiler2_ast/src/ast.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94bf99c3d272fe0f005465f882b302e8d95988e6af0663504d73d3ee7a34f06"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_type_runtime::collect: FunctionTooLong \u2014 baml_type_runtime::collect runs 104 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 4 over it, 1.04\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":"baml_language/crates/baml_type_runtime/src/lib.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"486fe019279c9e62c36e9369a92cd2ebe231b1541acafec1558cd51175ac234c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BexVm.push_trampoline_frame: MethodTooLong \u2014 push_trampoline_frame runs 104 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 4 over it, 1.04\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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":5406}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b97c1831fde176057c61162d03d1d97b03bce913d5713b726498b044808c54"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_python_pydantic2::emit::build_emitted: FunctionTooLong \u2014 sdkgen_python_pydantic2::emit::build_emitted runs 104 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 4 over it, 1.04\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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/emit/mod.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3f917cc4253c9bf18823d14b5063cf3d759f79d37749c3d37c23e28c18bb40"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Evaluator.evaluate: MethodTooLong \u2014 evaluate runs 104 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 4 over it, 1.04\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":"engine/baml-runtime/src/optimize/evaluator.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac3b975cb7f9e2aa7f033cff0200804096d0d2fd68c25b920f516f1457ff456"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BlobUploader.upload_blob_batch: MethodTooLong \u2014 upload_blob_batch runs 104 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 4 over it, 1.04\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":"engine/baml-runtime/src/tracingv2/publisher/publisher.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"f607ae09eb1c5bb645b53963e3f7acf3928c1465ef7b57be33ae08192e0e2046"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pricing/meter.tsx: FileTooLong \u2014 518 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 18 over it, 1.04\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":"typescript2/app-website/components/pricing/meter.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1fe69517ebdb4b0c945e3c35c6a84ff95fe41ea08d226ea2c6a47f4b0ebb8b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: baml_compiler2_hir_ty::layout: TooManyFunctions \u2014 31 free functions. The bar is 30 free functions; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/layout.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e438847e5e1d689ffba8aa2889840d3ad0da4f860337987796c6b1823fd552"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Printer: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/printer.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8d1c9a413f157a65820a2a3cfbd3d211d42efaf29bbda8373c81f92fe81533"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IngressScheduler: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/lsp_ingress.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3ea210469714f08bd8a080d84970470afe0943719bf0e55a712e540805ca80"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Reader: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_snapshot/src/decode.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"08272d4b15e1898d5bc53123dba4ffa5c5d27ff135ebcda50d8d4156d498e858"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BamlRuntime: TooManyMethods \u2014 31 methods, declared across 3 files: src/runtime.rs (17), src/runtime.rs (10), src/runtime.rs (4). The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"baml_language/sdks/python/rust/bridge_python/src/runtime.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da807abf76b32a2b0ab2b995b627baeb2f3648e8cdae317fb1f4a0aa2731f47"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MermaidDiagramGenerator: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a403af8c1ceaaea2a3f99594158ed796d2cb9c023adade971c3b2e8cddd878c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/statements.rs: FileTooLong \u2014 516 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 16 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/statements.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f478528b3ec8c6fa59c09b97e6f53dbf88ad4d886fcfd2bce1f30744f76247"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/logger.rs: FileTooLong \u2014 515 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 15 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-log/src/logger.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00dd5115b3f559eaee2063bee23454e4b4ea0759b71fddb30bd071e20c3f574"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReplayServer.ServeRequestAsync: MethodTooLong \u2014 ServeRequestAsync runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.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":"baml_language/sdk_tests/crates/csharp/streaming/Program.cs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3dd7b656abfdf789f54e161e24b2f7b3490e752abb7daed7da6b49e9f4e692"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.elaborate_tagged_walk: MethodTooLong \u2014 elaborate_tagged_walk runs 103 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 3 over it, 1.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":"baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs"},"region":{"startLine":1943}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c1fa5e8a2f7083d65841387308438c1618a85c3e583b3cb417ce7529d8e9c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_emit::pull_semantics::walk_rvalue_pull: FunctionTooLong \u2014 baml_compiler2_emit::pull_semantics::walk_rvalue_pull runs 103 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 3 over it, 1.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":"baml_language/crates/baml_compiler2_emit/src/pull_semantics.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"2651612ff8f5e40066f618f635ef1eca6751585c7a8e0d90dc8a9a5632dcf73c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_macros::encode::derive_enum_encode: FunctionTooLong \u2014 baml_macros::encode::derive_enum_encode runs 103 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 3 over it, 1.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":"languages/rust/baml-macros/src/encode.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35599d7f7caaf30fd7ff39fa03be7caa92c71700fd66f658d7833306da9eeb5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/heap.rs: FileTooLong \u2014 514 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 89% of them inside a single declaration: BexHeap (5 blocks, 171-1310). The bar is 500 significant lines; this is 14 over it, 1.03\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":"baml_language/crates/bex_heap/src/heap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ba066da157482b03ee0656aa63fc38902cd0c255a468a450608bff6824cf19"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/walk.rs: FileTooLong \u2014 514 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 14 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_snapshot/src/walk.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f176275880eeffed1701ec664c35487312063cb883bf0f2012a74d0bf826ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: home/workflow.tsx: FileTooLong \u2014 514 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 14 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/workflow.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e739f756e595f7ef7d7ac7d615ae0c7748a3e70c87952c12153a009d5243e83f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/gc.rs: FileTooLong \u2014 510 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 95% of them inside a single declaration: BexHeap (82-1041). The bar is 500 significant lines; this is 10 over it, 1.02\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":"baml_language/crates/bex_heap/src/gc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37893b7d0b3bd45382e9b46103daa086072bbc29661df27f8af11b6f94c42f13"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_ast::lower_tree::body::statement: FunctionTooLong \u2014 baml_compiler2_ast::lower_tree::body::statement runs 102 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 2 over it, 1.02\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":"baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"268f7b66ab43cc18159964742fa99156089cd483aa7644db67bf534e3988297d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_hir_ty::infer::const_fold_binary: FunctionTooLong \u2014 baml_compiler2_hir_ty::infer::const_fold_binary runs 102 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 2 over it, 1.02\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"863737d12d2851a94797520fb2d5ebcf7d3826ea609bfd9f1163cbbcbe1037a7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InferenceContext.item_projection_value: MethodTooLong \u2014 item_projection_value runs 102 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 2 over it, 1.02\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":7876}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e47b68456cf2aff5559f38a4d22753aaddcfe66c6acdcf37a920d4d6ea5b536"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_csharp::semantic::render_class: FunctionTooLong \u2014 sdkgen_csharp::semantic::render_class runs 102 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 2 over it, 1.02\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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":2921}}}],"partialFingerprints":{"codehealthFindingId/v1":"4236af48a7e9fce24eacb4c1ab10d77220097587e19bd13225ac03195ee7d32a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WireCodecs.for_functions: MethodTooLong \u2014 for_functions runs 102 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 2 over it, 1.02\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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"5406981878baa0a7d47241f746f4ce0ad28fb2bb7d691a15ff06ffdc29b1cd4d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page.BcsComments: FunctionTooLong \u2014 BcsComments runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\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":"typescript2/app-beps/src/app/bcs/[number]/comments/page.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"804b7c9e8c849d12689b8df0ccedef04a08bc0ab400d049a521d1658f6165fc4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: http.createRequestHandler.\u003Creturned closure\u003E: FunctionTooLong \u2014 createRequestHandler.\u003Creturned closure\u003E runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\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":"typescript2/app-product-metrics/src/http.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"b863bfe202c2b82a80ea00f2a3e3cf93cf529d2c60f008fea872b63223b5c73d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: send-slack-report.captureDashboardOnce: FunctionTooLong \u2014 captureDashboardOnce runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\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":"typescript2/app-product-metrics/src/jobs/send-slack-report.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"363d8c6faab3e75bea7e6fa5a9ebe897e62fb5a71390e6c5ef22a216ced4546d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/catalog.rs: FileTooLong \u2014 509 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 9 over it, 1.02\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":"baml_language/crates/baml_query_btel/src/catalog.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"644233197bc574b93892ce3e08d1eccf53881aa239245dd3f8f4f809f0125b43"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: baml_vis/graph.rs: FileTooLong \u2014 509 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 64% of them inside a single declaration: GraphBuilder (2 blocks, 106-713). The bar is 500 significant lines; this is 9 over it, 1.02\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":"engine/baml-lib/ast/src/ast/baml_vis/graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fbda216fcf900e66f7fa2453530d0e54edf1bea63d38b7ce7c725a7f3b0c58"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/error.rs: FileTooLong \u2014 508 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 93% of them inside a single declaration: DatamodelError (2 blocks, 11-731). The bar is 500 significant lines; this is 8 over it, 1.02\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":"engine/baml-lib/diagnostics/src/error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6dddf829d06b4379528dc1d5804f1e857ea8203880bc559d8919179decb9b00"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: _lib/config.tsx: FileTooLong \u2014 508 significant lines (blank, comment-only and punctuation-only lines excluded), about 87% of them inside a single declaration: siteConfig (103-778). The bar is 500 significant lines; this is 8 over it, 1.02\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":"typescript2/app-website/app/_lib/config.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acdfbc32da54e0e52f5199ad2f50b5e3c7687c9e4d8347d2c7fef981e64085c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TelemetryRuntime: ClassTooLong \u2014 405 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), 28 methods, 3 blocks, lines 105-837. The bar is 400 significant lines; this is 5 over it, 1.01\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":"baml_language/crates/btel_processor/src/runtime.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e310a54ed9f71d6ae42d5f39e03a36267cc81e28be1e5ea673539230568544ba"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ReplState: ClassTooLong \u2014 405 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), 17 methods, 2 blocks, lines 242-844. The bar is 400 significant lines; this is 5 over it, 1.01\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":"engine/baml-runtime/src/cli/repl.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"019b0fcd2c0d87e5a144dcba5b32617f702b08f7374386dea4a3a75d17603c34"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: value/equality.rs: FileTooLong \u2014 506 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 6 over it, 1.01\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":"baml_language/crates/btel_reader/src/value/equality.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2ffb439a7205acd768a50a792d72798fd80288e3e4257a14e7023131ae6933"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: baml_compiler2_hir_ty::exhaustiveness::write_ty_identity: FunctionTooLong \u2014 baml_compiler2_hir_ty::exhaustiveness::write_ty_identity runs 101 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 1 over it, 1.01\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":"baml_language/crates/baml_compiler2_hir_ty/src/exhaustiveness.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a906ffefc37dc11c2376dc327cb0b51242cb8f09a463e0815ce9d216e6c2090"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoweringContext.lower_function_body: MethodTooLong \u2014 lower_function_body runs 101 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 1 over it, 1.01\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":4531}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e18459dd9dc64753ac3dc4dd10b5a976cac465a9f2e8ea33f5b33d0d02e3a23"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Composer.embed: MethodTooLong \u2014 embed runs 101 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 1 over it, 1.01\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":"baml_language/crates/baml_query_btel/src/functions.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"067866bc96b3917ef4fa717740dfbe4f71fe421a918b65c3146cc4fa0293016c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BexHeap.add_references_to_worklist: MethodTooLong \u2014 add_references_to_worklist runs 101 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 1 over it, 1.01\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":"baml_language/crates/bex_heap/src/gc.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"4deac7097522c13eda035bcf7bb8d8c109fc0d62f65a070d536ee1792ca076e5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BexVm.finish_trace_hook_config: MethodTooLong \u2014 finish_trace_hook_config runs 101 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 1 over it, 1.01\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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":2695}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74ce4fd257d38c3da2eb7272eb2be3b4d4316cf315f923d150104e2d15bed55"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_csharp::semantic::render_generic_class_support: FunctionTooLong \u2014 sdkgen_csharp::semantic::render_generic_class_support runs 101 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 1 over it, 1.01\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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":4081}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c7a4d1f9a822cd6026ad4059bda31974eef92b2924e26d2f66c62edefab42a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_csharp::semantic::encode_type_metadata: FunctionTooLong \u2014 sdkgen_csharp::semantic::encode_type_metadata runs 101 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 1 over it, 1.01\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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":4625}}}],"partialFingerprints":{"codehealthFindingId/v1":"df74a2b0ad8794ed4fd3ab56fa32c387780d3e7c7e9b30768d3baafebcfc6e68"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sdkgen_python_pydantic2::leaf::render_symbol: FunctionTooLong \u2014 sdkgen_python_pydantic2::leaf::render_symbol runs 101 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 1 over it, 1.01\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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbbb8e93252d6b2048afc517418e46804693a42731dad397e237c75ffd6cbc79"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RubyToJson.serialize_baml: MethodTooLong \u2014 serialize_baml runs 101 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 1 over it, 1.01\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":"engine/language_client_ruby/ext/ruby_ffi/src/ruby_to_json.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d6b5d99ad0c0352a9a9e46632f91e7d01ed4173a97570ecfbc6b93d2b0544c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BamlValue.baml_decode: MethodTooLong \u2014 baml_decode runs 101 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 1 over it, 1.01\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":"languages/rust/baml/src/codec/baml_value.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2e400115ff88af5fe2ec6ef3b85c8280aa19e99519d0a2493f9e502786fc93"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mobile-nav.MobileNav: FunctionTooLong \u2014 MobileNav runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\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":"typescript2/app-developer-docs/components/mobile-nav.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ce66c28217f1508a47ccbc26cf2dda812db495a966c6ed6868a065d514cf44"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: app.Reveal: FunctionTooLong \u2014 Reveal runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\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":"typescript2/app-type-quiz/src/app.tsx"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b0abbed2d3850c0120ba69a63eb67abfa514f1a299a6bab3e1f4fe04ac964c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pinned.Looped: FunctionTooLong \u2014 Looped runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\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":"typescript2/app-website/components/home/pinned.tsx"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d2116a6650b6cdba8f2433d54ae1ec2ba71e79781f3d18b644f5d891ae8d10"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/export-all-utils.ts: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3 over it, 1.01\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":"typescript2/app-beps/src/lib/export-all-utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b57503e507bef2d6c36ba6ec0bce92e118bb01d8db794d0832958d53afa6ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fixing_parser/json_parse_state.rs: FileTooLong \u2014 502 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: JsonParseState (2 blocks, 23-857). The bar is 500 significant lines; this is 2 over it, 1.00\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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46a62b08deaff3dc758c8e91ec57e9e57e4066dfd1143dd3bc266f7eaa45574"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: host_callables/Program.cs: FileTooLong \u2014 501 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1 over it, 1.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdk_tests/crates/csharp/host_callables/Program.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d220867ddddf567f448e0460a83688dec8a2ce264f78927518e4bd0e5097e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 25 shared lines): baml_language/crates/baml_compiler2_mir/src/lower.rs:9090-9156 | baml_language/crates/baml_compiler2_mir/src/lower.rs:9172-9232 | baml_language/crates/baml_compiler2_mir/src/lower.rs:9234-9297 | baml_language/crates/baml_compiler2_mir/src/lower.rs:9322-9396 | baml_language/crates/baml_compiler2_mir/src/lower.rs:9444-9543 \u2014 These 5 members are variants of one another: a block of 25 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":9090}}}],"partialFingerprints":{"codehealthFindingId/v1":"92189406db2fc7f632cce6de53d6f52e7e23d41411f39eeb78dbc49a574b32e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 15 shared lines): engine/baml_cffi_macros/src/lib.rs:912-944 | engine/baml_cffi_macros/src/lib.rs:975-1007 | engine/baml_cffi_macros/src/lib.rs:1009-1041 | engine/baml_cffi_macros/src/lib.rs:1043-1092 | engine/baml_cffi_macros/src/lib.rs:1094-1126 \u2014 These 5 members are variants of one another: a block of 15 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a954d3bd30772dff13d37bb666b352eddb7eaa94484fe18135dd4c19c857af"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 23 shared lines): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1204-1330 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1336-1411 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1823-1984 | engine/language_server/src/baml_project/mod.rs:743-882 \u2014 These 4 members are variants of one another: a block of 23 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bdc23d3ab6df8486c50de30bd72fe72ca52485285254decc9dd0882b5e92c06"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 22 shared lines): engine/generators/languages/go/src/ir_to_go/mod.rs:18-200 | engine/generators/languages/go/src/ir_to_go/mod.rs:202-325 | engine/generators/languages/rust/src/ir_to_rust/mod.rs:28-218 | engine/generators/languages/rust/src/ir_to_rust/mod.rs:224-355 \u2014 These 4 members are variants of one another: a block of 22 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/go/src/ir_to_go/mod.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca314f1cb582a48961a75e68555fea6ec0c893bec7bb242417ff2bc264d51514"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 20 shared lines): baml_language/crates/baml_fmt/src/ast/attributes.rs:147-198 | baml_language/crates/baml_fmt/src/ast/declarations.rs:334-378 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1489-1536 | baml_language/crates/baml_fmt/src/ast/expressions.rs:2066-2111 \u2014 These 4 members are variants of one another: a block of 20 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/attributes.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdbb440a9269ec7bd7b16a765b064ea8c76b08005bc5970f700c51e332f44646"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 17 shared lines): baml_language/crates/baml_fmt/src/ast/attributes.rs:147-198 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1489-1536 | baml_language/crates/baml_fmt/src/ast/expressions.rs:2385-2442 | baml_language/crates/baml_fmt/src/ast/types.rs:490-556 \u2014 These 4 members are variants of one another: a block of 17 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/attributes.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e674fd97bd94a8ddca654ffe2edfcb5eaed02b9cae103e2b58543cd02673069a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (171 shared lines): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:186-374 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:214-401 \u2014 These two members are variants of one another: 171 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f680a8e9817e1fc53a1427bacfb6b4c34aa68765e999818e76c07dfcaefdabf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (95 shared lines): baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs:46-373 | engine/baml-lib/jsonish/src/deserializer/coercer/array_helper.rs:33-314 \u2014 These two members are variants of one another: 95 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"998648ce43d65a64c39e67822ee74118074ae04e624c88ef46408e48126a437f"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (89 shared lines): engine/baml-runtime/src/internal/llm_client/orchestrator/call.rs:61-190 | engine/baml-runtime/src/internal/llm_client/orchestrator/stream.rs:173-546 \u2014 These two members are variants of one another: 89 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/orchestrator/call.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc66fe478ba762cc8baca9eecd04c6c06828a10421461c89f09cc2b06c520a2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (88 shared lines): baml_language/crates/baml_compiler2_mir/src/lower.rs:4963-5298 | baml_language/crates/baml_compiler2_mir/src/lower.rs:5520-5806 \u2014 These two members are variants of one another: 88 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":4963}}}],"partialFingerprints":{"codehealthFindingId/v1":"632744fac54162850726901ef5d35696ce9ca17403d34024d402724d89fe6b10"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (79 shared lines): engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/functions.rs:12-149 | engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/template_strings.rs:9-119 \u2014 These two members are variants of one another: 79 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/functions.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7c6c87a2f7cd9b5b6823e5c3cf7ac342b27e4c3d5e66bdabeaa3bfc25231df"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (71 shared lines): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:383-487 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:410-517 \u2014 These two members are variants of one another: 71 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"553d1d1b307b2555e3cb4173ea8ec65cb80b626476e73de5066f6673389692fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (67 shared lines): engine/generators/languages/python/src/watchers.rs:147-241 | engine/generators/languages/typescript/src/watchers.rs:143-229 \u2014 These two members are variants of one another: 67 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/python/src/watchers.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fbe270d84ef492cae841ae2c72b7af8cb171bd5b2d568b324061e526defb82"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (62 shared lines): engine/baml-lib/jsonish/src/helpers/mod.rs:137-315 | engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs:246-530 \u2014 These two members are variants of one another: 62 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/helpers/mod.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11e70187c5a6ef074f33ad44dcc53bc8dbee4fa72f5eaa380d2b900e5d278de"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (60 shared lines): engine/baml-lib/baml-types/src/baml_value.rs:108-179 | engine/baml-lib/baml-types/src/baml_value.rs:905-978 \u2014 These two members are variants of one another: 60 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-types/src/baml_value.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"3769a49b0e8575638579999063dcacc1a239ddadcf1d4038b38597e55c67d9ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (58 shared lines): baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1551-1712 | baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1940-2089 \u2014 These two members are variants of one another: 58 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"369015740eb88f30e4fc548ba77b6725fff578dc294e0f6c09b9069e6a27e7f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (57 shared lines): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:6954-7213 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:10059-10230 \u2014 These two members are variants of one another: 57 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":6954}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ae51d656728a1d3562a81601785e570370785de04b07963f029033a31bc5cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (54 shared lines): baml_language/crates/bex_sap/src/jsonish/parser/entry.rs:16-225 | engine/baml-lib/jsonish/src/jsonish/parser/entry.rs:15-238 \u2014 These two members are variants of one another: 54 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/entry.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb09c2a62c45b550ac97fc90683041bf0734a2b8ea74629cc7aeda505f434db1"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (54 shared lines): engine/generators/languages/ruby/src/ir_to_rb/mod.rs:18-136 | engine/generators/languages/ruby/src/ir_to_rb/mod.rs:138-234 \u2014 These two members are variants of one another: 54 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/ruby/src/ir_to_rb/mod.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ca6fdd038b561b881d612b6bc2f117c803751f367e3efb3fa1b3a57e0b89d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (54 shared lines): baml_language/crates/baml_lsp_server/src/playground_server.rs:1484-1627 | baml_language/crates/baml_lsp_server/src/playground_server.rs:1636-1726 \u2014 These two members are variants of one another: 54 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":1484}}}],"partialFingerprints":{"codehealthFindingId/v1":"10af3c0f5698c02bc1a4c2b072baf5d3d8284a1d6b6a46453f35c015fd45e1a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (50 shared lines): baml_language/crates/bex_vm/src/debug.rs:560-654 | engine/baml-vm/src/debug.rs:263-360 \u2014 These two members are variants of one another: 50 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/debug.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"282a0d52adb953a0db5efba07349a70d0bfa5becd8196761823d8aa415cba1f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (49 shared lines): baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:3960-4079 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:4081-4214 \u2014 These two members are variants of one another: 49 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":3960}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0317d0caa19ff99e31a63fdf77280874cb8c4d918710d0992caef3054d1e3ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (44 shared lines): baml_language/crates/baml_type_macros/src/emit.rs:295-341 | baml_language/crates/baml_type_macros/src/emit.rs:776-822 \u2014 These two members are variants of one another: 44 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type_macros/src/emit.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"013d3772c952d2bfc3d31fcd47d9fd82fce8f0baf746c33004cef682200f6633"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (36 shared lines): baml_language/crates/baml_type/src/normalize/mu.rs:670-738 | baml_language/crates/baml_type/src/normalize/mu.rs:1400-1472 \u2014 These two members are variants of one another: 36 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/normalize/mu.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"122f597e278d98bba2ece278b41f6bf44b89525eca678690af01b16d33f5f879"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (36 shared lines): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:735-856 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:769-898 \u2014 These two members are variants of one another: 36 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9dde6c895a052d781a6484b6c470d7e8ee327c6c8b5516f2be262c0bdfa3aac"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (33 shared lines): baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:1144-1283 | baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:1292-1416 \u2014 These two members are variants of one another: 33 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7cc655637713a23e30f0416478293d1e281d8e1e2fc8c6be4e8b6ee9da5a1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (33 shared lines): engine/generators/languages/python/src/ir_to_py/mod.rs:17-133 | engine/generators/languages/python/src/ir_to_py/mod.rs:135-220 \u2014 These two members are variants of one another: 33 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/python/src/ir_to_py/mod.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75bcf4738e41c4a497b551cf28160e1ee9e49bc82db39d5b5a36243e07f7d5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (32 shared lines): engine/baml-runtime/src/internal/llm_client/primitive/google/response_handler.rs:27-106 | engine/baml-runtime/src/internal/llm_client/primitive/vertex/response_handler.rs:27-108 \u2014 These two members are variants of one another: 32 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/google/response_handler.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"96388b43b20e9396705ece376b75a8069f5431be044231e8007b205d01d61b1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (31 shared lines): baml_language/crates/baml_fmt/src/ast/expressions.rs:1436-1487 | baml_language/crates/baml_fmt/src/ast/expressions.rs:2559-2630 \u2014 These two members are variants of one another: 31 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f48f607614ea998c444683c778837f7f5630239b4d66ef651bd33104393fe8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (26 shared lines): baml_language/crates/baml_type_macros/src/emit.rs:572-600 | baml_language/crates/baml_type_macros/src/emit.rs:825-853 \u2014 These two members are variants of one another: 26 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type_macros/src/emit.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"9254ce6895c81a4f57f5b3ddf452e86a6451480c7f720577d89703c682aa6f1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (23 shared lines): baml_language/crates/baml_parser/src/items.rs:1275-1364 | baml_language/crates/baml_parser/src/items.rs:1413-1501 \u2014 These two members are variants of one another: 23 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"f910ab2ca8f4c7f140a5ebd8390eb6d7ce5e9059d0c31bf6b6a6e2a46253f9f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (21 shared lines): engine/baml-lib/jsonish/src/deserializer/coercer/coerce_primitive.rs:189-247 | engine/baml-lib/jsonish/src/deserializer/coercer/coerce_primitive.rs:285-341 \u2014 These two members are variants of one another: 21 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/deserializer/coercer/coerce_primitive.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da2c985d8ee2e72f572560154b1e2c0a79cc5e72fca06c3d2f47bae859b0844"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:126-163 | baml_language/crates/baml_type/src/unify.rs:287-344 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d86d532a77144d30324e5a9279b4c683ada09c874f5c6293d83838ccfb686d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:729-765 | baml_language/crates/baml_type/src/unify.rs:1258-1314 \u2014 These two members are one piece of code written twice and then edited apart: 34 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":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"2338a1b85d002620356a4c3a19f4d23ff3b0728fcd1291674fd6bc3582be6722"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs:816-880 | engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs:882-947 \u2014 These two members are one piece of code written twice and then edited apart: 61 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f957182af0a09065874d17b1739ad90fac3095358933f61198c43fb402eec4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): baml_language/crates/baml_compiler2_emit/src/refs.rs:210-236 | baml_language/crates/baml_compiler2_rust/src/coords.rs:28-52 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/refs.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1f021a739432823d8776404b1c516334c2dd8a4fd4e9ff1c9a39ea93f5feef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): baml_language/crates/bex_vm/src/package_reflect/reflect.rs:500-526 | baml_language/crates/bex_vm/src/type_context.rs:65-95 \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":"baml_language/crates/bex_vm/src/package_reflect/reflect.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fbd7f1db79d371829d5ffdd4bd7fd133bf70a7f1a1ca629dee8c646079d139"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): engine/baml-lib/ast/src/ast/expression.rs:369-379 | engine/baml-lib/ast/src/ast/expression.rs:381-390 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/expression.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf5c470d495a8ee67e6eeb8540a745d475aac3e52248f2244926efc98921137"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:302-376 | baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:378-413 | baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:415-444 | baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:453-497 | baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:516-551 | engine/baml-runtime/src/control_flow.rs:597-667 | engine/baml-runtime/src/control_flow.rs:669-703 | engine/baml-runtime/src/control_flow.rs:705-740 \u2014 These 8 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 8 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efdb3b9b2cf4788ce7d6093a5a66dcfd0a23c2daa582527be4c931ec6d01689"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): baml_language/crates/bex_events/src/run.rs:1074-1103 | baml_language/crates/bex_events/src/run.rs:1113-1137 | baml_language/crates/bex_events/src/run.rs:1149-1174 | baml_language/crates/bex_events/src/run.rs:1181-1204 | baml_language/crates/bex_events/src/run.rs:1211-1231 | baml_language/crates/bex_events/src/run.rs:1238-1262 | baml_language/crates/bex_events/src/run.rs:1271-1305 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_events/src/run.rs"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"379286350a01ff32cce00edb1272160ae3ab8a796af6bb1c80b28f2fe08422f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): languages/rust/baml/src/runtime.rs:82-135 | languages/rust/baml/src/runtime.rs:150-198 | languages/rust/baml/src/runtime.rs:205-257 | languages/rust/baml/src/runtime.rs:272-322 | languages/rust/baml/src/runtime.rs:344-404 | languages/rust/baml/src/runtime.rs:451-490 | languages/rust/baml/src/runtime.rs:497-536 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"languages/rust/baml/src/runtime.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68180c1613b89a38c45fcd0b7fad1c0ca92337ccdc78aa8d95e39c0c636c362"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:87-108 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:218-243 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:365-394 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:528-561 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:707-744 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:902-943 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:1113-1158 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85743780c24c23a08b473b242c8054a3d93745ea57a8dfe79422f71d46e996f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:114-137 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:249-277 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:400-433 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:567-605 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:750-793 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:949-997 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:1164-1217 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df9cf7696cdc8a87957e171001aa07b244de1be06486e6a606083b8126b6e6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1607-1624 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1627-1644 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1647-1664 | engine/language_server/src/baml_project/mod.rs:519-535 | engine/language_server/src/baml_project/mod.rs:537-553 | engine/language_server/src/baml_project/mod.rs:555-571 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"c350433fa83f64ef44c5aa04479e7db32fe1bd6348e2d50455fc7a4228983d4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): baml_language/crates/baml_compiler2_mir/src/lower.rs:7711-7736 | baml_language/crates/baml_compiler2_mir/src/lower.rs:7872-7916 | baml_language/crates/baml_compiler2_mir/src/lower.rs:7924-7964 | baml_language/crates/baml_compiler2_mir/src/lower.rs:8008-8048 | baml_language/crates/baml_compiler2_mir/src/lower.rs:8259-8299 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":7711}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e4b88b1e100bbd651253466b445ab9a41dce8c9fb35118795d9c1f02ee236d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): baml_language/crates/baml_lsp/src/dispatch/requests.rs:411-420 | baml_language/crates/baml_lsp/src/dispatch/requests.rs:589-602 | baml_language/crates/baml_lsp/src/dispatch/requests.rs:682-702 | baml_language/crates/baml_lsp/src/dispatch/requests.rs:784-801 | baml_language/crates/baml_lsp/src/dispatch/requests.rs:806-848 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp/src/dispatch/requests.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e21902c714c7c3107992f1b09dc3fcffc44079ba08263978a92c6f1648524d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): baml_language/crates/baml_type/src/normalize.rs:745-793 | baml_language/crates/baml_type/src/normalize.rs:881-924 | baml_language/crates/baml_type/src/normalize.rs:1445-1496 | baml_language/crates/baml_type/src/normalize.rs:2442-2497 | baml_language/crates/baml_type/src/normalize.rs:2611-2658 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/normalize.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"52fb2cbb78123a1a45e7d61064751a2f0374363bb8e565a47b5b4d46d8522e70"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): engine/baml-lib/llm-client/src/clients/helpers.rs:94-109 | engine/baml-lib/llm-client/src/clients/helpers.rs:115-130 | engine/baml-lib/llm-client/src/clients/helpers.rs:136-151 | engine/baml-lib/llm-client/src/clients/helpers.rs:153-168 | engine/baml-lib/llm-client/src/clients/helpers.rs:170-185 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/llm-client/src/clients/helpers.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b6f4ddac26454d11b46093a9ad265341d8601f3f661a270176ef59f887c847"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): engine/baml-runtime/src/internal/llm_client/primitive/anthropic/response_handler.rs:109-186 | engine/baml-runtime/src/internal/llm_client/primitive/google/response_handler.rs:131-183 | engine/baml-runtime/src/internal/llm_client/primitive/openai/response_handler.rs:391-431 | engine/baml-runtime/src/internal/llm_client/primitive/openai/response_handler.rs:442-485 | engine/baml-runtime/src/internal/llm_client/primitive/vertex/response_handler.rs:127-192 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/anthropic/response_handler.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c675f28d45ea4a6c9ed2f5348339c8b424d4488fc76f215a6aa93773f1029aa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2040-2322 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2446-2512 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2557-2622 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2635-2902 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2914-3106 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":2040}}}],"partialFingerprints":{"codehealthFindingId/v1":"058f54ce152248fe93fe3dc5c0c5d7b8141dd00896ade97e1dd6dd7d75e819bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): engine/generators/languages/go/src/ir_to_go/enums.rs:8-21 | engine/generators/languages/python/src/ir_to_py/enums.rs:5-17 | engine/generators/languages/ruby/src/ir_to_rb/enums.rs:5-17 | engine/generators/languages/rust/src/ir_to_rust/enums.rs:5-17 | engine/generators/languages/typescript/src/ir_to_ts/enums.rs:3-15 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/go/src/ir_to_go/enums.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fc1da1075519c12b473c9ea9a25957dbfe71523e35a264fdd76a6df25534df"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:317-324 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:477-485 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:653-662 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:845-855 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:1053-1064 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c6df2b4a9a9a46c6e786cbf869f75cbee6cb863ea3cb42eab53e9acfcbd013"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:326-333 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:487-495 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:664-673 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:857-867 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:1066-1077 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd14433d9b39c2ff5b72e90e544d2993a188c3ec504a53b8b418d1d0b477029a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:757-797 | baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:808-850 | baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:895-985 | baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:1006-1067 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d5d6484eb5b539e8a9061b20f344955a85922ff2f5b493dfc276e8d0d77e99"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs:791-853 | baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs:888-913 | baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs:931-999 | baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs:1202-1226 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"804a716707db1b308fa27160a5ee616e8e28b5fbefa68cfe8a5b913f6d59545a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): baml_language/crates/baml_fmt/src/ast/declarations.rs:441-476 | baml_language/crates/baml_fmt/src/ast/declarations.rs:573-599 | baml_language/crates/baml_fmt/src/ast/declarations.rs:858-905 | baml_language/crates/baml_fmt/src/ast/declarations.rs:959-991 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/declarations.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d24ecd76531c8b5012dd26a1ad9da160c348009dd51364b72e7fa27e598d81"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:120-217 | baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:308-398 | baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:445-519 | baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:557-629 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c437c398ab739a95bfe7e003b1d0b01bbf67cc5092c1825967c4820c4b228cd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): baml_language/crates/bex_vm/src/package_baml/array.rs:1123-1144 | baml_language/crates/bex_vm/src/package_baml/array.rs:1146-1167 | baml_language/crates/bex_vm/src/package_baml/array.rs:1169-1191 | baml_language/crates/bex_vm/src/package_baml/array.rs:1197-1219 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/array.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae2c8679445bb24cdaeaa05fee6c640c7b3d3a5ff48727bbfef2c323bae61d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): baml_language/crates/bex_vm/src/package_baml/csv.rs:2344-2373 | baml_language/crates/bex_vm/src/package_baml/csv.rs:2379-2406 | baml_language/crates/bex_vm/src/package_baml/csv.rs:2626-2647 | baml_language/crates/bex_vm/src/package_baml/csv.rs:2653-2677 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":2344}}}],"partialFingerprints":{"codehealthFindingId/v1":"c941ac580fab4d9297b9501359b5194948cdf00b9c72357e5795edc378e178e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): baml_language/crates/bex_vm/src/package_reflect/graft.rs:1165-1207 | baml_language/crates/bex_vm/src/package_reflect/graft.rs:1245-1364 | baml_language/crates/bex_vm_types/src/types/object.rs:208-237 | baml_language/crates/bex_vm_types/src/types/object.rs:241-271 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/graft.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc679222804be226cc587bd60c7d6b14863ec73801395872be87b3f1a4251a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:874-948 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:950-1031 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:4435-4525 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:4625-4748 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"b118eaebd13c50fe2f6aaf05afac84851468db0b63715407649ca50aee2a4889"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/baml-lib/ast/src/ast/field.rs:209-219 | engine/baml-lib/ast/src/ast/field.rs:221-231 | engine/baml-lib/ast/src/ast/field.rs:233-243 | engine/baml-lib/ast/src/ast/field.rs:245-258 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/field.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e2c360ff5f3300b069812a4cc210e6d70e83ad5fe3cb67839101cdc8f72b6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/baml-lib/llm-client/src/clients/anthropic.rs:85-97 | engine/baml-lib/llm-client/src/clients/aws_bedrock.rs:151-163 | engine/baml-lib/llm-client/src/clients/google_ai.rs:84-96 | engine/baml-lib/llm-client/src/clients/vertex.rs:224-236 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/llm-client/src/clients/anthropic.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"799aed0f1695207e383c5a8f9dc06ae94a08dd33311e772614f8bd637e02f27e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:133-175 | engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs:470-512 | engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs:165-208 | engine/baml-runtime/src/internal/llm_client/primitive/vertex/vertex_client.rs:189-232 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0134b4a8fe95f91ffb250bb2fe184c551d5e3c6cb0bf170306c7bcf676a4b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:177-219 | engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs:514-556 | engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs:121-163 | engine/baml-runtime/src/internal/llm_client/primitive/vertex/vertex_client.rs:145-187 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e3c22a759e0c3681bc1d2b0f10c8089c14341c387e4e17f6222fc14f9fb22a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/generators/languages/go/src/ir_to_go/classes.rs:8-25 | engine/generators/languages/go/src/ir_to_go/classes.rs:27-44 | engine/generators/languages/ruby/src/ir_to_rb/classes.rs:8-25 | engine/generators/languages/ruby/src/ir_to_rb/classes.rs:27-44 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/go/src/ir_to_go/classes.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2938c7600818bfc65ec0837d1f52b5b6384e8e359be5acf8584b0012874ec8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/generators/languages/go/src/ir_to_go/unions.rs:11-63 | engine/generators/languages/go/src/ir_to_go/unions.rs:68-126 | engine/generators/languages/rust/src/ir_to_rust/unions.rs:14-70 | engine/generators/languages/rust/src/ir_to_rust/unions.rs:111-176 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/go/src/ir_to_go/unions.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7c5ac1ec9b7ac73aa73482348a221220da1864e27148493375e71e8b149bf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/generators/languages/rust/src/ir_to_rust/classes.rs:15-35 | engine/generators/languages/rust/src/ir_to_rust/classes.rs:41-61 | engine/generators/languages/typescript/src/ir_to_ts/classes.rs:8-24 | engine/generators/languages/typescript/src/ir_to_ts/classes.rs:26-42 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/rust/src/ir_to_rust/classes.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a26fd083757698e0784c5bccf29f94d3cf24ae1902cdf01e0b83cb96ddcc03"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/language_client_cffi/src/ffi/functions.rs:78-134 | engine/language_client_cffi/src/ffi/functions.rs:142-227 | engine/language_client_cffi/src/ffi/functions.rs:253-321 | engine/language_client_cffi/src/ffi/functions.rs:357-424 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_cffi/src/ffi/functions.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1860981a4e3a596a9777bf0673467244c82021828662e8d12f7c303bc43feb"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): baml_language/sdks/go/baml_go/class.go:60-114 | baml_language/sdks/go/baml_go/container.go:139-152 | baml_language/sdks/go/baml_go/container.go:156-169 | baml_language/sdks/go/baml_go/dynamic.go:222-233 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/class.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3de4b3910c04eeac9cfb9e860e93b22ed71829ceade967e017ecd6f5cc4ccf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (127 corresponding lines): baml_language/crates/sys_ops/src/lib.rs:2978-3112 | baml_language/crates/sys_ops/src/lib.rs:3381-3507 \u2014 These two members are one piece of code written twice and then edited apart: 127 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":"baml_language/crates/sys_ops/src/lib.rs"},"region":{"startLine":2978}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac9ebae8aa7f9f4ecb7579317e5e7d4c82259f85b42c5be82537df36fde6500"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (230 corresponding lines): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:496-725 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:526-760 \u2014 These two members are one piece of code written twice and then edited apart: 230 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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ac2872557c7be1daa20abd22487b8692f20c86982c3a1fa1c1e3c5f9e8ca27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (113 corresponding lines): engine/baml-lib/baml-types/src/expr.rs:628-740 | engine/baml-lib/baml-types/src/expr.rs:744-858 \u2014 These two members are one piece of code written twice and then edited apart: 113 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":"engine/baml-lib/baml-types/src/expr.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"03249a94c1d60e892cda35813813c48bc05b1bc9edfb74edc4e4531bf370a47c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (123 corresponding lines): baml_language/crates/baml_type/src/normalize.rs:1309-1431 | baml_language/crates/baml_type/src/normalize.rs:3062-3213 \u2014 These two members are one piece of code written twice and then edited apart: 123 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":"baml_language/crates/baml_type/src/normalize.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"d244e28574382ed968c745e40a6846e21f53b53ba602652f050ef689ed6dc6d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (145 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:255-399 | baml_language/crates/baml_type/src/unify.rs:556-740 \u2014 These two members are one piece of code written twice and then edited apart: 145 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":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"0623e498523957904df8eaef41307ff83ea014b4f0c9a1932cc1c78582f9b552"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (132 corresponding lines): baml_language/crates/baml_compiler2_ast/src/ast.rs:265-396 | baml_language/crates/baml_compiler2_hir/src/type_ref.rs:168-303 \u2014 These two members are one piece of code written twice and then edited apart: 132 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":"baml_language/crates/baml_compiler2_ast/src/ast.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"6828923652b3828b73a38193a38a25abd93641d0af033884a2a40f84ca7f370a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (134 corresponding lines): baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs:142-280 | engine/baml-lib/jsonish/src/deserializer/deserialize_flags.rs:157-290 \u2014 These two members are one piece of code written twice and then edited apart: 134 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":"baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8afd40c9dd9a53e9e48259cb0fd822fedb53e55cafb1c4324ff1f4770d70fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 78\u002B corresponding lines): engine/baml-lib/baml-types/src/baml_value.rs:534-611 | engine/baml-lib/baml-types/src/baml_value.rs:671-750 | engine/baml-lib/baml-types/src/baml_value.rs:808-886 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 78 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":"engine/baml-lib/baml-types/src/baml_value.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fe086291f27bb31bfa0f8c1745651f24ef02b94da12c424869da5fdcaaf919"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (130 corresponding lines): baml_language/crates/bridge_wasm/src/runs.rs:666-795 | baml_language/crates/bridge_wasm/src/runs.rs:807-937 \u2014 These two members are one piece of code written twice and then edited apart: 130 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":"baml_language/crates/bridge_wasm/src/runs.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"080e61248085859dc2ebf9acd3a2ba9efaf95b18b54990c50a71c6317f22d0b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (96 corresponding lines): baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:2621-2716 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:3216-3319 \u2014 These two members are one piece of code written twice and then edited apart: 96 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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":2621}}}],"partialFingerprints":{"codehealthFindingId/v1":"2701d99bc7d9fe277678e43068f9b29975e0c8d17e58dbe0523dc042a690861a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (102 corresponding lines): baml_language/crates/bex_vm/src/vm.rs:5412-5536 | baml_language/crates/bex_vm/src/vm.rs:5546-5647 \u2014 These two members are one piece of code written twice and then edited apart: 102 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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":5412}}}],"partialFingerprints":{"codehealthFindingId/v1":"abaf40557727ca2513952da4bb0f677c2b81f3a7113c0fa31efffb0403f052cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (108 corresponding lines): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/emit/mod.rs:66-203 | baml_language/sdks/typescript/sdkgen_typescript_shared/src/emit/mod.rs:48-155 \u2014 These two members are one piece of code written twice and then edited apart: 108 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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/emit/mod.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf764593e0b76b88b53c93d6e0d1017e7ca1634d33840b73b9f8fb4d37a74af5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (132 corresponding lines): baml_language/crates/bex_sap/src/deserializer/coercer/match_string.rs:214-354 | engine/baml-lib/jsonish/src/deserializer/coercer/match_string.rs:197-328 \u2014 These two members are one piece of code written twice and then edited apart: 132 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":"baml_language/crates/bex_sap/src/deserializer/coercer/match_string.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eedb95afdb5b172f2e797bf882be1bb9494e915d26cec0b8f526e3a36d96981"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (69 corresponding lines): baml_language/crates/bridge_ctypes/src/wire_depth.rs:101-169 | baml_language/sdks/rust/bridge_rust/src/encode.rs:459-528 \u2014 These two members are one piece of code written twice and then edited apart: 69 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":"baml_language/crates/bridge_ctypes/src/wire_depth.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2baea3dffca4049b94f60019391e3a9e4271f1966d9ea99ba855893c872ba30c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (86 corresponding lines): baml_language/crates/baml_type/src/normalize.rs:1506-1592 | baml_language/crates/baml_type/src/normalize.rs:2191-2276 \u2014 These two members are one piece of code written twice and then edited apart: 86 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":"baml_language/crates/baml_type/src/normalize.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"c215cde6c6451f33e792e301d71e124b8cf10d1c0326f20c4b83b46b3b620385"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): baml_language/crates/sys_ops/src/lib.rs:3167-3253 | baml_language/crates/sys_ops/src/lib.rs:3297-3367 \u2014 These two members are one piece of code written twice and then edited apart: 71 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":"baml_language/crates/sys_ops/src/lib.rs"},"region":{"startLine":3167}}}],"partialFingerprints":{"codehealthFindingId/v1":"619fb2a78695393227f0949132d2e3ec0ff00b8780944d15aad03861238d484d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (80 corresponding lines): engine/generators/languages/typescript/src/ir_to_ts/mod.rs:18-116 | engine/generators/languages/typescript/src/ir_to_ts/mod.rs:118-197 \u2014 These two members are one piece of code written twice and then edited apart: 80 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":"engine/generators/languages/typescript/src/ir_to_ts/mod.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"694583027964042ae476ec93e7b358db591a9878fea732c4ceef57e0ff65f178"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (92 corresponding lines): baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:418-512 | engine/baml-runtime/src/control_flow/flatten/step2_hoist_branch_arms.rs:7-98 \u2014 These two members are one piece of code written twice and then edited apart: 92 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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"264bc370624a453985b860b34e9975c70a30d4fcb60d6aa5e84f63d55b13aa5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (108 corresponding lines): baml_language/crates/baml_lsp_server/src/playground_server.rs:483-592 | baml_language/crates/bridge_wasm/src/runs.rs:430-537 \u2014 These two members are one piece of code written twice and then edited apart: 108 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":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a680e04bf4a08000f4f61dac5c845a6ec98f7ec5d0165c1b995bc649523430c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (101 corresponding lines): baml_language/crates/bex_sap/src/jsonish/parser/markdown_parser.rs:27-127 | engine/baml-lib/jsonish/src/jsonish/parser/markdown_parser.rs:29-135 \u2014 These two members are one piece of code written twice and then edited apart: 101 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":"baml_language/crates/bex_sap/src/jsonish/parser/markdown_parser.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"078677fbea3720aea5ee347e22d273a6982bf2d98d075b10aa02201432e9737a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:625-685 | baml_language/crates/baml_type/src/unify.rs:1151-1212 \u2014 These two members are one piece of code written twice and then edited apart: 61 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"5946fbc1dae1a072bb01512f82528655b9e4171f9b397708afda2b1041a22efe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): engine/generators/languages/python/src/watchers.rs:74-140 | engine/generators/languages/typescript/src/watchers.rs:73-136 \u2014 These two members are one piece of code written twice and then edited apart: 64 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":"engine/generators/languages/python/src/watchers.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d3c5be4e00a02e879f583a18a643b8341636c9665b01fc4bf2dc3c49fcd0e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:768-825 | baml_language/crates/baml_type_runtime/src/lib.rs:840-905 \u2014 These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"8207a3ceb159ab04932d7338ef83cad2af39634675e75e81d50c82f784d03299"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (73 corresponding lines): baml_language/sdks/go/sdkgen_go/src/lib.rs:2610-2682 | baml_language/sdks/go/sdkgen_go/src/lib.rs:2778-2860 \u2014 These two members are one piece of code written twice and then edited apart: 73 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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":2610}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2d80bba3bafd10a5249688dbdf3f47c83391f8c1204448a3abc30f450bd138"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (68 corresponding lines): baml_language/crates/bridge_wasm/src/wasm_env.rs:68-136 | baml_language/crates/bridge_wasm/src/wasm_io.rs:89-156 \u2014 These two members are one piece of code written twice and then edited apart: 68 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":"baml_language/crates/bridge_wasm/src/wasm_env.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"644e59bc1656bed0a3bdef8557e35c47242bb2968483a58fe0355b2c4367c3bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): baml_language/crates/baml_builtins2_codegen/src/codegen_errors.rs:36-99 | baml_language/crates/baml_builtins2_codegen/src/codegen_panics.rs:35-98 \u2014 These two members are one piece of code written twice and then edited apart: 64 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":"baml_language/crates/baml_builtins2_codegen/src/codegen_errors.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"988c6159299468f13fa3b546553e9a464ce760c5f547c4846ac7e821d204c9c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): baml_language/crates/baml_fmt/src/ast/pattern.rs:165-216 | baml_language/crates/baml_fmt/src/ast/pattern.rs:332-375 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/pattern.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff46b4e6f9df851d8dfcb6fa0aff74942a8c18e62388068cfaa43f835fc96cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): baml_language/crates/baml_type_macros/src/emit.rs:605-666 | baml_language/crates/baml_type_macros/src/emit.rs:903-943 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type_macros/src/emit.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"92bd40062beeb3f50396bd5e62bfa1ca844a01fec2fa7b5c6ebd06394ee15df7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): baml_language/crates/baml_linker/src/assemble.rs:204-290 | baml_language/crates/bex_vm/src/package_reflect/graft.rs:1404-1465 \u2014 These two members are one piece of code written twice and then edited apart: 62 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":"baml_language/crates/baml_linker/src/assemble.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"70dc59666a6e1527878a980a56335b87b99b9615f5c05627e9d07357b0d97ab1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:1030-1064 | baml_language/crates/baml_compiler2_hir_ty/src/interfaces/coherence.rs:247-291 \u2014 These two members are one piece of code written twice and then edited apart: 35 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":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb4a3be59cda85be39871115b8284c6e23cca4506521a94d3cc96b6b6d269b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/emit/typemap_file.rs:38-108 | baml_language/sdks/typescript/sdkgen_typescript_shared/src/emit/typemap_file.rs:29-99 \u2014 These two members are one piece of code written twice and then edited apart: 71 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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/emit/typemap_file.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f0cd34f9ab5ae13b73399cdbfd16f06ec7edaeaa39022d4117e72f1e449177"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (76 corresponding lines): engine/baml-compiler/src/viz_builder.rs:213-288 | engine/baml-runtime/src/control_flow.rs:492-569 \u2014 These two members are one piece of code written twice and then edited apart: 76 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":"engine/baml-compiler/src/viz_builder.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5dcf16f11c80c15a47d008d1180e927e3381d734565ba981b2349e84ac729c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (88 corresponding lines): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser.rs:11-101 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser.rs:11-98 \u2014 These two members are one piece of code written twice and then edited apart: 88 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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba908cc84aed099fd96abd2b6eab4a4b73223431cd06da87a2c151d3ba6e007"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): baml_language/crates/baml_compiler2_hir/src/resolve.rs:160-219 | baml_language/crates/baml_compiler2_hir/src/resolve.rs:249-308 \u2014 These two members are one piece of code written twice and then edited apart: 60 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir/src/resolve.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"07170c2618e93609de83c32c2aae6adf42981e619adaa14cb54ca917e4f69af6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): baml_language/crates/baml_type/src/template.rs:206-276 | baml_language/crates/baml_type/src/template.rs:281-343 \u2014 These two members are one piece of code written twice and then edited apart: 63 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":"baml_language/crates/baml_type/src/template.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"de11b9a806004cb152cc8345292def455e63accc3000bfd000a9a1bdf834e5f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (77 corresponding lines): baml_language/crates/baml_builtins2_codegen/src/codegen.rs:871-966 | baml_language/crates/baml_builtins2_codegen/src/codegen.rs:972-1048 \u2014 These two members are one piece of code written twice and then edited apart: 77 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_builtins2_codegen/src/codegen.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2c3e76b723a524307883e45d84b15877512ccc60cf30e5c848fb96056e996d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:1673-1747 | baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:1761-1831 \u2014 These two members are one piece of code written twice and then edited apart: 71 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":"baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"7508a8811b613cd854765b49b02414a7976dc4c303e89e79c46b86424d6729c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): engine/baml-runtime/src/tracingv2/publisher/rpc_converters/types.rs:19-64 | engine/baml-runtime/src/tracingv2/publisher/rpc_converters/types.rs:69-137 \u2014 These two members are one piece of code written twice and then edited apart: 46 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":"engine/baml-runtime/src/tracingv2/publisher/rpc_converters/types.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d6bf80cf51bac0a890978dc1d10f3564ef72a03372578a182152456631180f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): engine/generators/languages/go/src/type.rs:86-123 | engine/generators/languages/rust/src/type.rs:91-130 \u2014 These two members are one piece of code written twice and then edited apart: 38 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":"engine/generators/languages/go/src/type.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e5c12b85e0214cbd81530b2bb81f12f76c017f458d06a208ff9a329276409d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): engine/baml-runtime/src/internal/llm_client/orchestrator/mod.rs:203-262 | engine/baml-runtime/src/internal/llm_client/orchestrator/mod.rs:266-327 \u2014 These two members are one piece of code written twice and then edited apart: 60 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/orchestrator/mod.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd214d2631aae7ef9d09cdd089def1dd7558ccd893ca1178dbd904a4d82642b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:248-288 | baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:636-676 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a6b9aa5f85f29339004fafbb1eca465404b49a1a701b43e14b79f673b009e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): baml_language/crates/baml_parser/src/expr.rs:947-1010 | baml_language/crates/baml_parser/src/expr.rs:1060-1118 \u2014 These two members are one piece of code written twice and then edited apart: 59 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":"baml_language/crates/baml_parser/src/expr.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aaa7b1ae293f0c3f703446ae1b2b192d264d2ed6bd5862f723cb12b91744c8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs:118-170 | engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs:178-230 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b340cac1c46fc98b528f215efa799a14ce700cd86a7f90d4bde740eb95bee6fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): baml_language/crates/baml_cli/src/pack_command.rs:551-614 | baml_language/crates/baml_cli/src/run_command.rs:896-977 \u2014 These two members are one piece of code written twice and then edited apart: 64 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":"baml_language/crates/baml_cli/src/pack_command.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52138c45e67de79b7f31a027e81ebd0b1a85b0aba2a3c671c62044a10bc29cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (72 corresponding lines): baml_language/crates/bex_sap/src/jsonish/parser/multi_json_parser.rs:7-78 | engine/baml-lib/jsonish/src/jsonish/parser/multi_json_parser.rs:6-84 \u2014 These two members are one piece of code written twice and then edited apart: 72 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":"baml_language/crates/bex_sap/src/jsonish/parser/multi_json_parser.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1706945690ed4013d74fce98807d1a424bb0d81555caab235da30504ff83f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): baml_language/crates/bex_sap/src/deserializer/score.rs:13-60 | engine/baml-lib/jsonish/src/deserializer/score.rs:35-76 \u2014 These two members are one piece of code written twice and then edited apart: 42 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":"baml_language/crates/bex_sap/src/deserializer/score.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ae5d2dadc58116d3eebf47f185a2be67ae38a87a086a4a23f4867ca47e221b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): baml_language/crates/baml_type_macros/src/convert.rs:847-881 | baml_language/crates/baml_type_macros/src/convert.rs:884-919 \u2014 These two members are one piece of code written twice and then edited apart: 35 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":"baml_language/crates/baml_type_macros/src/convert.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f729084fb3d25f46f49d57077e5f38826057eb519447ad918f0913096cf79a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 57\u002B corresponding lines): baml_language/crates/baml_compiler2_mir/src/memory.rs:133-189 | baml_language/crates/baml_compiler2_mir/src/optimize.rs:672-730 | baml_language/crates/baml_compiler2_mir/src/optimize.rs:1080-1138 | baml_language/crates/baml_compiler2_mir/src/optimize.rs:1407-1465 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 57 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":"baml_language/crates/baml_compiler2_mir/src/memory.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"86693fec9d48c8301a0dd05c6952af957318d6f5be979cf1a9dc1f10d5b7807f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): baml_language/crates/baml_type/src/decl_cycles.rs:263-324 | engine/baml-lib/parser-database/src/tarjan.rs:114-212 \u2014 These two members are one piece of code written twice and then edited apart: 62 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":"baml_language/crates/baml_type/src/decl_cycles.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"7595e7c653998e31e205c0a2029c131ab12267be88177a2bab54d7a251aa72cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): baml_language/crates/bex_sap/src/jsonish/value.rs:112-157 | engine/baml-lib/jsonish/src/jsonish/value.rs:104-147 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/value.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce74640960e2012c7a7f663c588702d6e4da51e36be583785373d72f61c8e28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (86 corresponding lines): baml_language/crates/baml_compiler2_mir/src/optimize.rs:763-855 | baml_language/crates/baml_compiler2_mir/src/optimize.rs:1490-1575 \u2014 These two members are one piece of code written twice and then edited apart: 86 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":"baml_language/crates/baml_compiler2_mir/src/optimize.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd7174186220554b1e6de74b54dceb04dbd8f25f76754bc3cabaf3c46d85031"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): engine/generators/languages/go/src/type.rs:241-284 | engine/generators/languages/rust/src/type.rs:216-262 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/go/src/type.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc9e642fe0a7e1d4d60a726bbab2559d5d2c130a121f66d542330ceeed672cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): baml_language/crates/baml_fmt/src/ast/pattern.rs:474-519 | baml_language/crates/baml_fmt/src/ast/types.rs:187-232 \u2014 These two members are one piece of code written twice and then edited apart: 46 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":"baml_language/crates/baml_fmt/src/ast/pattern.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"652915ffbb3823bc3d7113849c2287aa0795312c74ac4bed09dd5e0397fd2068"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): baml_language/crates/baml_lsp_server/src/playground_seam.rs:1059-1096 | baml_language/crates/bridge_wasm/src/playground.rs:559-595 \u2014 These two members are one piece of code written twice and then edited apart: 37 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":"baml_language/crates/baml_lsp_server/src/playground_seam.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"153ac0d0f7834db9a976855805c4e6fed1eed155b1b746456a3f7726fb57a3aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): engine/baml-lib/baml-types/src/baml_value.rs:1166-1190 | engine/baml-lib/baml-types/src/baml_value.rs:1195-1221 \u2014 These two members are one piece of code written twice and then edited apart: 25 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":"engine/baml-lib/baml-types/src/baml_value.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62006fd25f6afd422270a9f5b8eaf6bfae747883e94faea10f68d6abcbf8bf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): baml_language/crates/tools_size_gate/src/output.rs:106-169 | baml_language/crates/tools_size_gate/src/output.rs:177-237 \u2014 These two members are one piece of code written twice and then edited apart: 61 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/tools_size_gate/src/output.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d957cecaa9df4d144f58c9e5db30c24a927af2422de83ee20e11954ec9e68afa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): baml_language/crates/baml_fmt/src/ast/pattern.rs:219-257 | baml_language/crates/baml_fmt/src/ast/pattern.rs:378-417 \u2014 These two members are one piece of code written twice and then edited apart: 39 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":"baml_language/crates/baml_fmt/src/ast/pattern.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ac64fe34574cbc08e2e8b87881fad6d203e305bb8317869bcc3eff42c93d35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): engine/generators/languages/go/src/type.rs:125-171 | engine/generators/languages/go/src/type.rs:173-210 \u2014 These two members are one piece of code written twice and then edited apart: 38 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":"engine/generators/languages/go/src/type.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"04388fb2b3aec18d5a49d0651845ae5ebbc2197071cd7f4da0a1503f8dcbd2dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): baml_language/crates/baml_query_btel/src/ingest/bulk.rs:1499-1536 | baml_language/crates/baml_query_btel/src/ingest/bulk.rs:1662-1691 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/ingest/bulk.rs"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ec5dea2da530bca4621a1a8390e822933132f99b4e28d8479a97b052c47e2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): engine/baml-lib/jsonish/src/deserializer/types.rs:192-226 | engine/baml-lib/jsonish/src/deserializer/types.rs:230-265 \u2014 These two members are one piece of code written twice and then edited apart: 35 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":"engine/baml-lib/jsonish/src/deserializer/types.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d782dd0164311cc12a47eb05eed1357798ec810dd061d61ee64bcb9355fb88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): engine/baml-runtime/src/internal/llm_client/primitive/mod.rs:119-185 | engine/baml-runtime/src/internal/llm_client/primitive/mod.rs:191-233 \u2014 These two members are one piece of code written twice and then edited apart: 43 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":"engine/baml-runtime/src/internal/llm_client/primitive/mod.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb3c9e71ea850b4e6fd951d728e56ba02d7db2dfac789fc8702554b0448befb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): baml_language/crates/baml_ide/src/rename.rs:425-478 | baml_language/crates/baml_ide/src/rename.rs:491-540 \u2014 These two members are one piece of code written twice and then edited apart: 50 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":"baml_language/crates/baml_ide/src/rename.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b3b44d7ac46c5fd69d412614c6172f2d0163f4655dc44abb93e9b18698ba25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): engine/baml-lib/jsonish/src/helpers/mod.rs:324-358 | engine/baml-runtime/src/internal/llm_client/mod.rs:37-71 \u2014 These two members are one piece of code written twice and then edited apart: 35 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":"engine/baml-lib/jsonish/src/helpers/mod.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3cbff6210fb31be292ebf98f86e713d03615b471545b727d6a49d36328a03e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): baml_language/crates/baml_ide/src/describe.rs:2102-2150 | baml_language/crates/baml_ide/src/describe.rs:2164-2212 \u2014 These two members are one piece of code written twice and then edited apart: 49 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":"baml_language/crates/baml_ide/src/describe.rs"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c702d6043d5694b8a900c5593982a768f16358bc1dc9e2721cda65ee725c5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 44\u002B corresponding lines): engine/baml-lib/baml-types/src/baml_value.rs:488-531 | engine/baml-lib/baml-types/src/baml_value.rs:624-668 | engine/baml-lib/baml-types/src/baml_value.rs:761-805 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 44 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":"engine/baml-lib/baml-types/src/baml_value.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4fe6d512fa100232196be3b5dad0d11fef74a96b40af25ffa6852c5a61a32af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): baml_language/sdks/go/baml_go/runtime.go:385-441 | baml_language/sdks/go/baml_go/runtime.go:443-493 \u2014 These two members are one piece of code written twice and then edited apart: 51 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":"baml_language/sdks/go/baml_go/runtime.go"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"28606cc52bc5083844b340d7e76cce45e38461eb23abd6f1c392299c7dd862ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): baml_language/crates/baml_fmt/src/ast/expressions.rs:2291-2326 | baml_language/crates/baml_fmt/src/ast/expressions.rs:2507-2552 \u2014 These two members are one piece of code written twice and then edited apart: 36 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":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":2291}}}],"partialFingerprints":{"codehealthFindingId/v1":"d873257e76f6ddd5f066d937d0e947ce99dbc277ee1b106696152f4e3598e835"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): baml_language/crates/bex_events/src/run.rs:1328-1369 | baml_language/crates/bex_events/src/run.rs:1393-1450 \u2014 These two members are one piece of code written twice and then edited apart: 42 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":"baml_language/crates/bex_events/src/run.rs"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91d295fc2726bc14a1fbf1d8e9941c215ff081ccf46a767e5cb7ced6f9516cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): engine/baml-lib/jsonish/src/deserializer/types.rs:499-518 | engine/baml-lib/jsonish/src/deserializer/types.rs:522-544 \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":"engine/baml-lib/jsonish/src/deserializer/types.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"50abe4db46fe2c0b9765da16822563b826a5bbbb91b7fefbb5e63da26bd4de89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): baml_language/crates/sys_native/src/io_impls.rs:1651-1690 | baml_language/crates/sys_native/src/io_impls.rs:2395-2431 \u2014 These two members are one piece of code written twice and then edited apart: 37 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":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":1651}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c06e2d3d3e8f18068d8da49be4400d8fa902c7c5ace436763173429b857060"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): engine/baml-rpc/src/runtime_api/baml_value.rs:34-70 | engine/baml-rpc/src/runtime_api/baml_value.rs:120-155 \u2014 These two members are one piece of code written twice and then edited apart: 36 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":"engine/baml-rpc/src/runtime_api/baml_value.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"0978cf6f65d4cb34b85e6ade87886d605a1742e86a80b34f2767adbcd69b46b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): engine/baml-lib/jsonish/src/deserializer/coercer/coerce_array.rs:34-96 | engine/baml-lib/jsonish/src/deserializer/coercer/coerce_map.rs:19-82 \u2014 These two members are one piece of code written twice and then edited apart: 63 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":"engine/baml-lib/jsonish/src/deserializer/coercer/coerce_array.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"21418fb11b5e4f9fc87a61f716c11158436e8b82755bb234402d48db6aedc3fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): baml_language/crates/baml_fmt/src/ast/attributes.rs:102-138 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1392-1425 \u2014 These two members are one piece of code written twice and then edited apart: 34 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":"baml_language/crates/baml_fmt/src/ast/attributes.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"73feb69ca5a31039ad1a2c07ec71bbe80a7e8ca782b3c3d7c24cf2837b3ece64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): baml_language/crates/baml_fmt/src/ast/pattern.rs:522-550 | baml_language/crates/baml_fmt/src/ast/types.rs:137-180 \u2014 These two members are one piece of code written twice and then edited apart: 29 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":"baml_language/crates/baml_fmt/src/ast/pattern.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"210b1a99bc01d3a3d123f4bd5b542bf39f267959d6cc5873b355c03eac09bd6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:1082-1121 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:3072-3118 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ee131339952e53af6412e2dd8601550a3d9b0081efcf455e742dbdfac2734b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): baml_language/sdks/typescript/sdkgen_typescript_shared/src/leaf.rs:258-294 | baml_language/sdks/typescript/sdkgen_typescript_shared/src/leaf.rs:296-332 \u2014 These two members are one piece of code written twice and then edited apart: 37 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":"baml_language/sdks/typescript/sdkgen_typescript_shared/src/leaf.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"80787c5aa40dbb00da7e8f1c178793efb6fca120559d1dca7de0f10c74bcb851"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): engine/baml-compiler/src/thir/interpret.rs:403-432 | engine/baml-runtime/src/async_interpreter_runtime.rs:848-881 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"b701898d47e25a3e04114dda5750cb9cf486e470975e1ab6a53a853febac58a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): baml_language/crates/baml_lsp_server/src/playground_http.rs:77-120 | baml_language/crates/baml_lsp_server/src/playground_http.rs:128-171 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/playground_http.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee98c0331408f81c3dad7b24ae4f90f948d5413ff7307826c5e70e6035e5176"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): baml_language/crates/bridge_wasm/src/wasm_http.rs:241-282 | baml_language/crates/bridge_wasm/src/wasm_http.rs:290-335 \u2014 These two members are one piece of code written twice and then edited apart: 42 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":"baml_language/crates/bridge_wasm/src/wasm_http.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"977bf2d4a3de3aa2c9b53c0346a3fc764a48213563b8bdbf2a921c0723232b81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): baml_language/crates/bridge_encode/src/plan.rs:983-1017 | baml_language/crates/bridge_encode/src/plan.rs:1025-1066 \u2014 These two members are one piece of code written twice and then edited apart: 35 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":"baml_language/crates/bridge_encode/src/plan.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d3cb442c845833d0b62e27cf1b130db31169984b54433202606dcb563e6da7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): engine/baml-compiler/src/thir.rs:450-495 | engine/baml-lib/baml-types/src/expr.rs:490-536 \u2014 These two members are one piece of code written twice and then edited apart: 46 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":"engine/baml-compiler/src/thir.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9055c01f6a4ac04416a1ebfe02b9e887cf7885cf0d0008b5a1cb06dbc8aa258"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): baml_language/crates/baml_compiler2_hir/src/signature.rs:160-188 | baml_language/crates/baml_compiler2_hir/src/signature.rs:326-366 \u2014 These two members are one piece of code written twice and then edited apart: 29 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":"baml_language/crates/baml_compiler2_hir/src/signature.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a44b4ffc4e68f8d582dd39b149da6bf7f60af956698113af443f8ad88b4821c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): baml_language/crates/baml_fmt/src/ast/declarations.rs:291-327 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1988-2018 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/declarations.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc94dee9f67f6031433cc77b003cac1c543e3c986f644cfdb2f0f52cf3e74f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): engine/baml-compiler/src/thir/interpret.rs:1581-1612 | engine/baml-runtime/src/async_interpreter_runtime.rs:886-917 \u2014 These two members are one piece of code written twice and then edited apart: 32 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":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"e778c1d0f1087e2e5161fdc9cd4f52d07b4878f83dc8b255fa8ac9f68570f6e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): baml_language/sdks/go/baml_go/media.go:98-145 | baml_language/sdks/go/baml_go/media.go:152-196 \u2014 These two members are one piece of code written twice and then edited apart: 45 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":"baml_language/sdks/go/baml_go/media.go"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7b8d3f20dd436c05db271b3f3bc9551e0b37e4b26b4c0fab15ba0800b2a4f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:1080-1122 | baml_language/crates/baml_compiler2_hir_ty/src/interfaces/coherence.rs:311-358 \u2014 These two members are one piece of code written twice and then edited apart: 43 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":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cd3af65d88667cc429e29c672be87b34eb29f1446c6d133c2795dfc28fd4bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): baml_language/crates/bex_vm_types/src/prompt.rs:40-92 | baml_language/crates/bex_vm_types/src/prompt.rs:175-217 \u2014 These two members are one piece of code written twice and then edited apart: 43 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":"baml_language/crates/bex_vm_types/src/prompt.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a59f21d4a8404b99598b60fedd84a0d25cfdba3f418e4a3ce5645efc3470944"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): baml_language/crates/bridge_ctypes/src/wire_depth.rs:46-96 | baml_language/sdks/rust/bridge_rust/src/encode.rs:401-437 \u2014 These two members are one piece of code written twice and then edited apart: 37 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":"baml_language/crates/bridge_ctypes/src/wire_depth.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a52889c4635d0891c47b7678983313405a6fa626b64f819133d0f2803e0fc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): baml_language/crates/baml_cli/src/paint.rs:31-57 | baml_language/crates/baml_compiler_diagnostics/src/render.rs:1055-1083 \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":"baml_language/crates/baml_cli/src/paint.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f42ff66b2c41df548f7be7f96a6ea6d33b3d211d3de818dbdaf57dcc584082"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): engine/language_client_ruby/ext/ruby_ffi/src/lib.rs:120-158 | engine/language_client_ruby/ext/ruby_ffi/src/lib.rs:170-210 \u2014 These two members are one piece of code written twice and then edited apart: 39 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":"engine/language_client_ruby/ext/ruby_ffi/src/lib.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5490ea76cf1cb892fc9897651d2197bf3b84b53396eefdf720e8869bd1f36280"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:91-130 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:95-135 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"0081834e62b28b4540f81e6298c75253de4b582f099b2d308e7e3e6e90c04fcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): baml_language/crates/baml_fmt/src/ast/statements.rs:163-189 | baml_language/crates/baml_fmt/src/ast/statements.rs:198-231 \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":"baml_language/crates/baml_fmt/src/ast/statements.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa9ada8be74fbf038130bc5ee961fa5d130fabbd741f74e7a4103971fe3f1ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): baml_language/crates/baml_lsp_server/src/playground_env.rs:112-154 | baml_language/crates/baml_lsp_server/src/playground_io.rs:89-134 \u2014 These two members are one piece of code written twice and then edited apart: 43 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":"baml_language/crates/baml_lsp_server/src/playground_env.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8feb0c70a72699b03ff283e65da8be5f56ccf633ea4c876d477c6af94db87b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): engine/baml-lib/baml-types/src/baml_value.rs:986-1005 | engine/baml-lib/baml-types/src/baml_value.rs:1007-1031 | engine/baml-lib/baml-types/src/baml_value.rs:1382-1401 | engine/baml-lib/baml-types/src/baml_value.rs:1405-1422 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-types/src/baml_value.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf5aef167db9f64bd31eb6988b682ec8d6eae9f2e097765de5079845c17ade9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): baml_language/crates/baml_query_btel/src/ingest.rs:1407-1465 | baml_language/crates/baml_query_btel/src/ingest.rs:1746-1811 \u2014 These two members are one piece of code written twice and then edited apart: 59 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":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45382fff048533eaafed2aed806e5bf6716f4e1a2fa9a44c9aec24bdea8ddfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): baml_language/crates/baml_sdkgen_types/src/type_queries.rs:34-64 | baml_language/sdks/go/sdkgen_go/src/lib.rs:122-157 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_sdkgen_types/src/type_queries.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6712e2afc36afe2b7b784acec8685663bc32749c6fc0376deb830c528002dd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): baml_language/sdks/go/baml_go/container.go:13-43 | baml_language/sdks/go/baml_go/container.go:93-126 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/container.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4707aef05e5e82d7001c1c66ec5fa58f51560921f152222a6d8f5b7698f6a22"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): baml_language/crates/baml_compiler2_ast/src/traverse.rs:240-283 | baml_language/crates/baml_compiler2_metrics/src/calls.rs:77-116 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/traverse.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"6833fd2f5d1c967887481098c716a78a66f8dc4b36700306542c18b502813748"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 39\u002B corresponding lines): engine/generators/languages/python/src/ir_to_py/functions.rs:10-48 | engine/generators/languages/python/src/ir_to_py/functions.rs:50-88 | engine/generators/languages/ruby/src/ir_to_rb/functions.rs:10-48 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 39 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":"engine/generators/languages/python/src/ir_to_py/functions.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af9cafa497fb041e5f973567ae0d73a863352cc36f3b42cb15e35ebaf7034fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): baml_language/crates/baml_type_macros/src/emit.rs:147-177 | baml_language/crates/baml_type_macros/src/emit.rs:180-213 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type_macros/src/emit.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf450d40655fa4693683d2f198bb8a49ea780d97d05a20bfac565e12a1b6f08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): engine/baml-runtime/src/lib.rs:282-314 | engine/baml-runtime/src/lib.rs:317-350 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/lib.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a77fcc32943b5a38935566165b65da8a84e76697430557e8df83c71ae32436f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): engine/language_client_go/baml_go/raw_objects/utils.go:106-141 | engine/language_client_go/baml_go/raw_objects/utils.go:156-197 \u2014 These two members are one piece of code written twice and then edited apart: 36 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":"engine/language_client_go/baml_go/raw_objects/utils.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3af2cd046def4471794acaf9abe9a9a37301002b02765046900cc20f49a326"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): engine/baml-lib/jsonish/src/deserializer/score.rs:14-31 | engine/baml-lib/jsonish/src/deserializer/types.rs:151-173 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/deserializer/score.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8816df3a552b6ab286b5704cb52169b61ef9b1cfee99fa09f6d6f6b4f3aeca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): baml_language/crates/sys_native/src/io_impls.rs:1715-1743 | baml_language/crates/sys_native/src/io_impls.rs:1751-1775 \u2014 These two members are one piece of code written twice and then edited apart: 25 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":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f49fbf51b305f8552961a02203aac0fa502fab64685540c049615d854cc25d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): baml_language/crates/baml_parser/src/lib.rs:74-104 | baml_language/crates/baml_parser/src/types.rs:773-810 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_parser/src/lib.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"24da1fb5f8784265ec1f9dfd1f07989b53f6c510ffc7e41e18f2c29dfa165347"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): baml_language/crates/baml_compiler2_hir/src/item_tree/builder.rs:57-91 | baml_language/crates/baml_compiler2_hir/src/item_tree/builder.rs:257-297 \u2014 These two members are one piece of code written twice and then edited apart: 35 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":"baml_language/crates/baml_compiler2_hir/src/item_tree/builder.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe81381437d98909402b7c45b6b8d21fe04c97d9a26ac19fd408c880c01810ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): baml_language/crates/bex_events/src/history/mod.rs:317-338 | baml_language/crates/bridge_wasm/src/runs.rs:149-176 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_events/src/history/mod.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e4684b8e784577fca0d0dfbb2c710f9c79e8add0811d1b2229e034b62c7f9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:134-169 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:139-177 \u2014 These two members are one piece of code written twice and then edited apart: 36 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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"2806c626fb1f0d391a5bccafc99e3b111162e27ecb4575734e40c65597e27cb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): baml_language/crates/sys_ops/src/lib.rs:2939-2971 | baml_language/crates/sys_ops/src/lib.rs:3263-3289 \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":"baml_language/crates/sys_ops/src/lib.rs"},"region":{"startLine":2939}}}],"partialFingerprints":{"codehealthFindingId/v1":"02af73e6bd45815b185ac3f7b7f2b72eb01e5955642faecc4754b4019aff3cc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): engine/baml-runtime/src/optimize/applier.rs:218-248 | engine/baml-runtime/src/optimize/applier.rs:452-481 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/applier.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cd0b958769fa5681e9de5fef7e68e9d254f0633222127ed5c5b528b589a39d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): engine/generators/languages/typescript/src/ir_to_ts/type_aliases.rs:49-90 | engine/generators/languages/typescript/src/ir_to_ts/type_aliases.rs:96-132 \u2014 These two members are one piece of code written twice and then edited apart: 37 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":"engine/generators/languages/typescript/src/ir_to_ts/type_aliases.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"11710a0e38c23c1d1f1383c4745d4c907dc84b4847c423d5530fa39903c6eba4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): baml_language/sdks/go/sdkgen_go/src/lib.rs:1367-1407 | baml_language/sdks/go/sdkgen_go/src/lib.rs:1413-1448 \u2014 These two members are one piece of code written twice and then edited apart: 36 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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":1367}}}],"partialFingerprints":{"codehealthFindingId/v1":"781da3d8bd28b4495083afd277bfc6758d7f1a004ce4dbad2f0aa53725e50b81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): baml_language/crates/sys_native/src/io_impls.rs:2600-2632 | baml_language/crates/sys_native/src/io_impls.rs:2641-2680 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":2600}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df9bdf21fa83829a74679869f01fd9782b77b91823ee5a50c17fd20634e0e6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/impls.rs:826-863 | baml_language/crates/baml_compiler2_hir_ty/src/impls.rs:909-952 \u2014 These two members are one piece of code written twice and then edited apart: 38 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":"baml_language/crates/baml_compiler2_hir_ty/src/impls.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb92c86449ec6910692ba3531a80c266900733bb71c1c970a5f037be5961bce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 28\u002B corresponding lines): baml_language/crates/tools_stow/src/main.rs:752-787 | baml_language/crates/tools_stow/src/main.rs:789-816 | baml_language/crates/tools_stow/src/main.rs:1062-1106 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 28 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":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c59c3e1e79c51dc76cd9588e3c8b0abf112d4215986ed8962fe0e110020d33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): baml_language/crates/baml_cli/src/diagnostics_cache.rs:119-147 | baml_language/crates/baml_cli/src/diagnostics_cache.rs:155-183 \u2014 These two members are one piece of code written twice and then edited apart: 29 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":"baml_language/crates/baml_cli/src/diagnostics_cache.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"284ef0458238dcec9ef517841fd3391a00d57dbdd4e04ea3b89684dfb4ea879e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): baml_language/crates/baml_fmt/src/ast/expressions.rs:981-1009 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1207-1235 \u2014 These two members are one piece of code written twice and then edited apart: 29 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":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a31e87087c2ec4a195ea4c11a8e6c1dd61394ce0200114d0bc0ceba413803e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:444-475 | engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs:317-347 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7f3a0e7335bb4430ba3897ccc06e1072cbcb8ebaf343ed696997b663b12ed0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): engine/baml-runtime/src/lib.rs:579-610 | engine/baml-runtime/src/lib.rs:617-648 \u2014 These two members are one piece of code written twice and then edited apart: 32 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":"engine/baml-runtime/src/lib.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"440ee96bf7f9bbd051d4f03b0ffcb0a4ef2e894568ee5a2e8e2af8fa69ef5f47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2515-2544 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:3144-3187 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae14e566fe2b149babf4ff9e9bb295ece80def50f53e994d6d0a0d20213fb525"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): baml_language/crates/baml_compiler2_hir/src/item_tree/builder.rs:103-138 | baml_language/crates/baml_compiler2_hir/src/item_tree/builder.rs:215-247 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir/src/item_tree/builder.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f4f3b687f48ad52a0d20a14bc279e95ce7c4d2a8931c673b9eaa92a1550afd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): baml_language/crates/baml_parser/src/items.rs:1731-1764 | baml_language/crates/baml_parser/src/items.rs:1771-1815 \u2014 These two members are one piece of code written twice and then edited apart: 34 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":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f38498612972998db0da0e285a6a712e16acfeac71c301a8b25546e4ca5f43e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): baml_language/crates/baml_compiler2_mir/src/lower.rs:10285-10311 | baml_language/crates/baml_compiler2_mir/src/lower.rs:10327-10370 \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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":10285}}}],"partialFingerprints":{"codehealthFindingId/v1":"644f3cbc9f35df79e57ef20a9c1c5a63fe54de04fa6489cbe88aef08d3940a5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 37\u002B corresponding lines): baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:556-595 | baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:697-734 | engine/baml-runtime/src/control_flow.rs:454-490 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 37 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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"5794a8ee34235a455c83300a087842ed9f1423d04dd40326eb83e5487ce2e6e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedCanonicalCodecs.cs:172-212 | baml_language/sdks/csharp/bridge_csharp/src/Values/BamlValue.cs:562-599 \u2014 These two members are one piece of code written twice and then edited apart: 38 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":"baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedCanonicalCodecs.cs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d2807cc62d821f97e3c9870fbb416b90bc459f804e83c217a874bf0c397bae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:1528-1553 | baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:1566-1593 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"1358728ee54a574326cfe3459225c5cda71f4c6fe00999ca276c61ec1895e1c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/crates/bex_sap/src/baml_value.rs:169-185 | languages/rust/baml/src/codec/baml_value.rs:336-353 \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":"baml_language/crates/bex_sap/src/baml_value.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"614c31ae2ce376eefa410f60a17cb3f1067e2c6a0485d2b892d5fe2996271c4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:282-316 | engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:815-841 \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":"engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bfd0a11a9d1a08bea2317cbbad780b788685b31bd0c09c9445d679ec5450ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlFfi.java:290-300 | baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlFfi.java:512-551 \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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlFfi.java"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94ffcf1b4f0b19fb8b051289fc04ff9f43c50c63c8bbf6d23d1974ad4376060"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): baml_language/crates/bex_vm/src/package_baml/resolve.rs:416-446 | baml_language/crates/bex_vm/src/package_baml/resolve.rs:682-704 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"baml_language/crates/bex_vm/src/package_baml/resolve.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7cba38ab8489b70f90dd0fb5da1a86e960803bf43d22a1f007aaaf0ff684a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): baml_language/sdks/go/baml_go/container.go:171-197 | baml_language/sdks/go/baml_go/container.go:203-235 \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":"baml_language/sdks/go/baml_go/container.go"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb79630875b3a5b8e977b6f2f800005aa4c4c2d6051e690c954a28cbee4bbcc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:227-255 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:674-702 \u2014 These two members are one piece of code written twice and then edited apart: 29 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":"engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"791cb3aa44c06954f236f183f843d5c80856c1e6477d663f0358786d5b65893f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:396-421 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:758-783 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3df9f60a0f58281be56554d5b0022ae4feb49a40ce1455d927832f9bccb8c92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): baml_language/crates/baml_ide/src/completion/completions.rs:156-186 | baml_language/crates/baml_ide/src/completion/completions.rs:190-218 \u2014 These two members are one piece of code written twice and then edited apart: 29 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":"baml_language/crates/baml_ide/src/completion/completions.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54310dc8ee43c127fb043970cb6b7f59940bf0f87bcbe7e50bf7fc385b03cf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): baml_language/crates/bex_sap/src/jsonish/value.rs:182-213 | engine/baml-lib/jsonish/src/jsonish/value.rs:172-192 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"baml_language/crates/bex_sap/src/jsonish/value.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc43b075083ccf73c4b5eb84e5a8122acf1fa8df12096b3594113c91d6f1553d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): baml_language/crates/bridge_cffi/src/ffi/handle.rs:179-202 | baml_language/crates/bridge_cffi/src/ffi/handle.rs:232-257 | baml_language/crates/bridge_cffi/src/ffi/handle.rs:270-293 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 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":"baml_language/crates/bridge_cffi/src/ffi/handle.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8fedeefa11e00731abe01794e42240dda9e4747db97dcf86a4df2e5f7a4c3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): baml_language/crates/bex_sap/src/jsonish/value.rs:80-110 | engine/baml-lib/jsonish/src/jsonish/value.rs:72-102 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/value.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc1eb547c65c2b0b9d454a2c0cd0b65e227b4e22678c2afd555618eca26f12f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/crates/baml_type_macros/src/convert.rs:675-691 | baml_language/crates/baml_type_macros/src/convert.rs:707-726 \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":"baml_language/crates/baml_type_macros/src/convert.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6cd0d3030af520f5379c259fdb0ddca4f9e0fc2138a3aac45dc4d4b1c1073d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 20\u002B corresponding lines): engine/baml-compiler/src/thir.rs:217-236 | engine/baml-compiler/src/thir.rs:238-257 | engine/baml-compiler/src/thir.rs:262-281 | engine/baml-lib/baml-types/src/expr.rs:157-178 | engine/baml-lib/baml-types/src/expr.rs:180-201 | engine/baml-lib/baml-types/src/expr.rs:203-224 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/thir.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"7038d2e377c03c180f36f1e532321cb392d3371b165f330434bbd992f1429429"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): engine/baml-lib/llm-client/src/clients/anthropic.rs:186-219 | engine/baml-lib/llm-client/src/clients/google_ai.rs:171-211 \u2014 These two members are one piece of code written twice and then edited apart: 34 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":"engine/baml-lib/llm-client/src/clients/anthropic.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6534105b75d016a04e12f724dd00b3c52209adb871c77509e7d3ce49feb745"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedStream.cs:17-55 | baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedStream.cs:64-109 \u2014 These two members are one piece of code written twice and then edited apart: 39 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":"baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedStream.cs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf5c7ac0f2a5ef7d3707404571277c1e83705c36cd48418c1070dcca0e6ca79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/infer/obligations.rs:725-750 | baml_language/crates/baml_compiler2_hir_ty/src/infer/obligations.rs:759-798 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer/obligations.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eccc4b17ea060257dbd9db4989c0803e9c4ece0ceacf62c615ec67b7de531a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): baml_language/sdks/csharp/sdkgen_csharp/src/names.rs:339-369 | baml_language/sdks/csharp/sdkgen_csharp/src/routing.rs:254-277 \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":"baml_language/sdks/csharp/sdkgen_csharp/src/names.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d29ad514e42d60be571142cd0c6d606ca41dda669b0c44569d5a7df4e99ed88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:683-692 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:877-887 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:1087-1098 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b6077eb0fccd4bede8605e034776e4d6ed26d4014fb4d41630f1da8cc28a3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): baml_language/crates/baml_fmt/src/ast/expressions.rs:349-373 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1702-1722 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac0422175f4b193a45cb58907dd275d235e3e557c73db1c99a7701d7a256d73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): baml_language/crates/bridge_wasm/src/wasm_sys.rs:319-345 | baml_language/crates/bridge_wasm/src/wasm_sys.rs:369-390 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_wasm/src/wasm_sys.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ed3e6f16af68c81204363cdb8eb2afd7084910d4547cb5e1ee98348fa48c07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): baml_language/crates/baml_fmt/src/ast/expressions.rs:376-401 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1672-1698 | baml_language/crates/baml_fmt/src/ast/types.rs:102-126 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 25 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":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"75464b25357744aae240f040ba6131eeadda2a366658f98d57b92d88859893a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): engine/baml-lib/ast/src/formatter/mod.rs:279-312 | engine/baml-lib/ast/src/formatter/mod.rs:317-365 \u2014 These two members are one piece of code written twice and then edited apart: 34 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":"engine/baml-lib/ast/src/formatter/mod.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"a178dbc1d0fe36b6bc37229ed24d379dee4b3051d2b80dd3995b2f399c8e1ee7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): baml_language/crates/baml_parser/src/expr.rs:880-909 | baml_language/crates/baml_parser/src/stmts.rs:362-394 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_parser/src/expr.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e33c3c3f0e6465aa223958c202bb366a675f7435cf4c69617c618d47a352f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/exhaustiveness.rs:112-128 | baml_language/crates/baml_compiler2_hir_ty/src/exhaustiveness.rs:203-227 \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":"baml_language/crates/baml_compiler2_hir_ty/src/exhaustiveness.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb55d948dd61f3744fc5df46c8d16e92698d39b02cf40e4927b5929e0faabff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): baml_language/forks/aws-config-systest/src/main.rs:49-66 | baml_language/forks/aws-config-systest/src/main.rs:134-152 | baml_language/forks/google-cloud-auth-systest/src/main.rs:56-76 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/forks/aws-config-systest/src/main.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e802cc134d3a6f2cb1c5d23c8319cb88ec7590b38d5483380cc5ffaf97b6a240"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): baml_language/crates/baml_fmt/src/ast/pattern.rs:23-45 | baml_language/crates/baml_fmt/src/ast/pattern.rs:52-74 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"baml_language/crates/baml_fmt/src/ast/pattern.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7435369d755b086ebf03b357fb8d009a82b136ce152910f7648ed86a703f4e7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): engine/baml-lib/llm-client/src/clients/anthropic.rs:36-57 | engine/baml-lib/llm-client/src/clients/google_ai.rs:33-55 | engine/baml-lib/llm-client/src/clients/openai.rs:35-62 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 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":"engine/baml-lib/llm-client/src/clients/anthropic.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbac2d6d144587f879e1c96ff362ed58614884bbca6fa3ddaaa8fa9e29d31093"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): engine/baml-runtime/src/internal/llm_client/mod.rs:327-352 | engine/baml-runtime/src/internal/llm_client/mod.rs:357-391 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/mod.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7890450036489c7795f189b29899cff07809da855e27ea1405a69a4d1d8dc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): baml_language/crates/bex_vm/src/reachable.rs:61-90 | baml_language/crates/bex_vm/src/reachable.rs:132-157 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/reachable.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"88130d9ed976b8ce12ced5b751f1c5cf731e4c2721e9e2b4c1e77a2382f730fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): languages/rust/baml-macros/src/shared.rs:60-86 | languages/rust/baml-macros/src/shared.rs:91-117 \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":"languages/rust/baml-macros/src/shared.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"848da68bb678f9fc22e29b4fb470ac5c52b2130ca38b4a1a336e631f0b220853"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): languages/rust/baml/src/ffi/callbacks.rs:168-199 | languages/rust/baml/src/ffi/callbacks.rs:202-226 \u2014 These two members are one piece of code written twice and then edited apart: 25 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":"languages/rust/baml/src/ffi/callbacks.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e5bdeb87888f02dcc17745823e525d5205a2855f9d8f07cabbdc6614a174ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:3182-3196 | baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:3203-3221 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":3182}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0c60bfd2fdd86917c0facdecac9cd586ca542e5a201c5d83847e9853f1dab1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): engine/baml-lib/llm-client/src/clients/aws_bedrock.rs:171-193 | engine/baml-lib/llm-client/src/clients/vertex.rs:273-294 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/llm-client/src/clients/aws_bedrock.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"802447a9ae2a5d448e4d2d3d78b8bee243543cd1e9d42fb19b5b458a61ad40f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlType.java:904-931 | baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlType.java:933-954 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlType.java"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"2668d8a40a29e3746e63138e20babe0129562230e6cd1d18677ded9840f5bd3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): baml_language/sdks/rust/sdkgen_rust/src/emit/function.rs:712-733 | baml_language/sdks/typescript/sdkgen_typescript_shared/src/emit/mod.rs:209-230 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/rust/sdkgen_rust/src/emit/function.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd58a2a3c4aa5ecb3393a319c277e544edc07fffb6d4d9fae8391711ce2a8623"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): engine/baml-compiler/src/hir/dump.rs:592-610 | engine/baml-compiler/src/hir/dump.rs:626-644 \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":"engine/baml-compiler/src/hir/dump.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"200f15b996427055abe5637a313bf87414b662980e715c8393c39f776b31aa66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): engine/baml-compiler/src/viz_builder.rs:358-380 | engine/baml-compiler/src/viz_builder.rs:387-410 | engine/baml-compiler/src/viz_builder.rs:417-442 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/viz_builder.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dace5798e28ee375581482f149a6b48db027a47754e2d64608c3d1a733ee276"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): baml_language/crates/baml_type/src/decl_cycles.rs:226-261 | engine/baml-lib/parser-database/src/tarjan.rs:72-108 \u2014 These two members are one piece of code written twice and then edited apart: 36 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":"baml_language/crates/baml_type/src/decl_cycles.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea4a62bb767d07d365cd94c280da27946a410f115bc1ea6d0b9a6e9fe37052d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): engine/baml-lib/ast/src/parser/parse_types.rs:322-363 | engine/baml-lib/ast/src/parser/parse_types.rs:387-430 \u2014 These two members are one piece of code written twice and then edited apart: 42 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":"engine/baml-lib/ast/src/parser/parse_types.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4c5e98a3627c290017ab62539ceccaff05a32dc1cb6f3252a9a942e1441472"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): engine/language_client_cffi/src/ffi/objects.rs:91-117 | engine/language_client_cffi/src/ffi/objects.rs:148-176 \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":"engine/language_client_cffi/src/ffi/objects.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e2fdd17a776a5705543fea91c15e22008c340639cb0086436ae9763b77cd77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): baml_language/crates/bridge_wasm/src/wasm_random.rs:23-45 | baml_language/crates/sys_native/src/io_impls.rs:222-244 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"baml_language/crates/bridge_wasm/src/wasm_random.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c60b62c07bb3dd9eac70fe138e496a00ef363718684bc59523193ef76b302e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): engine/baml-runtime/src/optimize/gepa_runtime.rs:99-133 | engine/baml-runtime/src/optimize/gepa_runtime.rs:355-385 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/gepa_runtime.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34f733289e59e56a58249fc41bc46b12e4b7660263d392682d0d2225a14ff96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs:201-227 | baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:1956-1980 | baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:2154-2177 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 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":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2e6c4bd03b594089d855be2344ae3fa63b1e10ba10cfa02a9afd4b82da8729"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): baml_language/crates/baml_fmt/src/ast/expressions.rs:846-866 | baml_language/crates/baml_fmt/src/ast/statements.rs:259-281 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"690feaa6df814fade4e1f643ad4759ee400b1cc0f167d07013f49fc88eb92f6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): engine/baml-lib/jsonish/src/deserializer/coercer/ir_ref/mod.rs:25-40 | engine/baml-lib/jsonish/src/deserializer/coercer/ir_ref/mod.rs:47-62 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/deserializer/coercer/ir_ref/mod.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d701233be9774adad4f91638f1f7b16ca81254516631be82e0126c6ae2b3f44f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): engine/baml-runtime/src/optimize/evaluator.rs:279-313 | engine/baml-runtime/src/optimize/evaluator.rs:320-345 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/evaluator.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"187f69d01d20faeffe44cc0646d582b1eaeadbae7183546c47c4dc8c92304ef1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): engine/baml-runtime/src/types/js_callback_provider.rs:97-118 | engine/baml-runtime/src/types/js_callback_provider.rs:120-141 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/types/js_callback_provider.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"93671f5535b1b30e18cd3952789aaf1def43f4cd34bee740af572aafcf47f72f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): baml_language/crates/bex_vm/src/package_baml/array.rs:1021-1047 | baml_language/crates/bex_vm/src/package_baml/array.rs:1049-1075 \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":"baml_language/crates/bex_vm/src/package_baml/array.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"14873b5cd1e9965f19af088877a5e7f79138363d583e1c66c01ed69c067b2745"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/emit/mod.rs:380-412 | baml_language/sdks/typescript/sdkgen_typescript_shared/src/emit/mod.rs:282-307 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/emit/mod.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"503cced603e40636e2f5f56929bcb6744911935b3440417fc8c9c01903eb0d7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): languages/rust/baml/src/async_stream.rs:59-81 | languages/rust/baml/src/stream.rs:65-93 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"languages/rust/baml/src/async_stream.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ad0332909e5b3025031ad6382dbfed5b3f62fd222a4a76cb67c7b3b8ad96f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): baml_language/crates/bex_sap/src/jsonish/value.rs:159-180 | engine/baml-lib/jsonish/src/jsonish/value.rs:149-170 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/value.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e2b1490d58d2509b41df60c29085b6c416379c603b50b75f617cacacc22b5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/crates/btel_reader/src/timing.rs:192-203 | baml_language/forks/aws-sigv4/src/lib.rs:449-464 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_reader/src/timing.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f9b4fa8a0b4ccf840695fb07b10641de1ae34c0525f50f3a599168d3c0f71e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:84-105 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:107-127 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c1892374b38733531b948e8ec2e7ee253c50e5dd7f621451c340baba87a9e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/crates/baml_query_btel/src/usage.rs:25-36 | baml_language/crates/bex_vm/src/telemetry.rs:1824-1835 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/usage.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcdb3b7454d2dd5ee9fff4a04cd71848b9e834f20ac700d8139b04073e037202"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): baml_language/crates/tools_size_gate/src/measure.rs:392-419 | baml_language/crates/tools_size_gate/src/measure.rs:422-449 \u2014 These two members are one piece of code written twice and then edited apart: 28 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":"baml_language/crates/tools_size_gate/src/measure.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b83bca99a7f49e9f965261b533d058181feaf17b5f69cceca69277903de070b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): engine/language_client_go/pkg/runtime.go:136-176 | engine/language_client_go/pkg/runtime.go:178-216 \u2014 These two members are one piece of code written twice and then edited apart: 39 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":"engine/language_client_go/pkg/runtime.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7867a345ec2a8307e8f953a845452f2ca21d49d6a42da0dceabe089b5101ef0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs:1001-1029 | baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs:1034-1057 \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":"baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7cf3cb8fc91da72ac1a10547e22bc932cdf9110e937d4b5ef37f1455c1177f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): baml_language/sdks/java/sdkgen_java/src/emit.rs:296-315 | baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/emit/mod.rs:290-311 \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":"baml_language/sdks/java/sdkgen_java/src/emit.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"3023c768c351a7f99cb217ee797faeadcf061f8eec6cadffae5f4246b81db889"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:723-753 | baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:758-774 \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":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"96baece50363d5a676b4ccd45e5ccc6d513e262dd092e75ad1de79d98418857c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): baml_language/crates/tools_size_gate/src/main.rs:309-335 | baml_language/crates/tools_size_gate/src/main.rs:504-521 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/tools_size_gate/src/main.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d5dbdb49c46261b4bea46d3b560501e36c19a16f8a17effefcb469c70a9b0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/infer/obligations.rs:808-837 | baml_language/crates/baml_compiler2_hir_ty/src/infer/obligations.rs:952-974 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"baml_language/crates/baml_compiler2_hir_ty/src/infer/obligations.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1fb8a2cf75b5792f1bf365f43d6d8b88bd6d2d0ec027f4a2078d8178c23806"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): baml_language/crates/baml_lsp_server/src/engine.rs:394-421 | baml_language/crates/bridge_wasm/src/playground.rs:487-507 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"baml_language/crates/baml_lsp_server/src/engine.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bc07a2262bf4d3d568582244c25b0081bb94d1da37bff80535dfdc89ed6768"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:85-108 | engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:111-139 \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":"engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a3701eeebb318a44236ebbfee9a04209a205a2e3d8a0a04fd9244ee66b2456"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/baml-compiler/src/thir/interpret.rs:2559-2569 | engine/baml-compiler/src/thir/interpret.rs:2574-2587 \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":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":2559}}}],"partialFingerprints":{"codehealthFindingId/v1":"c820459b9a1878c86eb604240b792b8d7349ddb95cfc32e865d820f40715fe12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/sdks/swift/Sources/BamlBridge/Encode.swift:796-814 | baml_language/sdks/swift/Sources/BamlBridge/Encode.swift:822-838 \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":"baml_language/sdks/swift/Sources/BamlBridge/Encode.swift"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dbdcc7cbd31eaf046f7f675b8e9043bd740a07fd8f2d46eea0a38dbcb862a36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:685-701 | baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:953-970 \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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e93dae2194b4e93fc6e2c88e6d9f7b8f2721ef5e19a8478f5bbceebe77db1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): baml_language/crates/baml_compiler2_emit/src/emit.rs:528-542 | baml_language/crates/baml_compiler2_emit/src/lib.rs:741-756 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/emit.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefdfa2f9eddc5ead7083a75e9c54c7d2db74193752ea76456d0a277b0f79393"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): baml_language/crates/baml_fmt/src/ast/expressions.rs:1345-1365 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1369-1388 \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":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d51cb25be42a8eab6b415151f93099fa5e5ee7aae2e1dcb57e73879d46d4629"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 35\u002B corresponding lines): engine/boundary-udf/src/lib.rs:113-148 | engine/boundary-udf/src/lib.rs:150-185 | engine/boundary-udf/src/lib.rs:187-221 | engine/boundary-udf/src/lib.rs:223-263 | engine/boundary-udf/src/lib.rs:265-307 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 35 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/boundary-udf/src/lib.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd0074aae17598f0e56095301ce359f9b96a6e2483bd30b28d88856300256d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): baml_language/sdks/go/baml_go/native_unix.go:320-343 | baml_language/sdks/go/baml_go/native_unix.go:345-362 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/native_unix.go"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"26aa5c700d6bc0dae0081b57019980e65eefaeee33dd33e6ea4a42fe659a6dfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): baml_language/crates/baml_cli/src/generate.rs:967-1010 | baml_language/crates/baml_cli/src/generate.rs:1042-1088 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/generate.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"da33d94ffaefa5417bc4c602250601080d641370f3e6954cc6db5fa92045b50f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs:1735-1751 | baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs:1756-1772 \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":"baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs"},"region":{"startLine":1735}}}],"partialFingerprints":{"codehealthFindingId/v1":"579bb7654d05e7ea1297517447fe5d7f8933b30273dbfb4a247909c5fb5ad7af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): baml_language/crates/btel_processor/src/aggregate.rs:39-59 | baml_language/crates/btel_recorder/src/merge.rs:39-57 \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":"baml_language/crates/btel_processor/src/aggregate.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1854a787a915e70d4ce0205b6b172c51811160cd72167bb3992f39f3a7fad2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): baml_language/crates/sys_wasm/src/host_value.rs:381-401 | baml_language/crates/sys_wasm/src/host_value.rs:404-422 \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":"baml_language/crates/sys_wasm/src/host_value.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf035e4e8887b07254ba822a857329d5e1bd582df7e9c66fbf51ed2b2cf993a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): baml_language/crates/baml_cli/src/bytecode_cache.rs:1142-1172 | baml_language/crates/baml_cli/src/bytecode_cache.rs:1208-1243 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/bytecode_cache.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"4964566eeffa408697f9778c7a2e973c5ee50f3ccde270ef6269cb597a63e489"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/crates/baml_compiler2_hir/src/builder.rs:1729-1745 | baml_language/crates/baml_compiler2_hir/src/builder.rs:1747-1766 \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":"baml_language/crates/baml_compiler2_hir/src/builder.rs"},"region":{"startLine":1729}}}],"partialFingerprints":{"codehealthFindingId/v1":"d182c59c64c0a0954086497f30da1bebfd63cc8b0576f1104e3fb8d39310994f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 28\u002B corresponding lines): engine/generators/languages/go/src/ir_to_go/functions.rs:7-34 | engine/generators/languages/rust/src/ir_to_rust/functions.rs:7-39 | engine/generators/languages/typescript/src/ir_to_ts/functions.rs:7-34 | engine/generators/languages/typescript/src/ir_to_ts/functions.rs:36-63 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 28 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":"engine/generators/languages/go/src/ir_to_go/functions.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb228f7d447f1199d2046c73b0648dda1f15675f38d6cc76ac2c03ec72bf2579"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): baml_language/crates/baml_lsp_server/src/playground_env.rs:158-175 | baml_language/crates/baml_lsp_server/src/playground_io.rs:158-179 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/playground_env.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6517a02ce431a4f756b6164a462523b263c683b0170673598e6314cf8fdc355"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): jetbrains/src/main/kotlin/com/boundaryml/jetbrains_ext/cli_downloader/ArchiveExtractor.kt:37-69 | jetbrains/src/main/kotlin/com/boundaryml/jetbrains_ext/cli_downloader/ArchiveExtractor.kt:90-124 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"jetbrains/src/main/kotlin/com/boundaryml/jetbrains_ext/cli_downloader/ArchiveExtractor.kt"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c15746329b88ec2a49a062fca422759356cfc258fcd45b9e96e9d8cec4a2da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): baml_language/sdks/rust/sdkgen_rust/src/analyze.rs:673-695 | baml_language/sdks/rust/sdkgen_rust/src/unions.rs:337-358 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/rust/sdkgen_rust/src/analyze.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cde3d5f1decc44939a28917a20a6355e4a42de9255c908481a321a325b537fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): engine/language_client_cffi/src/ctypes/object_args_decode.rs:19-43 | engine/language_client_cffi/src/ctypes/object_args_decode.rs:49-67 \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":"engine/language_client_cffi/src/ctypes/object_args_decode.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e8a56cda0b3ef1700b02459a5eff258ee89f46ff9f97fa72803dddb535e246"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): baml_language/crates/baml_compiler2_mir/src/builder.rs:261-288 | baml_language/crates/baml_compiler2_mir/src/builder.rs:318-340 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"baml_language/crates/baml_compiler2_mir/src/builder.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2616a8a7a1422444b4f168af5d23682b21ca0fee984826f4880c85fbfd5e90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): baml_language/crates/bex_str/src/bex_str.rs:381-401 | baml_language/crates/bex_str/src/bex_str.rs:406-425 \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":"baml_language/crates/bex_str/src/bex_str.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd75c2892320eb0cdb52d13a9ab6097044bb127dadd25338f0535ee11e225e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs:1122-1144 | baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs:1146-1174 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"35bdc92e61f63aa47e1ea19012c46a945277d33aa5f4653a842a164eefdbe401"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/crates/baml_parser/src/items.rs:2155-2171 | baml_language/crates/baml_parser/src/items.rs:2174-2193 \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":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":2155}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f671fc4d44d476fbd0f0fb6acc28a085a270dfc20ae60f9da0cb5d62dd0eba5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): engine/baml-runtime/src/cli/init.rs:161-194 | engine/baml-runtime/src/cli/init.rs:196-229 \u2014 These two members are one piece of code written twice and then edited apart: 34 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":"engine/baml-runtime/src/cli/init.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6acb05b3b49d49c591f021ff3ad217792c3a28b64b52ac7d6b01f7ad7928bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): baml_language/crates/baml_compiler2_hir/src/item_data/lets.rs:56-81 | baml_language/crates/baml_compiler2_hir/src/item_data/type_aliases.rs:56-83 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir/src/item_data/lets.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"5926e3a5fe3e33140cb38810345d08a998b3de2fd6fee7ba1d7395828743f959"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): baml_language/crates/baml_fmt/src/ast/pattern.rs:89-89 | baml_language/crates/baml_fmt/src/ast/types.rs:19-19 \u2014 These two members are one piece of code written twice and then edited apart: 1 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":"baml_language/crates/baml_fmt/src/ast/pattern.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3370a72e9243cec22e00d56d89f8ac58bd54b05c120953acb29f9165fb0c98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): baml_language/crates/baml_lsp_server/src/playground_seam.rs:320-342 | baml_language/crates/bridge_wasm/src/playground.rs:639-661 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"baml_language/crates/baml_lsp_server/src/playground_seam.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"170285a4179fab6b1d70b05954f6a99ef498d5d3ccb7b181188aca87745a55fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): baml_language/crates/baml_type_macros/src/interned_member.rs:129-153 | baml_language/crates/baml_type_macros/src/interned_member.rs:262-284 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"baml_language/crates/baml_type_macros/src/interned_member.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f41db483faabf9955486bf699139981fa84083acb4fb9be44f06c9888937e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs:458-480 | engine/baml-lib/jsonish/src/deserializer/coercer/mod.rs:210-232 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb36ed7666b34cfbc14ac7e4593e23b7fee114c1af545fec5ae02be6976401ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): baml_language/crates/bex_vm/src/vm.rs:5995-6016 | baml_language/crates/bex_vm/src/vm.rs:6025-6048 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":5995}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc96c28f299f5e3fdff06a7b222c19305e2c29385d9228b9b3211201ee20fbe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/utils.rs:13-35 | engine/generators/languages/python/src/utils.rs:14-36 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/utils.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8751d8c4f74fad16cd5234f3714907fb82660889a1478966aadf850f4ef366c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): engine/language_client_ruby/ext/ruby_ffi/src/ruby_to_json.rs:217-238 | engine/language_client_ruby/ext/ruby_ffi/src/ruby_to_json.rs:240-261 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_ruby/ext/ruby_ffi/src/ruby_to_json.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba73b7840b692a7f7aa4e705b73f4881a2a58c4f50e3fc99cff4a1d0d24f0183"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): baml_language/crates/baml_compiler2_mir/src/lower.rs:7277-7296 | baml_language/crates/baml_compiler2_mir/src/lower.rs:10847-10866 \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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":7277}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e0a7d1d843d8b816cb4168f16af04e14e01d077ca1d6c4fd9503603bf67ac7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): baml_language/crates/baml_parser/src/lookahead.rs:83-108 | baml_language/crates/baml_parser/src/lookahead.rs:419-442 \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":"baml_language/crates/baml_parser/src/lookahead.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b601b8a8117b775909ec876e8bce53041da6683df0c4f1808f142e76ef6d26d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): baml_language/crates/bridge_wasm/src/lib.rs:454-475 | baml_language/crates/bridge_wasm/src/lib.rs:483-516 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_wasm/src/lib.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e1e37162bb892b1f664464fe962dd5ebf6876cf181ec83987f6e7a79696bb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:255-279 | engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:359-377 | engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:844-866 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 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":"engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e0c5113b27511e8e58d4e76a5a2f5f81a91ed09fe75db658486c27c401551e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): baml_language/crates/baml_compiler2_mir/src/lower.rs:6267-6294 | baml_language/crates/baml_compiler2_mir/src/lower.rs:11241-11265 \u2014 These two members are one piece of code written twice and then edited apart: 25 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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":6267}}}],"partialFingerprints":{"codehealthFindingId/v1":"f982fc27b9cf237d7d295ed60fe2dcc1f4fcf37fa15a13d696494e8d7184e970"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): baml_language/crates/baml_compiler2_mir/src/optimize.rs:732-761 | baml_language/crates/baml_compiler2_mir/src/optimize.rs:1467-1488 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/optimize.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfffb90b07614bdb2d90933f3b418fc6cf319a4203b1476f4f13a43b0773845"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): baml_language/sdks/go/sdkgen_go/src/types.rs:753-767 | baml_language/sdks/go/sdkgen_go/src/types.rs:769-783 | baml_language/sdks/go/sdkgen_go/src/types.rs:800-813 \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":"baml_language/sdks/go/sdkgen_go/src/types.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6bab9cd789770960113643a4194ee574f5fb56d90b78f42ca9a2f907176720"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): languages/rust/baml-macros/src/decode.rs:9-39 | languages/rust/baml-macros/src/encode.rs:9-34 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"languages/rust/baml-macros/src/decode.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"281f26157e83eb6c7c608fcf3ab0bc209a16224f8d531e41e8a41b00e05afe69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): baml_language/crates/baml_fmt/src/ast/expressions.rs:2204-2223 | baml_language/crates/baml_fmt/src/ast/expressions.rs:2488-2503 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":2204}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a65c446cd7a82fbecbea6c5c68c245465cb5314771ba5a5891ebde3a4431f73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:631-647 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:649-665 \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":"engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa204d9c8a7bdb34d467d09b9186cba12a56b3d7b3fb5f3fea7d453db19f7f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): baml_language/crates/baml_fmt/src/ast/expressions.rs:2178-2199 | baml_language/crates/baml_fmt/src/ast/expressions.rs:2244-2259 | baml_language/crates/baml_fmt/src/ast/expressions.rs:2466-2483 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":2178}}}],"partialFingerprints":{"codehealthFindingId/v1":"783dd22d696255381b5cfbcca7a84eb0516284db24a8f14abeff2aa855c1bc92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/baml-runtime/src/internal/prompt_renderer/scoped_ir.rs:35-45 | engine/baml-runtime/src/internal/prompt_renderer/scoped_ir.rs:50-60 \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":"engine/baml-runtime/src/internal/prompt_renderer/scoped_ir.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2093e9f6a3a4dbb366347655d6835996000fa2d349eb305c8c03e653dd2f77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): engine/language_client_go/baml_go/raw_objects/utils.go:49-69 | engine/language_client_go/pkg/callbacks.go:92-112 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"engine/language_client_go/baml_go/raw_objects/utils.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"881fecb0bbace0fb5fe0254a998e3e855e281c439d4e367684c773c1afbb2031"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): baml_language/crates/baml_sdkgen_types/src/string_literal.rs:7-25 | baml_language/crates/btel_reader/src/value/code.rs:488-506 \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":"baml_language/crates/baml_sdkgen_types/src/string_literal.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb82dc9adb88f327b9cec008efb73e0226993cbed687e9398f6788ee8f875386"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:2349-2373 | baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:2375-2399 \u2014 These two members are one piece of code written twice and then edited apart: 25 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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":2349}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f5b81717094d2e0e48e56d0447ff7c01de0202feb4a8f8744c94e318c50bed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): baml_language/crates/baml_parser/src/items.rs:2084-2108 | baml_language/crates/baml_parser/src/items.rs:2128-2150 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":2084}}}],"partialFingerprints":{"codehealthFindingId/v1":"947b4b461e03235c0525329c89422941fdfc50fa5cbde43898e0e876f5f23760"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_collection.rs:52-67 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_collection.rs:52-65 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_collection.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"041ebeeeda52a74d3d90e2fc0c064123fdebc33e50d414f9e183dc9a7c313bac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): baml_language/crates/bex_vm/src/package_baml/prompt.rs:129-148 | baml_language/crates/bex_vm/src/package_baml/prompt.rs:151-172 \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":"baml_language/crates/bex_vm/src/package_baml/prompt.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"81bb2cc30ea0921447b27ca2cde53d5c39cc9592fca1d29d54b4e0bc53373920"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): baml_language/tools/speedtest/src/speedtest/profiler.py:37-57 | baml_language/tools/speedtest/src/speedtest/profiler.py:93-113 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"baml_language/tools/speedtest/src/speedtest/profiler.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6eb2f54a760b171062f565d21e1dc6e61a3167bc1b907bbe1d8a45f064bfa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): engine/language_client_ruby/ext/ruby_ffi/src/types/log_collector.rs:243-265 | engine/language_client_ruby/ext/ruby_ffi/src/types/log_collector.rs:286-313 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"engine/language_client_ruby/ext/ruby_ffi/src/types/log_collector.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"1121998cd29f77ad89f7bcd5cf09663474aa89102f22a6e547a1c269d74bd060"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlFfi.java:320-325 | baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlFfi.java:326-331 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlFfi.java"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f147f04b290f8d0666c1ce29f21ff829074587d37c28561255beffc729f6054"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): baml_language/crates/bridge_wasm/src/wasm_io_fs.rs:477-491 | baml_language/crates/bridge_wasm/src/wasm_io_fs.rs:500-513 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_wasm/src/wasm_io_fs.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7dcc905d7479244401da1b5fc42eac72f997ae3bfa751ed50d23085a736f49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): engine/baml-lib/llm-client/src/clients/anthropic.rs:126-141 | engine/baml-lib/llm-client/src/clients/google_ai.rs:113-130 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/llm-client/src/clients/anthropic.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"861152d8158e33dbf885d52dc85a732aa9c8ddea97341f452f76511e5cc7c2b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): engine/baml-lib/parser-database/src/attributes/alias.rs:5-23 | engine/baml-lib/parser-database/src/attributes/description.rs:5-23 \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":"engine/baml-lib/parser-database/src/attributes/alias.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9075a6e5db1548cad26417c5bc6b2799b78debe33e4067736fc0068754c003d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/sdks/swift/Sources/BamlBridge/Runtime.swift:247-254 | baml_language/sdks/swift/Sources/BamlBridge/Runtime.swift:296-320 \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":"baml_language/sdks/swift/Sources/BamlBridge/Runtime.swift"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf89a24316dd47503f512e01c82db4bca7878af9d59c11d8ece0139fead93ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): baml_language/crates/baml_query_btel/src/ingest.rs:314-332 | baml_language/crates/baml_query_btel/src/query.rs:205-239 \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":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3988492cee589558108971e39ce7411f4a3c6ae02cf8589c005c4b9f498780"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): baml_language/crates/bex_chunkedringbuffer/src/lib.rs:701-720 | baml_language/crates/bex_chunkedringbuffer/src/lib.rs:722-741 \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":"baml_language/crates/bex_chunkedringbuffer/src/lib.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46c07454d579839230cfc0bec803ca691b7a9c3ea7cd3a7125c727472203d0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): engine/generators/languages/python/src/watchers.rs:253-271 | engine/generators/languages/typescript/src/watchers.rs:241-259 \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":"engine/generators/languages/python/src/watchers.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc25fe8cce78ec52c68019b9a7c98ee5c901e9c7e6c8061ee2ebf6f1fdd1cfc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:1140-1159 | baml_language/crates/baml_compiler2_hir_ty/src/interfaces/coherence.rs:376-390 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"17902ac1c6a7c6e59aebf70604ea4659238a7767bd70d3613c6e8c1919ecaf38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:11741-11759 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:11767-11785 \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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":11741}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfacc2e21997dc658635a71dce44ddf53e83e04c9f5e9cb12de472976a923c3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): baml_language/crates/bex_sap/src/deserializer/coercer/coerce_enum.rs:67-95 | baml_language/crates/bex_sap/src/deserializer/coercer/coerce_enum.rs:161-185 \u2014 These two members are one piece of code written twice and then edited apart: 25 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":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_enum.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed91ce5f8d8bc09bae11be65c3f0c5011658590d8b3a50ea8002b2e3d28343ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 19\u002B corresponding lines): engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:275-293 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:295-314 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:423-445 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:447-469 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:803-823 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:825-845 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:856-879 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 19 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"183e36dd6d3eea62e4351885924b09d4d685b4a299e095063b5f6ad037cf1b7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): engine/language_client_ruby/ext/ruby_ffi/src/types/log_collector.rs:491-502 | engine/language_client_ruby/ext/ruby_ffi/src/types/log_collector.rs:529-540 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_ruby/ext/ruby_ffi/src/types/log_collector.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea77adc174edc838d2638c6fea3876fdc8d0c543e67edbf7bc7141a189b1e58c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 22\u002B corresponding lines): baml_language/sdks/go/baml_go/value.go:727-748 | baml_language/sdks/go/baml_go/value.go:750-771 | baml_language/sdks/go/baml_go/value.go:804-831 | baml_language/sdks/go/baml_go/value.go:833-854 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 22 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":"baml_language/sdks/go/baml_go/value.go"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23daf6447b1befd98ebb94368d36a640bb8e16af11b2a311f14437bb0014991"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:343-350 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:505-513 \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":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebbeeef4da2137e4ce4825da7b5f77a38d47f62b980687b7be36d35e9ec131ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:701-703 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:896-898 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:1107-1109 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 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":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a8cde8d14fe555a2d65460b1aea55a7bc43c7cf55910edfdd8c194e43b9e92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1026-1049 | baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1226-1251 \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":"baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"c028b8903b8319822bd9dbeb5025da703fd0eb022dc2693c325f849993c2149b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): baml_language/crates/baml_compiler2_mir/src/lower.rs:7744-7770 | baml_language/crates/baml_compiler2_mir/src/lower.rs:7778-7798 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":7744}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44eebb5e1682807f9b9240b7cce30cf8ec646c002d022e9ff0b7d53c015c50c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): baml_language/crates/baml_ide/src/describe.rs:1939-1949 | baml_language/crates/baml_ide/src/export.rs:747-756 | baml_language/crates/baml_ide/src/export.rs:782-791 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/describe.rs"},"region":{"startLine":1939}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a7c818402a58a18118d5c0adf25f6236f43889283e446fb1d55d966f57a488"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/crates/bex_heap/src/accessor.rs:152-168 | baml_language/crates/bex_heap/src/accessor.rs:170-186 \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":"baml_language/crates/bex_heap/src/accessor.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"145ded201c687679759be492ae398cf6d93fe81e69c97687610808c0f56706a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): baml_language/sdks/python/rust/bridge_python/src/encode.rs:184-204 | baml_language/sdks/typescript/bridge_typescript_web/src/encode.rs:244-264 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"baml_language/sdks/python/rust/bridge_python/src/encode.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3e2ece7ad24ebebce50816ecb884758d401d9c0dfef10054d8f09dc461cbe0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs:1292-1315 | engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs:1317-1338 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f93335aa494836dc55190c8cfe9ab99a701b99088ed34563403b80bf75d228"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/crates/baml_cli/src/paint.rs:67-83 | baml_language/crates/baml_ide/src/tokens/classify.rs:46-62 \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":"baml_language/crates/baml_cli/src/paint.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d105f86c8d59e4f49b29ccc7c9dfc90277cb609db1e37430aa9f6786673f526b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/crates/baml_type_macros/src/convert.rs:693-705 | baml_language/crates/baml_type_macros/src/convert.rs:728-750 \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":"baml_language/crates/baml_type_macros/src/convert.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff88b650b98a9107fa2632e6db4271964c7a3664f3588f000b142840ae61b513"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/sdks/go/baml_go/media.go:335-347 | baml_language/sdks/go/baml_go/media.go:352-367 \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":"baml_language/sdks/go/baml_go/media.go"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"198d945e7567790bb06bc93e5adcfef11fcf1c97ebdfa550395af7c60b0f4298"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): baml_language/crates/baml_ide/src/export.rs:1079-1100 | baml_language/crates/baml_ide/src/export.rs:1107-1128 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/export.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5ae94d08d3b22cce68360a271cf1f2c922bc539aaff602db91f71acf9a0d45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:2723-2747 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:3371-3390 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:4220-4240 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed387f2a4a4af8518661b8aff8896222b1c91c40112d76d345ce177c15aa46f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): baml_language/sdks/python/src/baml_bridge/typemap.py:144-162 | baml_language/sdks/python/src/baml_bridge/typemap.py:165-180 | baml_language/sdks/python/src/baml_bridge/typemap.py:183-198 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/src/baml_bridge/typemap.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8292d20606bb8460e672241942d727ef901ea2bcc0d7722249ece4178b0567"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): baml_language/sdks/swift/Sources/BamlBridge/Runtime.swift:322-350 | baml_language/sdks/swift/Sources/BamlBridge/Runtime.swift:352-375 \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":"baml_language/sdks/swift/Sources/BamlBridge/Runtime.swift"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbdb9d3523043350074e13e421626576a143b72d2c43dd6a3f5cce7e38ccd360"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 20\u002B corresponding lines): baml_language/crates/bex_vm/src/package_baml/array.rs:432-454 | baml_language/crates/bex_vm/src/package_baml/array.rs:482-501 | baml_language/crates/bex_vm/src/package_baml/array.rs:523-542 | baml_language/crates/bex_vm/src/package_baml/array.rs:569-594 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 20 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":"baml_language/crates/bex_vm/src/package_baml/array.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b0e416c26cc1b8874ab23552a23102af1ca6c8ce4421aa622a7a15d914d89d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): engine/baml_cffi_macros/src/lib.rs:838-855 | engine/baml_cffi_macros/src/lib.rs:893-910 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbc07fac3c58d39ddc275a6b7582fcf46150ad8001bbe862c8236f62ea236e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): baml_language/tools/speedtest/workloads/string/join-request-line-10k/main.py:4-18 | baml_language/tools/speedtest/workloads/string/plus-request-line-10k/main.py:4-18 | baml_language/tools/speedtest/workloads/string/template-request-line-10k/main.py:4-18 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/string/join-request-line-10k/main.py"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b14dc26dfd0c766bfe115defaf103a612c021b20e5e250d076910ce8fde86b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:1808-1827 | baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:1839-1864 \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":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs"},"region":{"startLine":1808}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e1ea6caa2d6f0aebc055712d4bd31b8379f5926967a55d61c207847bbb9b89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): baml_language/crates/bridge_ctypes/src/wire_depth.rs:178-197 | baml_language/sdks/rust/bridge_rust/src/encode.rs:538-558 \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":"baml_language/crates/bridge_ctypes/src/wire_depth.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52a563889436fe0e35e8562268a03d545786a550a3afc29eeb7236b401e6625"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1414-1431 | engine/language_server/src/baml_project/mod.rs:487-501 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":1414}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb8a081327b8b447dc87dc45d03e5de0f46ed6ad5d65a4e9947c017f23d4c52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): baml_language/sdks/go/baml_go/rust_type.go:95-110 | baml_language/sdks/go/baml_go/rust_type.go:114-129 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/rust_type.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"171afae0ef48f28496652e45180013c14958103ce093e7a910f3d5c3f56b9a49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlType.java:1014-1034 | baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:911-933 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlType.java"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"e617fea27eff72c28a1bb714a2369abf217342ba0682e92689835a6a05e37113"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:695-712 | engine/baml-runtime/src/control_flow/flatten/step3_inline_implicit_nodes.rs:163-178 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bec09ccccbf20381df4408a9f7af6c7b0c9c250a3f925fa6db6290daec60278"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/crates/baml_cli/src/pack_command.rs:619-628 | baml_language/crates/baml_cli/src/run_command.rs:1017-1036 \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":"baml_language/crates/baml_cli/src/pack_command.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b15a2b943de0783939cddc70ad6b10640828a1ca01bd8905c3eb285f6f18629"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:672-690 | engine/baml-runtime/src/control_flow/flatten/step3_inline_implicit_nodes.rs:141-158 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"88068615de5ee10daf5317da064f978b6e8bb75ccaff68b875ea5d5ba174fe26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): baml_language/crates/baml_db/src/program.rs:109-129 | baml_language/crates/baml_db/src/testing.rs:82-97 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_db/src/program.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c7f3df0f857ef9d1818450ddf13878a2c0694950122997228c9076dcf92df3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): baml_language/crates/bex_events/src/value/live_cache.rs:217-230 | baml_language/crates/bex_events/src/value/live_cache.rs:232-245 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_events/src/value/live_cache.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e8809e3141f9e0871a770d58bfd74f4593727106c94d8cfe7475bd17d19b93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): baml_language/crates/bex_sap/src/sap_model/from_literal.rs:382-410 | baml_language/crates/bex_sap/src/sap_model/from_literal.rs:421-445 \u2014 These two members are one piece of code written twice and then edited apart: 25 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":"baml_language/crates/bex_sap/src/sap_model/from_literal.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"463021f8f8e50d2f9464b98c08082e5876f41ad7ce639ff4a21d46a2cffbf7a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): baml_language/crates/bridge_wasm/src/runs.rs:1078-1104 | baml_language/crates/bridge_wasm/src/runs.rs:1107-1134 \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":"baml_language/crates/bridge_wasm/src/runs.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b364e98db8049379b8a433d05a7556b455e259cdd70f74754418e97ddc7376c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): engine/baml-runtime/src/type_builder/mod.rs:291-304 | engine/baml-runtime/src/type_builder/mod.rs:327-340 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/type_builder/mod.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d469049113dd6a6915d7feb998d0580079db0aede0cfbd253b1481a5a88cbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/infer/flow.rs:234-254 | baml_language/crates/baml_compiler2_hir_ty/src/infer/flow.rs:356-374 \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":"baml_language/crates/baml_compiler2_hir_ty/src/infer/flow.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"390e9f2f2be49e4a20f2a0575abeecf158c01e95440e56003ccb3b8f89439bff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:316-338 | engine/baml-runtime/src/control_flow/flatten/step1_remove_implicit.rs:31-56 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73a1fa87d8d253110f78bbe850d90ffa954e60dcec9ea92e46f7cdf92bc9dbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:75-92 | engine/baml-runtime/src/control_flow.rs:383-405 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b907e9486b4d2a39be62b999f1c85fdedd7f48906ec72d0246fe9e2a56ec16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): baml_language/crates/baml_ide/src/tokens.rs:422-437 | baml_language/crates/baml_ide/src/tokens.rs:450-465 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/tokens.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"d859d77becfaf4c4b9c380765acc8fab96ef4fd30d04ed68d55895fcef62543f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): baml_language/crates/bridge_wasm/src/wasm_env.rs:146-165 | baml_language/crates/bridge_wasm/src/wasm_io.rs:207-230 \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":"baml_language/crates/bridge_wasm/src/wasm_env.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d78c78369c312d0ef55d8385db866512e17aa6692c9996b85b12daa702fc7da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): engine/baml-lib/ast/src/parser/parse_comments.rs:12-30 | engine/baml-lib/ast/src/parser/parse_comments.rs:35-53 \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":"engine/baml-lib/ast/src/parser/parse_comments.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf43a7984124adf1df73ee6eb440b763eeb7d26ce442cc244f70f7f1a3d37d2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs:345-362 | baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs:364-381 | baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs:430-451 | baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs:486-503 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97f94e94ce8378742ae1e2db04d02e73b4da05a9fc409ea98e2c08c10f38598"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 21\u002B corresponding lines): baml_language/crates/bex_vm/src/package_baml/array.rs:1079-1099 | baml_language/crates/bex_vm/src/package_baml/array.rs:1101-1121 | baml_language/crates/bex_vm/src/package_baml/array.rs:1246-1266 | baml_language/crates/bex_vm/src/package_baml/array.rs:1268-1293 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 21 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":"baml_language/crates/bex_vm/src/package_baml/array.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a1c8e44182ae3dfab362b22ba36d03ddcde89f222d09c3b9587d316887fcf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): baml_language/crates/baml_compiler2_emit/src/analysis.rs:420-444 | baml_language/crates/baml_compiler2_emit/src/analysis.rs:472-492 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"baml_language/crates/baml_compiler2_emit/src/analysis.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f9b6a05dd8c33a8aa1977c5b863f054a0041f5e3e9ade8db4c2d338999b357"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): baml_language/crates/baml_parser/src/items.rs:1942-1965 | baml_language/crates/baml_parser/src/items.rs:1969-1987 \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":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":1942}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b0bcbf0c5e35dd29bc89eea9e5c59bc7e4794ddf09c3aaf2397d10583531c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): baml_language/crates/bex_external_types/src/runtime_ty_identity.rs:100-115 | baml_language/crates/bex_external_types/src/runtime_ty_identity.rs:120-141 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_external_types/src/runtime_ty_identity.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"417615434f838f8d95dc5cd2b8e776a878299fc05057a2ba1b8f099f636f7d97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs:185-200 | baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs:202-216 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a35eff58df6f6c0b521f2ef2bd9bdc0187929503e75f83b4471ba3031d77939"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): engine/baml-lib/llm-client/src/clients/fallback.rs:54-67 | engine/baml-lib/llm-client/src/clients/round_robin.rs:56-71 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/llm-client/src/clients/fallback.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0004971100bbcc5f280fae648eeacc4f4ab83682d46084147c091624d91cbe7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): engine/baml-runtime/src/optimize/candidate.rs:241-260 | engine/baml-runtime/src/optimize/candidate.rs:270-288 \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":"engine/baml-runtime/src/optimize/candidate.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"404d1f785a0123318480c184ce74f1ffa7dfb168180fa15bccd8bdb61e20670d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): baml_language/sdks/go/baml_go/json.go:239-259 | baml_language/sdks/go/baml_go/value.go:919-936 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/json.go"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"183a8e9bc4d2819ffefff43bff20d58c3c703dc38721ba035cf0f7eaaf67ee7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:518-547 | engine/baml-runtime/src/control_flow/flatten/step3_inline_implicit_nodes.rs:9-38 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"917556643dd2e7fc6dcaf8bb253b31634bb0018b0c08ccf11c6902e5656190e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): baml_language/crates/baml_release/src/lib.rs:620-639 | baml_language/crates/baml_release/src/lib.rs:641-658 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_release/src/lib.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3a5aa1368ee1063ce978cd16a086eda2fe4dc1ed5a56c06e5cbbe05091b960"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs:898-921 | baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs:1110-1128 \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":"baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b06c3c711670a747f3181e2e909e2cffed039c9e5b9f610efe567312de2dd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): baml_language/crates/bex_vm/src/vm.rs:4880-4894 | baml_language/crates/bex_vm/src/vm.rs:4922-4936 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":4880}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfbce49ad9c8dabba7b4c7054fec33f2e9a9838f3407d286ba7c901f20ce53a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/sdks/python/rust/bridge_python/src/encode.rs:70-86 | baml_language/sdks/typescript/bridge_typescript_web/src/encode.rs:56-73 \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":"baml_language/sdks/python/rust/bridge_python/src/encode.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ec1482da97415b6b07b29bc652ab369d02348ae5c4a07e2f5d82d85576ac08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/crates/baml_builtins2_codegen/src/codegen.rs:225-241 | baml_language/crates/baml_builtins2_codegen/src/codegen.rs:531-547 \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":"baml_language/crates/baml_builtins2_codegen/src/codegen.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4615c199343919a94a02a684377a2d6154dca629709d75534fa0492b316eed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): baml_language/crates/bex_vm_types/src/types/future.rs:418-441 | baml_language/crates/bex_vm_types/src/types/future.rs:449-470 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm_types/src/types/future.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"4409866537f897a431523e84c34ef642d7481eab432c52187865d57b68d48060"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/crates/btel_snapshot/src/definition.rs:151-167 | baml_language/crates/btel_snapshot/src/definition.rs:208-224 \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":"baml_language/crates/btel_snapshot/src/definition.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb021f3e7910186be91669c8f04c6205b1f8416c29f0c28c6d5d34045e9c296d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): baml_language/sdks/go/sdkgen_go/src/lib.rs:4283-4296 | baml_language/sdks/go/sdkgen_go/src/lib.rs:4298-4312 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":4283}}}],"partialFingerprints":{"codehealthFindingId/v1":"712d4d304485a96b64d39e2d1da0d520590782b7dac2100cb6ac5fb73aa5360a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/names.rs:716-734 | baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/routing.rs:61-77 \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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/names.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"a725c4d91d07c37ffd41eea50bb0a326dcbc3fea8cca254a34eeb015ed3328f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/generators/utils/dir_writer/src/lib.rs:181-191 | engine/generators/utils/dir_writer/src/lib.rs:197-207 \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":"engine/generators/utils/dir_writer/src/lib.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63204ff9fe23d7d1622dc4571fe4a18610817fc5b4b18012423b9a5b7fb2323"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedStream.cs:203-221 | baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedStream.cs:225-238 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedStream.cs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf2b7d068db3184de006937dbb51632bf30a5dd821a16bf91b209e987d40000"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs:1962-1974 | baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs:1979-1991 \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":"baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs"},"region":{"startLine":1962}}}],"partialFingerprints":{"codehealthFindingId/v1":"7700e5aed7b450b6c4b4e6f6bca2f61df9f922dbbd1dd0cb3e303409b9aaaa04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/crates/btel_snapshot/src/decode.rs:882-898 | baml_language/crates/btel_snapshot/src/decode.rs:901-917 \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":"baml_language/crates/btel_snapshot/src/decode.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"020a5ffc8196eecc7e4f5902076342ae3c9bde1d17ee0b65cb25d994713194aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): engine/generators/languages/ruby/src/ir_to_rb/mod.rs:237-261 | engine/generators/languages/ruby/src/ir_to_rb/mod.rs:263-287 \u2014 These two members are one piece of code written twice and then edited apart: 25 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":"engine/generators/languages/ruby/src/ir_to_rb/mod.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bdb0bac3e8ae70d3c4b7d405e14edf857e9582f791d0a0a8e984fd1bbfe93b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): engine/language_client_ruby/ext/ruby_ffi/src/lib.rs:56-74 | engine/language_client_ruby/ext/ruby_ffi/src/lib.rs:81-100 \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":"engine/language_client_ruby/ext/ruby_ffi/src/lib.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bd1be128fa74d1aa1cc18ae4d2463f7b24af2ae4a44aca5853dad1ff0ff33e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): baml_language/crates/bcs_api/src/api_keys.rs:79-95 | baml_language/crates/bcs_api/src/auth.rs:145-159 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bcs_api/src/api_keys.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"67bc42d78eab1464d4fb2e75da16dc930a65ac0dc214bbd1c1eeec18859ebd31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/sdks/go/baml_go/rust_type.go:152-168 | baml_language/sdks/go/baml_go/value.go:893-912 \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":"baml_language/sdks/go/baml_go/rust_type.go"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0e6d12201ab5289743e4d1e7aab3de5ab33c508dba0c62c83d417493287138"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): engine/language_client_go/pkg/rawobjects_constructors.go:12-31 | engine/language_client_go/pkg/rawobjects_constructors.go:33-53 | engine/language_client_go/pkg/rawobjects_constructors.go:71-91 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 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":"engine/language_client_go/pkg/rawobjects_constructors.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6714893a33e502926e66af2dccc74dcd2b1604cca1530e0df1f67f494bd48797"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs:368-381 | baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs:2344-2363 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d201053894030ceda1a40c1d868883efa84319a84b545fa681ba6c44c88db2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): baml_language/crates/baml_compiler2_mir/src/lower.rs:13806-13820 | baml_language/crates/baml_compiler2_mir/src/lower.rs:13837-13850 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":13806}}}],"partialFingerprints":{"codehealthFindingId/v1":"7825c34f67c5944e523909710ad8388e8d86c754c66b20a4933c0d286f5175f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): baml_language/crates/baml_ide/src/completion/completions.rs:283-304 | baml_language/crates/baml_ide/src/completion/completions.rs:313-328 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/completion/completions.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb8d06236490ff3a84cf50a1f850b95c2a97517fb32a7e4a7b6c9e018b70c8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): baml_language/crates/baml_parser/src/items.rs:1823-1845 | baml_language/crates/baml_parser/src/items.rs:1856-1878 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"233a97ebeca5c970b3094120a91be3b729736e10192b0fdf837742bc32693dca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): baml_language/crates/bridge_ctypes/src/handle_table.rs:338-359 | baml_language/crates/bridge_ctypes/src/handle_table.rs:390-408 \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":"baml_language/crates/bridge_ctypes/src/handle_table.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f73c621cc118141d81d598d1f977953b637bbbcd00c02ee8794e126aa13df2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): baml_language/crates/btel_snapshot/src/encoding.rs:226-239 | baml_language/crates/btel_snapshot/src/shape.rs:641-654 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_snapshot/src/encoding.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c6ca315a87149cc8e59b25bedcc8dd3a03e54d5f912618bcd7ee3576835e2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): baml_language/crates/sys_types/src/lib.rs:485-495 | baml_language/crates/sys_types/src/lib.rs:507-515 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_types/src/lib.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"513e5f07ec1dc3caa12a3430665df6db81499dd7463179ff10bde55d352fbdc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): engine/baml-lib/llm-client/src/clients/helpers.rs:873-885 | engine/baml-lib/llm-client/src/clients/helpers.rs:890-902 | engine/baml-lib/llm-client/src/clients/helpers.rs:907-919 | engine/baml-lib/llm-client/src/clients/helpers.rs:924-936 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 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":"engine/baml-lib/llm-client/src/clients/helpers.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"779d9667d631278b2c9c5b0b9e0b6ec57b1700a6475545f5714a8f3f55a1e945"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): engine/baml-runtime/src/internal/prompt_renderer/scoped_ir.rs:67-84 | engine/baml-runtime/src/internal/prompt_renderer/scoped_ir.rs:133-151 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/prompt_renderer/scoped_ir.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec6fc8c0a303c427ccf53c16946f225c605f5b1fa0792714fa78b4966bc582e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): baml_language/sdks/swift/Sources/BamlBridge/Decode.swift:373-383 | baml_language/sdks/swift/Sources/BamlBridge/Decode.swift:393-403 \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":"baml_language/sdks/swift/Sources/BamlBridge/Decode.swift"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3dacff5ab1fe9b44a90a304a78fb43a645b7f2b6ba928327b64a005346b920"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): baml_language/crates/baml_type/src/lib.rs:431-444 | baml_language/crates/baml_type/src/lib.rs:457-474 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/lib.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"55aa6faf877bf77adf65161d30ea84b5e925a59cfce587c27e9b1bbd971c6c51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): baml_language/crates/bex_engine/src/conversion.rs:893-910 | baml_language/crates/bex_engine/src/conversion.rs:933-961 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/conversion.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"3953dac78ed13bc3c2068da606eef97b821293041711899c761e0eea432e43ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/sdks/python/rust/bridge_python/src/encode.rs:159-175 | baml_language/sdks/typescript/bridge_typescript_web/src/encode.rs:225-241 \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":"baml_language/sdks/python/rust/bridge_python/src/encode.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e7613effcf63256bc89d5ace31a816b313cb257028a9599ba51ca28628fc26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): engine/baml-lib/ast/src/parser/parse_expr.rs:1104-1120 | engine/baml-lib/ast/src/parser/parse_expr.rs:1126-1150 \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":"engine/baml-lib/ast/src/parser/parse_expr.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fde8f5b9a8b2addfca54c2ae6ed22e01176efa2df2a6bcf6afd9e7377e837e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): engine/generators/languages/python/src/ir_to_py/classes.rs:20-38 | engine/generators/languages/python/src/ir_to_py/classes.rs:40-58 \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":"engine/generators/languages/python/src/ir_to_py/classes.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f713d51faa1164789eceadfb56037cdc21fe2e04a17f1f0626db36cd5ce0f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/infer/unify.rs:821-832 | baml_language/crates/baml_compiler2_hir_ty/src/infer/unify.rs:836-848 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer/unify.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b61739730e27d506ab96ab24683a3355535c3f780133ad531b10c1f7b095fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/crates/bex_vm_types/src/indexable.rs:89-105 | engine/baml-vm/src/indexable.rs:64-80 \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":"baml_language/crates/bex_vm_types/src/indexable.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"63df21c8320bad1fe104c056174baa7de5715f24a72a52666329c02d22e85e34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): baml_language/crates/bridge_ctypes/src/value_decode.rs:293-307 | baml_language/crates/bridge_ctypes/src/value_decode.rs:652-670 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_ctypes/src/value_decode.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"984e3e40eb6e4a3f63060ddfc965ac9f23df654fbe23fe808919cda0f41c5d4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/crates/sys_native/src/io_impls.rs:2511-2524 | baml_language/crates/sys_native/src/io_impls.rs:2577-2589 \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":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":2511}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6fbda6cf9ad87ddff53e66b2aa9c18115fa1d1e5cc8136e8769fec8035c6f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): engine/baml-lib/ast/src/parser/parse_expression.rs:226-250 | engine/baml-lib/ast/src/parser/parse_expression.rs:417-441 | engine/baml-lib/ast/src/parser/parse_expression.rs:443-460 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/parser/parse_expression.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f559b7ca2e5cdf211ae57e0fb686e6ad2978f99b1f64455c1ef17f0ec428a12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): baml_language/crates/bridge_wasm/src/runs.rs:1023-1037 | baml_language/crates/bridge_wasm/src/runs.rs:1058-1075 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_wasm/src/runs.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64494fec5fd8b9b52d217bad475b03de6d71e3863bd02d482af7d4c01c514c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 26\u002B corresponding lines): baml_language/sdks/csharp/bridge_csharp/src/Proto/PrimitiveProtocol.cs:82-107 | baml_language/sdks/csharp/bridge_csharp/src/Proto/PrimitiveProtocol.cs:113-140 | baml_language/sdks/csharp/bridge_csharp/src/Proto/PrimitiveProtocol.cs:146-182 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 26 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":"baml_language/sdks/csharp/bridge_csharp/src/Proto/PrimitiveProtocol.cs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe12fd6b6820d9e1b865a6d93acfb55c149a305b4dd19b90a166a4e0e8429ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:1648-1662 | baml_language/crates/baml_compiler2_hir_ty/src/method_resolution.rs:1026-1041 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":1648}}}],"partialFingerprints":{"codehealthFindingId/v1":"204bfedff44220d72c98eaef710b7fe9b9d0f4dd3415a1836ef1822a692756ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/crates/bex_vm_types/src/prompt.rs:251-265 | baml_language/crates/bex_vm_types/src/prompt.rs:269-281 \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":"baml_language/crates/bex_vm_types/src/prompt.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79f8b243ac751c64b5d55cea72bf85b5f13b6188a6b299f445a3ccc63f3c4f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:1315-1331 | baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:2218-2234 \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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf919889b8b4d1ca986f015aa9166df5bfb848fb5424ca2c985d689c42e12910"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): baml_language/sdks/rust/bridge_rust/src/decode.rs:185-209 | baml_language/sdks/rust/bridge_rust/src/decode.rs:236-253 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/rust/bridge_rust/src/decode.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4b540422675bd11f7a4f375acae23dd57d54fddeedcdf802570435509ad8e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): engine/baml-lib/llm-client/src/clients/helpers.rs:225-249 | engine/baml-lib/llm-client/src/clients/helpers.rs:489-509 | engine/baml-lib/llm-client/src/clients/helpers.rs:789-809 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 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":"engine/baml-lib/llm-client/src/clients/helpers.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"05859b09b575da182c1855f2c9396a73b29f3b0b8d625d6e8d9999617750718f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): baml_language/crates/baml_compiler2_mir/src/memory.rs:460-480 | baml_language/crates/baml_compiler2_mir/src/memory.rs:545-563 \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":"baml_language/crates/baml_compiler2_mir/src/memory.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"8869a9cc37dea592dec1e15e8a098cfcd266ca731909b421200adac6c5970acc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/sdks/cpp/sdkgen_cpp/src/naming.rs:33-50 | baml_language/sdks/swift/rust/sdkgen_swift/src/translate_ty.rs:71-83 \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":"baml_language/sdks/cpp/sdkgen_cpp/src/naming.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b14fd90299e9a0f70039436944526ebf2e2c833e8648815abd25eae0310b16d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): engine/baml-vm/src/native.rs:39-54 | engine/baml-vm/src/native.rs:57-77 | engine/baml-vm/src/native.rs:80-95 | engine/baml-vm/src/native.rs:97-114 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-vm/src/native.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a602f6d3d2dee306fefac60541cf5d46e9dbc5f8d377f52820b41b6bb708a83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedProgram.cs:197-227 | baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedProgram.cs:233-262 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedProgram.cs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"099b657b4e8095bbc25b479bd2fda32465a736ad7d72577458e4b9da2e1e395f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): engine/language_client_go/baml_go/serde/decode.go:187-206 | engine/language_client_go/baml_go/serde/decode.go:208-222 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/baml_go/serde/decode.go"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02a39acb7af1b366cb9d449801a1e9fe5d2e6e25161a4c2977bd5cb54013807"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): baml_language/crates/baml_compiler2_hir/src/builder.rs:1074-1090 | baml_language/crates/baml_compiler2_hir/src/builder.rs:1129-1142 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir/src/builder.rs"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e76a720f7f50f0d24c4d8ad5d552a9858c7f5862f3b66c3e5429750a251f495"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): baml_language/crates/bex_vm/src/vm.rs:3817-3831 | baml_language/crates/bex_vm/src/vm.rs:3838-3858 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":3817}}}],"partialFingerprints":{"codehealthFindingId/v1":"320a0675dc8b4c0d3c6502d951063ba0722becb1b9a4d6290a9aa525503cb8fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedRegistry.cs:892-901 | baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedRegistry.cs:904-914 | baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedRegistry.cs:917-927 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedRegistry.cs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65782ba25a8ddfb6ef66744ab9b69ae175766f31b2dafba44b698db997c2ec2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:355-376 | baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:718-731 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c399a512b7a3e989d02ff4aef73acab919aa0480a3d498deaafd5b896dfe807"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/crates/baml_compiler2_hir/src/contributions.rs:85-94 | baml_language/crates/baml_ide/src/export.rs:758-767 \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":"baml_language/crates/baml_compiler2_hir/src/contributions.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc41d24c75d7cc9c87ee0d0ab9d49bd148f0cb3d292a5dd9fb9d66b6c5b16b7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): baml_language/crates/bex_sap/src/deserializer/coercer/match_string.rs:183-200 | engine/baml-lib/jsonish/src/deserializer/coercer/match_string.rs:169-183 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/coercer/match_string.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e158006e790ae73e57a9a32fecc82c1ec3f9bfa82a28556344a2dfa0404a8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): engine/baml-lib/jinja/src/evaluate_type/mod.rs:83-104 | engine/baml-lib/jinja/src/evaluate_type/mod.rs:145-169 | engine/baml-lib/jinja/src/evaluate_type/mod.rs:171-192 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 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":"engine/baml-lib/jinja/src/evaluate_type/mod.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a257ad238b8a6fd7de4809fccbb061f75801f55cd1faf86dd4f5dfcb8f789fad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): engine/baml-lib/parser-database/src/lib.rs:353-365 | engine/baml-lib/parser-database/src/lib.rs:370-382 \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":"engine/baml-lib/parser-database/src/lib.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dba2d9e8fc565caa6d1de77fb608531bab6465e630e0d375e8bb8732a4c5d90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 17\u002B corresponding lines): engine/generators/languages/go/src/ir_to_go/type_aliases.rs:27-43 | engine/generators/languages/go/src/ir_to_go/type_aliases.rs:49-66 | engine/generators/languages/rust/src/ir_to_rust/type_aliases.rs:27-43 | engine/generators/languages/rust/src/ir_to_rust/type_aliases.rs:49-66 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 17 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":"engine/generators/languages/go/src/ir_to_go/type_aliases.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2baef9e4bccdcf6821e04ff104d8d27161371b611c2fccf8b6809004f20c363"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedArguments.cs:139-157 | baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedArguments.cs:316-334 \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":"baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedArguments.cs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9de7c858a038b550d20a8e692b4cce5b966e0c761039a3d4260e1510215ad3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): baml_language/crates/bex_heap/src/accessor.rs:226-242 | baml_language/crates/bex_heap/src/accessor.rs:270-285 | baml_language/crates/bex_heap/src/accessor.rs:295-311 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_heap/src/accessor.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a935a65d311b21cc3a808771dbe42cc60eaa68ecb4b283f31e63b471a2b04d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): baml_language/crates/bex_vm/src/vm.rs:4859-4873 | baml_language/crates/bex_vm/src/vm.rs:4901-4915 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":4859}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c3bb3ca8f1ae626f97529760f3176b600e01f3226355ebf9bebcf0c6f135b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): baml_language/crates/btel_snapshot/src/graph.rs:362-391 | baml_language/crates/btel_snapshot/src/shape.rs:193-216 \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":"baml_language/crates/btel_snapshot/src/graph.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"2050c3bc5331df87cd62a39c8924aebba85b1c69f62ab477a90e30d639bc609c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:209-219 | engine/language_server/src/baml_project/mod.rs:409-419 \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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f96f345636c3882fd4bdbcafa62e23891f35386aac1f6a1c9f9dc436f022b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): engine/baml-runtime/src/optimize/pareto.rs:31-44 | engine/baml-runtime/src/optimize/tui.rs:529-542 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/pareto.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfe4ac841f18ad71f78aa1abb6e9a0fa4b6cd615a061daf83e91c7827f28202"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): engine/language_server/src/baml_project/mod.rs:221-235 | engine/language_server/src/baml_project/mod.rs:252-265 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/baml_project/mod.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"d478cd763d7dc384a542e1b81b4538f7e8b40ffb80a43a683d17b17cf3d481f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/sdks/csharp/bridge_csharp/src/Values/BamlDynamicCodecRegistry.cs:98-109 | baml_language/sdks/csharp/bridge_csharp/src/Values/BamlValue.cs:835-851 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Values/BamlDynamicCodecRegistry.cs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a9498956f12534462153fc2253eaf72bec420b8190d688a4f1069df7a82296"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/crates/bridge_wasm/src/wasm_io_fs.rs:436-448 | baml_language/crates/bridge_wasm/src/wasm_io_fs.rs:456-468 \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":"baml_language/crates/bridge_wasm/src/wasm_io_fs.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"1903085dd5b952a6e1c9c5f09b55110a0edc7a5a9d0a5088296b3ffd8b0e8282"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): engine/baml-lib/parser-database/src/coerce_expression.rs:110-127 | engine/baml-lib/parser-database/src/coerce_expression.rs:134-156 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/parser-database/src/coerce_expression.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e9548e0929021141b44b44f6945ec6a35b98d898436d89aa802bd024a3aaa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): engine/baml-runtime/src/internal/llm_client/strategy/mod.rs:42-56 | engine/baml-runtime/src/internal/llm_client/strategy/mod.rs:62-81 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/strategy/mod.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d944edd026cde56a9a0802fb407130ed5b1f0391581c382a4a81b62870133e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/generators/languages/python/src/type.rs:222-229 | engine/generators/languages/ruby/src/type.rs:276-283 \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":"engine/generators/languages/python/src/type.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70d6c87e43711043142d8d406c6d94013b904e21e7c5fdc924bdded75e4226c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:133-143 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:145-155 \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":"engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a20a59bd40884c25a3cb725623a708bb766bfecf815954916aa37783a61dc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): baml_language/crates/baml_db/src/testing.rs:372-393 | baml_language/crates/baml_db/src/testing.rs:407-424 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_db/src/testing.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a5ec9ea0439062dacdf26b8f5d9fd9d4635e4006b3000b1afbf0da96ec6022"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): baml_language/crates/baml_ide/src/export.rs:796-814 | baml_language/crates/baml_ide/src/export.rs:816-831 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/export.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6e33e997f8670fee154e95edcd0ecb7b2e06b7a52e6131f99174ba30c2316b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/sdks/go/sdkgen_go/src/lib.rs:3284-3300 | baml_language/sdks/go/sdkgen_go/src/lib.rs:3443-3462 \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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":3284}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf14f867229202f67c4a57bb58d9c4273cea0275c6e1c140c9482561fef9ef0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): engine/baml-lib/jinja/src/lib.rs:28-47 | engine/baml-lib/jinja/src/lib.rs:53-75 \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":"engine/baml-lib/jinja/src/lib.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"10769ab8c1879b1b5969b5ab12e4e3eb19f03afeeb530245df809ef685ed477e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): engine/baml_cffi_macros/src/lib.rs:654-667 | engine/baml_cffi_macros/src/lib.rs:706-719 | engine/baml_cffi_macros/src/lib.rs:795-808 | engine/baml_cffi_macros/src/lib.rs:819-836 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b321f2a424102aa81518eaec42840298bd36446e5d8ababbcff8b1fba52f0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/generators/languages/go/src/type.rs:288-295 | engine/generators/languages/rust/src/type.rs:290-297 \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":"engine/generators/languages/go/src/type.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5269950d7f99d6c585727dc231253a78554ebbe03632b4f9ee725654e78a3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs:180-194 | baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs:218-232 | baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs:237-250 \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":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab69da1709fa4622e982038dffc16bf23f3115fa9e1fafed09b7dedd005f1574"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 18\u002B corresponding lines): engine/language_client_go/pkg/rawobjects_class_builder.go:43-60 | engine/language_client_go/pkg/rawobjects_collector.go:55-76 | engine/language_client_go/pkg/rawobjects_enum_builder.go:61-78 | engine/language_client_go/pkg/rawobjects_llm_stream_call.go:23-40 | engine/language_client_go/pkg/rawobjects_type_builder.go:261-278 | engine/language_client_go/pkg/rawobjects_type_builder.go:315-332 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/pkg/rawobjects_class_builder.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7628a6b9860b0f686624223aafec79f6b34c59981815927e87e3d24bd28b3b30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): baml_language/crates/baml_compiler2_emit/src/items.rs:555-570 | baml_language/crates/baml_compiler2_emit/src/items.rs:582-602 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/items.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb0bfb744c950e3bba4fd0aed0111c2cce2e9ad1b4c3fcd41037f9d537af7d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/crates/baml_compiler2_mir/src/escape.rs:1859-1868 | baml_language/crates/baml_compiler2_mir/src/escape.rs:1870-1883 \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":"baml_language/crates/baml_compiler2_mir/src/escape.rs"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"76bcbda101939db7623373a6e8ec3d3508c175fbb17e09ae27e94de4bd5469d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): baml_language/crates/baml_ide/src/completion/completions.rs:222-233 | baml_language/crates/baml_ide/src/completion/completions.rs:238-250 | baml_language/crates/baml_ide/src/completion/completions.rs:253-264 | baml_language/crates/baml_ide/src/completion/completions.rs:267-279 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 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":"baml_language/crates/baml_ide/src/completion/completions.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3fb447121570488d5697e62d78642d42f5711ec0f6e5178bf7e0ef48349c86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): baml_language/sdks/swift/rust/sdkgen_swift/src/translate_ty.rs:291-301 | baml_language/sdks/swift/rust/sdkgen_swift/src/translate_ty.rs:316-330 \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":"baml_language/sdks/swift/rust/sdkgen_swift/src/translate_ty.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61ec34bbc9c5f6ce311cd80468521474bb2a7185c25ab88439a83f28b5f5bcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/crates/baml_cli/src/diagnostics_cache.rs:192-205 | baml_language/crates/baml_cli/src/diagnostics_cache.rs:364-376 \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":"baml_language/crates/baml_cli/src/diagnostics_cache.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c34e6b077563e22d70447bae81597f7ec447e99c5e053d573ed1ad80da579f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/crates/baml_type/src/json_inhabit.rs:672-679 | baml_language/crates/baml_type/src/json_inhabit.rs:715-724 \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":"baml_language/crates/baml_type/src/json_inhabit.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c7ee1d71e943bc98eb07aa2b53cc1e23032685305a4c3baae009111c171ef3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/crates/baml_type/src/normalize.rs:2882-2898 | baml_language/crates/baml_type/src/normalize.rs:3234-3251 \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":"baml_language/crates/baml_type/src/normalize.rs"},"region":{"startLine":2882}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b88c92376e044d6619b359f1f0062a7e8325f8385ff35aa55b572be8852f2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/crates/bex_str/src/bex_str.rs:876-887 | baml_language/crates/bex_str/src/bex_str.rs:891-902 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_str/src/bex_str.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e80623bed12a08cda3db24a9e1c3f984f9e8c97a8ad61d2c16226dce462a99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/crates/bex_vm/src/package_load.rs:390-402 | baml_language/crates/bex_vm/src/vm.rs:3578-3591 \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":"baml_language/crates/bex_vm/src/package_load.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0fc3100a4e2bc06cf2d5df683f39aa98683cd5161035b276391a37f5700d55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): baml_language/crates/bridge_ctypes/src/wire_depth.rs:199-212 | baml_language/sdks/rust/bridge_rust/src/encode.rs:560-574 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_ctypes/src/wire_depth.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7db8b0d37433aaa9a6176477cf074953019838abf7cc6744641d10082cdda7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): baml_language/crates/sys_native/src/io_impls.rs:335-349 | baml_language/crates/sys_native/src/io_impls.rs:357-375 | baml_language/crates/sys_native/src/io_impls.rs:383-397 | baml_language/crates/sys_native/src/io_impls.rs:405-421 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"6212335447bc0923f82f1232e6cd71de9c39c398fc1f7cf4993e4d1cd4857d76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): engine/baml-lib/baml-types/src/ir_type/mod.rs:388-405 | engine/baml-lib/baml-types/src/ir_type/mod.rs:407-432 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-types/src/ir_type/mod.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"68065975c1037d4fef3b6a51db4cc5be264d335bd23489e31da33d9eaeedcc0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): engine/baml-lib/diagnostics/src/error.rs:609-630 | engine/baml-lib/diagnostics/src/warning.rs:43-64 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/diagnostics/src/error.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c77302d51e8c27fec28bca1bf95adbc7a79578529507c7527c3fef99560de42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): engine/baml-runtime/src/internal/llm_client/primitive/mod.rs:240-253 | engine/baml-runtime/src/internal/llm_client/primitive/mod.rs:258-269 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/mod.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a65882eaeca65db0b1b4284cb8a3432119dc3bbbdc901ebcea5a243dafc4815"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): baml_language/sdks/python/src/baml_bridge/_runtime_value.py:40-59 | baml_language/sdks/python/src/baml_bridge/_stream.py:229-250 \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":"baml_language/sdks/python/src/baml_bridge/_runtime_value.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf32378b7f0726d7da3b1579770135a5b25e8c8acbf033795d75314af3452d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/layout.rs:337-348 | baml_language/crates/baml_compiler2_hir_ty/src/layout.rs:404-416 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/layout.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe51fe7f43ace3a8365f53ba6ace627b7b6c67d5a9818814190c63992fb5952"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): baml_language/crates/baml_compiler2_mir/src/lower.rs:1097-1109 | baml_language/crates/baml_compiler2_mir/src/lower.rs:1470-1482 | baml_language/crates/baml_compiler2_mir/src/lower.rs:1485-1497 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"b958a2a044e4d698272f2b8098d618829e454394aa0a46717b29dbec38701503"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): baml_language/crates/bex_engine/src/lib.rs:1295-1317 | baml_language/crates/bex_engine/src/lib.rs:1329-1347 \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":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5b9c9403301571a02fb615311414aa655a4e10027578caf9ea7e417a103b0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): baml_language/crates/bex_vm/src/package_reflect/reflect.rs:559-569 | baml_language/crates/bex_vm/src/package_reflect/reflect.rs:571-578 | baml_language/crates/bex_vm/src/package_reflect/reflect.rs:580-591 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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":"baml_language/crates/bex_vm/src/package_reflect/reflect.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"18401fe98c5bfcec4e813ba5b88d2aadae6304f024910aab3ea0fa94bd19871b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): baml_language/crates/bridge_cffi/src/lib_native.rs:206-221 | baml_language/crates/bridge_cffi/src/lib_native.rs:230-244 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_cffi/src/lib_native.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c86d8e968b8ddc82aa94f73ba89737d2b78d3ce187b6bbccbd42b34b62eb97d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): engine/baml-lib/baml-core/src/validate/generator_loader/v2.rs:22-40 | engine/baml-lib/baml-core/src/validate/generator_loader/v2.rs:45-60 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/validate/generator_loader/v2.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cea4aca68310b1899b295b9451c660c3f14dcadf169b129e3338451e0d0084c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:359-361 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:522-524 \u2014 These two members are one piece of code written twice and then edited apart: 3 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":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7fdb4dd58724e824e6b2b7d0c3a8e0d070d1d2a656069d39843b51dc6b818e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/layout.rs:481-501 | baml_language/crates/baml_compiler2_hir_ty/src/layout.rs:583-596 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/layout.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93193c7af78b123dc3d9b4d33e824d7bc8303b47dc70696a6cdecc98c493999"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): baml_language/crates/baml_sdkgen_types/src/output_writer.rs:542-559 | baml_language/crates/baml_sdkgen_types/src/output_writer.rs:561-580 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_sdkgen_types/src/output_writer.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2a4848792ee1a78666d0ddb6e8c8613658759947ff40ec935a364011a11879"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:845-858 | engine/baml-lib/jsonish/src/deserializer/coercer/coerce_primitive.rs:263-279 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0864c5f205b077d45e86adeebf2498a5e057f5fa248824b7387af56b414dca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/crates/bex_vm_types/src/types/function.rs:268-280 | baml_language/crates/bex_vm_types/src/types/function.rs:293-306 \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":"baml_language/crates/bex_vm_types/src/types/function.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"a035dea28fe53c16c421b11a938c40219f8b89d10f09dbf7b3c0ea9e08271c08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/lib.rs:588-604 | baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/lib.rs:675-695 \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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/lib.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85f61ec8a83ca9463fab0c9ec3ad044e99d049dfe078567fa9ac63eae7b19b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs:124-136 | engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs:141-153 \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":"engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"1211487a6ab0d5a2572d385354600c9ab08c40085248d3510f2ede94c4b63915"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): engine/baml-runtime/src/tracingv2/publisher/rpc_converters/trace_data.rs:236-249 | engine/baml-runtime/src/tracingv2/publisher/rpc_converters/trace_data.rs:258-270 \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":"engine/baml-runtime/src/tracingv2/publisher/rpc_converters/trace_data.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a6362a63b528a4846241c59d2bac510d800272ebb7705f823f76d1f36477c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/crates/bex_vm/src/package_baml/ops_bitwise.rs:69-80 | baml_language/crates/bex_vm/src/package_baml/ops_bitwise.rs:86-97 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/ops_bitwise.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e82288f583e71127861cd901f0f5e3915653ebc6b78127bb84ee4bef083f220"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): engine/baml-lib/baml-core/src/ir/builtin.rs:24-40 | engine/baml-lib/baml-core/src/ir/repr.rs:608-624 \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":"engine/baml-lib/baml-core/src/ir/builtin.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1ac72a1361336053aa180ec945192163632dc64a713f0c66316780360dcfd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): engine/baml-runtime/src/internal/llm_client/llm_provider.rs:72-92 | engine/baml-runtime/src/internal/llm_client/llm_provider.rs:99-118 | engine/baml-runtime/src/internal/llm_client/llm_provider.rs:127-149 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 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":"engine/baml-runtime/src/internal/llm_client/llm_provider.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdce685f97d19b9d10fae262b8c3f82509dd7786c00b04e7e8a587fbe7e904ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 14\u002B corresponding lines): engine/generators/languages/go/src/ir_to_go/classes.rs:46-67 | engine/generators/languages/go/src/ir_to_go/classes.rs:69-90 | engine/generators/languages/python/src/ir_to_py/classes.rs:60-76 | engine/generators/languages/python/src/ir_to_py/classes.rs:78-94 | engine/generators/languages/python/src/ir_to_py/type_aliases.rs:27-40 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/go/src/ir_to_go/classes.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86722a8fe9823bd93653400ad5a092f55dd5a79f314d7403218e4240505f4dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): engine/generators/languages/typescript/src/ir_to_ts/mod.rs:200-216 | engine/generators/languages/typescript/src/ir_to_ts/mod.rs:219-237 \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":"engine/generators/languages/typescript/src/ir_to_ts/mod.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"f278d6c4c86be6756c5f534297e043fdf228d5c534384d086c847b4bfe3d19e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:609-625 | engine/baml-runtime/src/control_flow/flatten/step3_inline_implicit_nodes.rs:97-113 \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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b9845c2d19decb7c818999353cac55382029afe04f38ca16815a9a27a5c7f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): baml_language/crates/baml_fmt/src/ast/declarations.rs:493-504 | baml_language/crates/baml_fmt/src/ast/expressions.rs:2263-2273 | baml_language/crates/baml_fmt/src/ast/types.rs:284-294 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/declarations.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebee9dfcdce4314b2f2aeeab9b59e4805b197fc5e8a130a4ee8c0fb3011c8f5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): baml_language/crates/bex_events/src/history/mod.rs:174-189 | baml_language/crates/bex_events/src/history/mod.rs:195-210 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_events/src/history/mod.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0a556f108ff9fdeb2126ed581f7d160392c3a5c5fce4fb5b8fea1adfb5352b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): baml_language/crates/bex_events/src/run.rs:1694-1708 | baml_language/crates/bex_events/src/run.rs:1710-1724 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_events/src/run.rs"},"region":{"startLine":1694}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf53885b9fd20801ac3ea592752e52e55c18efe52f402f102c51fbcf38a957a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): baml_language/forks/aws-config/src/lib.rs:201-209 | baml_language/forks/aws-config/src/lib.rs:213-221 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/forks/aws-config/src/lib.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de68f1615c28f556bb1f173cca63420bf3744aba312f280a1176b6c8cc17314"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): engine/baml-lib/llm-client/src/clients/openai.rs:261-279 | engine/baml-lib/llm-client/src/clients/openai.rs:393-413 | engine/baml-lib/llm-client/src/clients/openai.rs:417-440 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 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":"engine/baml-lib/llm-client/src/clients/openai.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f0bca7f27798e3333ea2b7a2f048a61a0c45cbafb2081d84a10ea431ac6767"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/crates/baml_compiler2_hir/src/body.rs:52-66 | baml_language/crates/baml_compiler2_hir/src/body.rs:101-112 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir/src/body.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea27ef58693e3cd879c57d6d8a75efd12eca33bd2f0b879104ceba24b237f0a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/crates/baml_compiler2_mir/src/lower.rs:13424-13433 | baml_language/crates/baml_compiler2_mir/src/lower.rs:13601-13611 \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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":13424}}}],"partialFingerprints":{"codehealthFindingId/v1":"3020ab79752371eb66b7df03822d6c81ded3a8f6f4d15cc62b3c679877f9284e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:223-243 | baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:525-545 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e201c4372776f50cafdf26b712c69a56e40520aa037c83c2e7ac7d8bb5d1f78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs:281-299 | engine/baml-lib/jsonish/src/deserializer/coercer/mod.rs:96-112 \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":"baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a191c519e11d324803eefd6560cf9dec133e82c2602ea6a34392a1bb757010"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): baml_language/crates/bex_vm/src/telemetry/snapshot.rs:361-371 | baml_language/crates/bex_vm/src/telemetry/snapshot.rs:373-383 \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":"baml_language/crates/bex_vm/src/telemetry/snapshot.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1d3979b4de4584f8866051a92285f703e7a18b71c941d39600c7e0f79fa7f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/crates/sys_native/src/io_impls.rs:507-520 | baml_language/crates/sys_native/src/io_impls.rs:622-634 \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":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a58f1328b140438b9b2c52dd748426675cd0adf4a546061ca6aef7a9db864c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): engine/baml-runtime/src/cli/serve/mod.rs:428-442 | engine/baml-runtime/src/cli/serve/mod.rs:573-587 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/cli/serve/mod.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d9da24fd3076b1f0fc72106348aea30316f0e37de8daab07638ae5f850e5c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:12244-12260 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:12267-12283 \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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":12244}}}],"partialFingerprints":{"codehealthFindingId/v1":"63cb944b23c14f84ef2b9e4157b255c13f664c5c918fddc79a1da74ba2b40781"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): baml_language/crates/baml_compiler2_mir/src/lower.rs:2683-2700 | baml_language/crates/baml_compiler2_mir/src/lower.rs:2706-2716 \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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":2683}}}],"partialFingerprints":{"codehealthFindingId/v1":"93236920c1a1f0b0189a9f3d63d9653546abe4a2530c5541a4f1cf1fafd35085"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:47-61 | baml_language/crates/baml_compiler2_visualization/src/control_flow/mod.rs:345-362 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"57dc3eff01bddc81ef4abc6598b155797de1566e5e9bda49e09f990c8f3ed19c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/crates/bex_engine/src/trace_heap.rs:173-182 | baml_language/crates/bex_engine/src/trace_heap.rs:189-202 \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":"baml_language/crates/bex_engine/src/trace_heap.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d06a103a27cb93fe27bbedfad298e21ee47ed1ed94d7da72f1837eba6f598b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/crates/bex_engine/src/trace_heap.rs:255-264 | baml_language/crates/bex_engine/src/trace_heap.rs:266-275 \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":"baml_language/crates/bex_engine/src/trace_heap.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e024ef3a043b9cbc098a4c68e5b3bde75c0895766da0d49cd191def2c58c2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): baml_language/crates/bex_events/src/ids.rs:201-217 | baml_language/crates/bex_events/src/ids.rs:220-235 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_events/src/ids.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fffe3d45c650107427bc18a45039c1d1204133a66fe34ad6419124e6a4e0745"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/crates/sys_ops/src/json_defs.rs:150-166 | baml_language/crates/sys_ops/src/output_format.rs:221-233 \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":"baml_language/crates/sys_ops/src/json_defs.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee25c00fbc1628bcd77fb041a3076f20e1bfdbd85951b93731271c549cdb113"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): engine/baml-lib/ast/src/parser/parse.rs:233-247 | engine/baml-lib/ast/src/parser/parse_expr.rs:931-945 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/parser/parse.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5343a7f6d214241b6d9ece66d6a67d10d79d6dab53f2df8b6db0856d635f0f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 10\u002B corresponding lines): engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs:630-639 | engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs:641-650 | engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs:652-664 | engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs:666-677 | engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs:702-714 | engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs:717-732 | engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs:735-750 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4178fe6b0eae87760994e0e61ccd797ffe5320cab9f64f3af40b0f9ca1695f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): engine/baml-lib/jinja/src/evaluate_type/types.rs:667-684 | engine/baml-lib/jinja/src/evaluate_type/types.rs:692-712 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jinja/src/evaluate_type/types.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c6b5737a15a8223f5bc6b1513545af1a53b153942e53797993d8630d034b04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:3108-3120 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:3123-3142 \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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":3108}}}],"partialFingerprints":{"codehealthFindingId/v1":"42682c2ace0555087ab405373b5ab75fa5ff375fe5afed26ff7a7e1fa5cb0942"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): engine/generators/languages/ruby/src/ir_to_rb/classes.rs:62-74 | engine/generators/languages/ruby/src/ir_to_rb/type_aliases.rs:27-39 | engine/generators/languages/typescript/src/ir_to_ts/classes.rs:60-73 | engine/generators/languages/typescript/src/ir_to_ts/type_aliases.rs:31-43 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 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":"engine/generators/languages/ruby/src/ir_to_rb/classes.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d225ba2f000bcfb0799bf5954f8a71b80c25c24652399bfdf24e70e879c5337"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): engine/generators/languages/rust/src/ir_to_rust/classes.rs:67-80 | engine/generators/languages/rust/src/ir_to_rust/classes.rs:86-99 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/rust/src/ir_to_rust/classes.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"005535fc8692904cac40b16c9629c031b334d0c2087689e8f6eb20601b162e73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedProgram.cs:38-61 | baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedProgram.cs:166-190 \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":"baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedProgram.cs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d03e79cce8c066b563a28baf5fd339a8344cd8f78636d734d2307ff66ac0669"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:955-970 | baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:2547-2570 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd017eda9847df6da3931ed483039c913af76a279182d7be119c70a8d047fc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/package_interface.rs:629-638 | baml_language/crates/baml_compiler2_hir_ty/src/package_interface.rs:648-657 \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":"baml_language/crates/baml_compiler2_hir_ty/src/package_interface.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"825a3ff24721641ec87e1a4df0e28496595d75fee31fd7bfb2ea0b1345cc15c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/crates/bex_vm/src/reachable.rs:109-122 | baml_language/crates/bex_vm/src/reachable.rs:175-186 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/reachable.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd4b0f1a5e1504b6d42a28a76af834f1adde9ff3394d417687db193d66c8761"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/forks/google-cloud-auth-systest/src/main.rs:80-92 | baml_language/forks/google-cloud-auth-systest/src/main.rs:99-114 \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":"baml_language/forks/google-cloud-auth-systest/src/main.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ea319f9a7d881322dc070de9033bd373ac73af1e63366e96a7b198e845075a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): engine/baml-compiler/src/viz_builder.rs:499-516 | engine/baml-runtime/src/control_flow.rs:293-310 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/viz_builder.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57e267304b9a8168d53baf0a4f122f087816e5bbe1d721c6f000b272911a4bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): engine/generators/languages/rust/src/ir_to_rust/unions.rs:77-88 | engine/generators/languages/rust/src/ir_to_rust/unions.rs:94-105 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/rust/src/ir_to_rust/unions.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb92c9acfa97988f6c51f4db595300e51d736b08d59b7c449cc746063d431af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:58-69 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:71-82 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc18115cc3fea7b60a4ee9bcf176f7688ee7f17232c184d4427c0e6ebda50cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlType.java:1097-1112 | baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:991-1004 | baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:1941-1955 \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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlType.java"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"683baa5b68ea77396ab1c9ec4305928b50cbae75b91361a23b81d5db33ef939e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): engine/language_client_go/baml_go/exports.go:101-110 | engine/language_client_go/baml_go/exports.go:112-121 | engine/language_client_go/baml_go/exports.go:123-132 | engine/language_client_go/baml_go/exports.go:134-143 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/baml_go/exports.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f41de9d7bcd0090bb976ef6c8ac7676bcf7aececbcb1bee004c74d84c6ad36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): baml_language/crates/baml_cli/src/run_command.rs:855-863 | baml_language/crates/baml_cli/src/run_command.rs:869-877 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/run_command.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21f9d5771f0251242deb749953ed1b040ee4c12474300d4e3c23ec51024f243"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/facts.rs:97-107 | baml_language/crates/baml_compiler2_hir_ty/src/facts.rs:114-130 \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":"baml_language/crates/baml_compiler2_hir_ty/src/facts.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1774f893302f037ea92cd39ad2458eabb219e3bd35ee57821a20734036d469"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:3931-3945 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:4031-4045 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":3931}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe3fef333b72619fc490fe01a6ce776f04955f84ecffd62a8e75b6a7d98e335"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/crates/baml_ide/src/export.rs:950-963 | baml_language/crates/baml_ide/src/export.rs:965-974 \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":"baml_language/crates/baml_ide/src/export.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35253131ad6e3d3235a533edb7652ad5e3c5b3214304fd2883f247fdbc3cfd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): baml_language/crates/bex_vm/src/package_reflect/reflect.rs:1436-1449 | baml_language/crates/bex_vm/src/package_reflect/reflect.rs:1451-1459 | baml_language/crates/bex_vm/src/package_reflect/reflect.rs:1461-1474 \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":"baml_language/crates/bex_vm/src/package_reflect/reflect.rs"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec631b59c8975de944b04e669c35657019acc7587c4d0a2fedcbb55f5ad25526"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/crates/baml_linker/src/space.rs:325-337 | baml_language/crates/bex_vm/src/package_reflect/graft.rs:1371-1386 \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":"baml_language/crates/baml_linker/src/space.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfbb133139c601346294beabf59574703308557b84ede1800516e24f9c9e044"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/crates/bex_cache/src/lib.rs:679-688 | baml_language/crates/bex_cache/src/lib.rs:1388-1401 \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":"baml_language/crates/bex_cache/src/lib.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"580c5edbca47467348cfd654d13f7836ef1b529de0044de8d9df412c7e5b6a0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/crates/bex_vm/src/vm.rs:163-178 | baml_language/crates/bex_vm_types/src/types/containers.rs:312-324 \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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ab8f242f2ef445ead297218091609c5dae974d8141f50b3f6c64dc4e5e2c37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/crates/bex_vm/src/vm.rs:3965-3975 | baml_language/crates/bex_vm/src/vm.rs:3981-3990 \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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":3965}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49f4bbc880c096de968dd8c7e99f57c7fb492c2a1cdb3670a39e2fb61862d51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/baml-compiler/src/hir/dump.rs:340-347 | engine/baml-compiler/src/hir/dump.rs:390-397 \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":"engine/baml-compiler/src/hir/dump.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"61aacb6e7cf78612522b42a637bc40a546b9dee8e33ecad958ad1d7bc00b3287"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): engine/baml-runtime/src/optimize/tui.rs:406-421 | engine/baml-runtime/src/optimize/tui.rs:424-439 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/tui.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f00b7baf6238c3e399d09080530b2af1b900a5cad179649ea3cab783a75c6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): languages/rust/baml/src/stream.rs:123-131 | languages/rust/baml/src/stream.rs:197-205 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"languages/rust/baml/src/stream.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fb334504aed664f122cb8dc620d22c85e9093ae58367cb198f311755649275"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/sdks/go/baml_go/native_unix.go:452-460 | baml_language/sdks/go/baml_go/native_unix.go:461-468 \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":"baml_language/sdks/go/baml_go/native_unix.go"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf807811d7229ba4e8c1b1253c47c4df055309951b6a3435ba9b7cbae47f0b4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/init_io.rs:283-288 | baml_language/crates/baml_ide/src/symbols.rs:122-131 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/init_io.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6c719bc3aae196356311d29c4df0186c02b58a5905a7f06f33e81909888b6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:1633-1647 | baml_language/crates/baml_compiler2_mir/src/pretty.rs:58-72 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4e480c675f505912ba34b8101215ef80d4b0320f158cb306bcde895ae624c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): baml_language/crates/bex_vm/src/vm/compiled_rt/virtual.rs:233-251 | baml_language/crates/bex_vm/src/vm/compiled_rt/virtual.rs:260-278 \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":"baml_language/crates/bex_vm/src/vm/compiled_rt/virtual.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5d27c34c0778e613261fd101831348edab6e823b4cc38582fae4d74be5ac3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/crates/bridge_wasm/src/wasm_random.rs:52-63 | baml_language/crates/sys_native/src/io_impls.rs:251-262 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_wasm/src/wasm_random.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de7ae3adcd0ade9e34d73ba8de4be495bb6cee73ee1f39a718d824e17bbe08a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): baml_language/crates/btel_snapshot/src/graph.rs:336-361 | baml_language/crates/btel_snapshot/src/shape.rs:152-171 \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":"baml_language/crates/btel_snapshot/src/graph.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e85b29915d853004bacf39bcb498c0a24ec0ae0b38210509cac11425fbdd76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 15\u002B corresponding lines): engine/generators/languages/python/src/ir_to_py/type_aliases.rs:8-22 | engine/generators/languages/ruby/src/ir_to_rb/classes.rs:46-60 | engine/generators/languages/ruby/src/ir_to_rb/type_aliases.rs:8-22 | engine/generators/languages/typescript/src/ir_to_ts/classes.rs:44-58 | engine/generators/languages/typescript/src/ir_to_ts/type_aliases.rs:12-26 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/python/src/ir_to_py/type_aliases.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"532f26abea5018ff7db298a3444e8c698811c1cc75831b6e9a750791d69aa92d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/TypeRegistry.java:755-770 | baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/TypeRegistry.java:797-809 \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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/TypeRegistry.java"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"7601c0c32a4ad04823bfd979d75a5b59159a0eee475aeb1c840da93765a35ed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): baml_language/crates/baml_fmt/src/ast/expressions.rs:444-452 | baml_language/crates/baml_fmt/src/ast/expressions.rs:467-478 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51f0016ba3bef054a913ce4f412265c6f84482c67a9a76167c71e0c91a123d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): baml_language/crates/baml_linker/src/space.rs:28-42 | baml_language/crates/baml_linker/src/space.rs:90-104 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_linker/src/space.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e890c7adc2a949045777fe7303fd82929132fa916bbb467725df804d0e7cc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): baml_language/crates/baml_parser/src/parser.rs:258-273 | baml_language/crates/baml_parser/src/parser.rs:287-297 \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":"baml_language/crates/baml_parser/src/parser.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"354a9a49a748f3179fab66d4e784f9ad7c32481e46d1ea98a25f8620ab11c7cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): baml_language/crates/bex_vm/src/package_baml/array.rs:383-398 | baml_language/crates/bex_vm/src/package_baml/array.rs:674-687 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/array.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f538e8a0e68f645a6d4c3d4f24fb964ac0509ac260118a21ee8d6bb4324ca98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): baml_language/crates/bridge_wasm/src/wasm_io_glob.rs:76-84 | baml_language/crates/sys_native/src/io_impls.rs:1196-1204 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_wasm/src/wasm_io_glob.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0ad49826c5cc0819be23daca8340048a73336d5fd900941577a1b2c2fd3650"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): baml_language/forks/google-cloud-auth/src/lib.rs:813-827 | baml_language/forks/google-cloud-auth/src/lib.rs:852-866 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/forks/google-cloud-auth/src/lib.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a051384995e861e06d1588d23ce234e3e34bd6773a8698069c015f450d5aec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/emit/typemap_file.rs:127-143 | baml_language/sdks/typescript/sdkgen_typescript_shared/src/emit/typemap_file.rs:121-139 \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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/emit/typemap_file.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"57593457b780a3da75e3c43c13b371e1ef476192e3f5f6ff87df3b8ce1d9d363"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): engine/generators/languages/python/src/generated_types.rs:459-474 | engine/generators/languages/ruby/src/generated_types.rs:415-430 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/python/src/generated_types.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"489825d30d5004db65311bb5eebf11117e42e9b699f63820a5f148290b79dcd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/crates/baml_compiler2_hir/src/attrs.rs:220-229 | baml_language/crates/baml_compiler2_hir/src/attrs.rs:235-245 \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":"baml_language/crates/baml_compiler2_hir/src/attrs.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"674278344446f67e31d5673250f3c19255ae3ad1360a85d9e28fa8ed65dbc2e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/crates/baml_compiler2_hir/src/contributions.rs:97-106 | baml_language/crates/baml_ide/src/search.rs:481-490 \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":"baml_language/crates/baml_compiler2_hir/src/contributions.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d77f4dfca865d2846a590e363232a0c320fd4330d57c5d46669240393a90d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs:1159-1175 | baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs:1199-1219 \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":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab3f9692d7ec0fb8825ead32975b2385779d159f1bd6f40992f64af8e9b61e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/crates/baml_compiler2_rust/src/reach.rs:101-113 | engine/baml-runtime/src/control_flow/flatten/mod.rs:61-73 \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":"baml_language/crates/baml_compiler2_rust/src/reach.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26ce9b513d71120939761bd7936de4e00bd40f2a22966485b20f3bcf551ee09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): baml_language/crates/baml_fmt/src/ast/expressions.rs:1840-1850 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1869-1877 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":1840}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82e95b300461f453f03d90caf0a993dc4e2ccd7031576c5b186c18c7d0553ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/crates/baml_ide/src/info.rs:207-218 | baml_language/crates/baml_ide/src/info.rs:221-233 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/info.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"8039050ecbcdf1b2d30f29c4cae03027fd9fa31cf4cfc989546bcd41296964ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/crates/btel_snapshot/src/decode.rs:1011-1020 | baml_language/crates/btel_snapshot/src/decode.rs:1089-1100 \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":"baml_language/crates/btel_snapshot/src/decode.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdf1c4376e0b16a0a3a540022ab0907a067538325a177f65da72f555c6d4946"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:4527-4537 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:4539-4549 \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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":4527}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae4982b18142c1426bec77f438c9f02e7b79840572fd63c582118c5b13b1dd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/sdks/python/src/baml_bridge/_stream.py:182-193 | baml_language/sdks/python/src/baml_bridge/_stream.py:196-207 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/src/baml_bridge/_stream.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d6d9e1f25d843ea1618487dbaffc3970c2a15cc0c714b55ab13a8f9595db50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): baml_language/sdks/swift/Sources/BamlBridge/Encode.swift:371-379 | baml_language/sdks/swift/Sources/BamlBridge/Encode.swift:436-441 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/Encode.swift"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"764abf717a8342756c0ae6d8fdb3deda613953f12bc576bf945d989aee261f2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:15666-15680 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:15740-15754 | baml_language/crates/baml_compiler2_hir_ty/src/infer/obligations.rs:1305-1319 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":15666}}}],"partialFingerprints":{"codehealthFindingId/v1":"06682ed50344bd3e4eb3e649afe1333676aebd22baedf45a8dd044be1fb80ceb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): baml_language/crates/bex_vm/src/package_baml/crypto.rs:243-254 | baml_language/crates/bex_vm/src/package_baml/json/mod.rs:746-752 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/crypto.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fba87d36ea0bc2233ec16c38b6161af5e865c0aa31684dabbfc838f1b0b735"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): baml_language/crates/bex_vm/src/package_baml/string.rs:38-46 | baml_language/crates/bex_vm/src/package_baml/string.rs:48-56 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/string.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2793a91346cd1d209846f0c32a84a24188b52b61a50edea2254e716ede892d06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/crates/bex_vm/src/telemetry/manual.rs:277-289 | baml_language/crates/bex_vm/src/telemetry/manual.rs:521-533 \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":"baml_language/crates/bex_vm/src/telemetry/manual.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d7a661261093e2a58b1da4f930c7909c1db945fedf1ef38a7e520e0424e79f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): engine/generators/languages/rust/src/generated_types.rs:125-138 | engine/generators/languages/rust/src/generated_types.rs:185-197 \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":"engine/generators/languages/rust/src/generated_types.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fa3020cac307ce234de13da51866eae07bb39a6b486c1c17c3e1fd10a92cbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): engine/language_client_cffi/src/ffi/objects.rs:39-46 | engine/language_client_cffi/src/raw_ptr_wrapper.rs:36-43 | languages/rust/baml/src/raw_objects/mod.rs:39-46 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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":"engine/language_client_cffi/src/ffi/objects.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"858b2fb0ee8b9a8c7a9ae3fa932b1e0ed7469d3f27f6d88a9ada575e9b876f99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/sdks/python/src/baml_bridge/_stream.py:133-148 | baml_language/sdks/python/src/baml_bridge/_stream.py:151-163 \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":"baml_language/sdks/python/src/baml_bridge/_stream.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cbd6e4797fa99ad918e2db4bc0628fc4612052318787090f7ccf61856c7353"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:52-57 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:181-187 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e082fce2ff9e3b2d5c7e8bb3ad540295d72b99b61579d2d58666096f392c0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:627-636 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:817-827 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:1023-1034 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"257c738e33ecc3139ab8f74de47e1d60fc649ac25c82803105ec19323c47cb85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): baml_language/crates/baml_compiler2_hir/src/builder.rs:380-388 | baml_language/crates/baml_compiler2_hir/src/builder.rs:392-402 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir/src/builder.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2571ace0e1a4dd571e324ecbecfaa4d9a1a79b27b0af0fc627155b7eefde88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): baml_language/crates/bex_vm/src/vm.rs:6528-6536 | baml_language/crates/bex_vm/src/vm.rs:6541-6549 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":6528}}}],"partialFingerprints":{"codehealthFindingId/v1":"d888be0d76830fd1e812bc87204a78bf55b55716dba47f16d8a91787a96a9133"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): baml_language/sdks/rust/bridge_rust/src/baml_value.rs:147-157 | baml_language/sdks/rust/bridge_rust/src/baml_value.rs:160-170 \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":"baml_language/sdks/rust/bridge_rust/src/baml_value.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c90af7074ba2a8f808b976730549e5384c3fb8217866e533cc4d09f777ae26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/baml-runtime/src/internal/llm_client/strategy/fallback.rs:58-65 | engine/baml-runtime/src/internal/llm_client/strategy/roundrobin.rs:100-108 \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":"engine/baml-runtime/src/internal/llm_client/strategy/fallback.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe565a1c8decd49254c77b8e8d12e5435d8a005bce6f4cea616235326538b427"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): baml_language/tools/speedtest/workloads/interfaces/to-string-interpolation-10k/main.py:39-47 | baml_language/tools/speedtest/workloads/string/template-two-strings-10k/main.py:4-14 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/interfaces/to-string-interpolation-10k/main.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d258dcec6907fbc5cff6631d47572d3593b138a7c43632b765040f3b7ddb41be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 17\u002B corresponding lines): engine/language_client_go/pkg/rawobjects_collector.go:78-94 | engine/language_client_go/pkg/rawobjects_llm_call.go:78-94 | engine/language_client_go/pkg/rawobjects_llm_call.go:96-112 | engine/language_client_go/pkg/rawobjects_media.go:83-99 | engine/language_client_go/pkg/rawobjects_media.go:119-135 | engine/language_client_go/pkg/rawobjects_media.go:136-152 | engine/language_client_go/pkg/rawobjects_timing.go:41-57 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 17 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/pkg/rawobjects_collector.go"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"919134f6afdf64b066e3f53d1ca513ca17a3391494a15af59b1f73e83677c221"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/extern_loc.rs:305-327 | baml_language/crates/baml_compiler2_hir_ty/src/extern_loc.rs:333-344 | baml_language/crates/baml_compiler2_hir_ty/src/extern_loc.rs:386-395 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/extern_loc.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f38bccbeb4e5997a22390530cf3fa84bf49bd388b97acd091afdb82e7d2c91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/crates/baml_compiler2_mir/src/lower.rs:3019-3031 | baml_language/crates/baml_compiler2_mir/src/lower.rs:3041-3054 \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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":3019}}}],"partialFingerprints":{"codehealthFindingId/v1":"426c79f2227cc6e9f15deea52fc0872f455b4255728a632769f71ca24b3b09c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/crates/baml_fmt/src/ast/attributes.rs:79-88 | baml_language/crates/baml_fmt/src/ast/types.rs:45-57 \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":"baml_language/crates/baml_fmt/src/ast/attributes.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7604af0c68fda0b20acbb6a7d78bfcabac32f124f4883e6b1f8abac6f4d611"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): baml_language/crates/baml_fmt/src/printer.rs:261-272 | baml_language/crates/baml_fmt/src/printer.rs:283-293 \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":"baml_language/crates/baml_fmt/src/printer.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5492bab8031f75400bd8fd6c8f926f4ba74f4e87e5d1c14798357a949b2238d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/sdks/go/sdkgen_go/src/lib.rs:64-71 | baml_language/sdks/rust/sdkgen_rust/src/lib.rs:97-107 \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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4ba40b2e84166742a0f9d47f603d690a41c3d3ec856cccd87a16ff2868b366"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): baml_language/sdks/java/bridge_java/src/lib.rs:381-395 | baml_language/sdks/java/bridge_java/src/lib.rs:409-426 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/bridge_java/src/lib.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"60327353a3faa676a8a1268ebebdb0a2df4b373197c70b405f253fe4aad3b843"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): engine/baml-compiler/src/thir.rs:501-513 | engine/baml-lib/baml-types/src/expr.rs:606-618 \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":"engine/baml-compiler/src/thir.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"014dffc9bf8f4a1e41c74551aa51507ca8483dcb4207e651397f35cd08d4ad97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:784-793 | engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:803-812 \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":"engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed197062f1f426b70c117eb3bc8d60ad3d0bf2927a99af409b27c0e56725bf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): engine/baml-runtime/src/optimize/candidate.rs:298-315 | engine/baml-runtime/src/optimize/candidate.rs:318-333 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/candidate.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28ce2524d3d76af8441a41341ab390d3bca8ed7e97b2b5812f2fb94fe484ddc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): engine/baml-vm/src/native.rs:222-233 | engine/baml-vm/src/native.rs:235-246 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-vm/src/native.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"efed5915a900e37ab0765d7422e70a88dca6ed31c1424fa7a9d651cf9351e323"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): engine/generators/languages/python/src/package.rs:12-25 | engine/generators/languages/ruby/src/package.rs:12-25 | engine/generators/languages/typescript/src/package.rs:10-22 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 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":"engine/generators/languages/python/src/package.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbbad01590a56c41d2e9b3d8d89b633919394ee13617cc46ee8397c10b025238"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedRegistry.cs:209-225 | baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedRegistry.cs:252-267 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedRegistry.cs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62c5e08dfe39fde3fe8c56c72c2ead87a8ca523b26d9beb15d78547a65cc650"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:450-463 | baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:501-513 \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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4342df21061cc6d3869124e9c3abd9db315154b035ec8c7b73af490ceebac2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:67-72 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:197-203 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7d8bc806153db43fa61a4c8866029f88258817b9d21e6c474182317b9092c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 16\u002B corresponding lines): engine/language_client_go/pkg/rawobjects_class_builder.go:82-97 | engine/language_client_go/pkg/rawobjects_enum_builder.go:81-96 | engine/language_client_go/pkg/rawobjects_type_builder.go:227-242 | engine/language_client_go/pkg/rawobjects_type_builder.go:244-259 | engine/language_client_go/pkg/rawobjects_type_builder.go:281-296 | engine/language_client_go/pkg/rawobjects_type_builder.go:298-313 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/pkg/rawobjects_class_builder.go"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa48518db876d261b3d84b963c13a94ad84ab6133095ff5ed8e73e34f634f248"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 16\u002B corresponding lines): engine/language_client_go/pkg/rawobjects_type_builder.go:96-111 | engine/language_client_go/pkg/rawobjects_type_builder.go:113-128 | engine/language_client_go/pkg/rawobjects_type_builder.go:130-145 | engine/language_client_go/pkg/rawobjects_type_builder.go:148-164 | engine/language_client_go/pkg/rawobjects_type_builder.go:166-181 | engine/language_client_go/pkg/rawobjects_type_builder.go:183-198 | engine/language_client_go/pkg/rawobjects_type_builder.go:200-215 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/pkg/rawobjects_type_builder.go"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ec93d50d8c3739edceba6cdca477d72aeae459bb7b126c5e02607612c5de0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/crates/baml_builtins2_codegen/src/types.rs:67-80 | baml_language/sdks/rust/sdkgen_rust/src/idents.rs:52-63 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_builtins2_codegen/src/types.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"178a623b96c69919c93711a29ee0bca51e3c9e1dc5a64f3a08b4ac359b0d3cb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:121-130 | engine/baml-runtime/src/control_flow.rs:782-791 \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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1107c3674bdb7c997273d9ec792a7d489896742356d2b7670185746d750b5bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): baml_language/crates/baml_fmt/src/ast/expressions.rs:250-259 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1794-1805 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1808-1819 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1884-1892 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc311af96a5b164254b298696d4d8fe63ddfb6822ebe0bc57f1952c70522937"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/crates/bridge_cffi/src/lib_wasm.rs:63-75 | baml_language/crates/bridge_cffi/src/lib_wasm.rs:81-92 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_cffi/src/lib_wasm.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25c82fcc93f39c55ce1ee780c5b44fb6520069a13cf04958c5f44d8bd9ac410"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/crates/sys_ops/src/lib.rs:742-751 | baml_language/crates/sys_types/src/lib.rs:817-826 \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":"baml_language/crates/sys_ops/src/lib.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a3396340aa1e7009420c481d3054e358fd27bff556d80302eb20f4f3780214"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): engine/baml-lib/baml-types/src/generator.rs:46-61 | engine/baml-lib/baml-types/src/generator.rs:64-75 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-types/src/generator.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40703f1e88feaf9a5d6577d164630d9139a56c9c3268fdf3e4999eeb4852aad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): engine/baml-vm/src/native.rs:155-165 | engine/baml-vm/src/native.rs:167-177 | engine/baml-vm/src/native.rs:179-189 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-vm/src/native.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"5900776609e40d6315c4271e355e48214189435c3d59c1db7945f0af95e47c11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/language_client_go/pkg/callbacks.go:266-273 | engine/language_client_go/pkg/callbacks.go:277-289 \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":"engine/language_client_go/pkg/callbacks.go"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"765dbecffa0d01a8691860a9dc2c99aa4c5439f2076fb04cd02fea3927c5a71c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): baml_language/crates/baml_compiler2_mir/src/lower.rs:1940-1953 | baml_language/crates/baml_compiler2_mir/src/lower.rs:2027-2037 \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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":1940}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3e1aab4ffdeaee2c5b05c1ef3618f0ff70f64bd9a7441fb9876ccf20e6d16b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/crates/baml_type/src/int.rs:42-54 | baml_language/crates/baml_type/src/int.rs:58-69 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/int.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d61abc88b0a82e6f01863a8db8fdd0934430ab4d063dddfb91514dcdbfb37c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/crates/bex_events/src/value/writer.rs:83-94 | baml_language/crates/bex_events/src/value/writer.rs:117-128 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_events/src/value/writer.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"231112f7b81995ea13ef81f70824c37c3fb703ca17e3da99b4a307ad188cedbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/crates/bex_vm/src/package_baml/string.rs:80-93 | baml_language/crates/bex_vm/src/package_baml/string.rs:99-108 \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":"baml_language/crates/bex_vm/src/package_baml/string.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7a44aa196551e85235da8fc9b10af9702dda912dec8998fbe3fa8d9669ce88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/crates/bex_vm_types/src/types/value.rs:125-136 | baml_language/crates/bex_vm_types/src/types/value.rs:143-154 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm_types/src/types/value.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"663efed14857268c387bb1f7ae2ff1e9ed2b9cd61fbc3b6ad4474c1e02058bf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/baml-lib/jsonish/src/helpers/mod.rs:53-67 | engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs:25-35 \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":"engine/baml-lib/jsonish/src/helpers/mod.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f983b4b1c5d1fa1f70d6ddce87a8d6eb9e44fdb16b06d0d6675ba3cf73a6a14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): languages/rust/baml/src/ffi/callbacks.rs:126-136 | languages/rust/baml/src/ffi/callbacks.rs:146-159 \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":"languages/rust/baml/src/ffi/callbacks.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e1b27c30019208039f0d258762178fe4572ae30e3820f1a387dc66ffdf4356"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlType.java:956-967 | baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:973-988 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlType.java"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c1460fa2b0d090a4ce1d50bc7864022b1e8ace64b0122c44a3ac450e6d7415"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): baml_language/crates/baml_compiler2_emit/src/refs.rs:504-511 | baml_language/crates/baml_compiler2_emit/src/refs.rs:571-578 | baml_language/crates/baml_compiler2_emit/src/refs.rs:584-591 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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":"baml_language/crates/baml_compiler2_emit/src/refs.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53995f4a234de696b9f0473f1efeabf45c2d066bf1516a824a7f4461f930565"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/crates/bex_str/src/bex_str.rs:194-201 | baml_language/crates/bex_str/src/bex_str.rs:208-221 \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":"baml_language/crates/bex_str/src/bex_str.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b600c34996fca3e01d699aaeb8d04937c2f0e0d2f12e7ec9ff06f0864111cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/crates/bridge_cffi/src/call_allocation.rs:52-59 | baml_language/crates/bridge_cffi/src/call_allocation.rs:61-68 \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":"baml_language/crates/bridge_cffi/src/call_allocation.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1af1e6a1d211ba055b53b770adce735e267a5e8891c3124e0dc0deb3d2e748b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): engine/baml-compiler/src/hir/dump.rs:695-708 | engine/baml-lib/ast/src/ast/stmt.rs:168-181 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/hir/dump.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b5e8c0f3558320e7a65fdc646f0adf645fdb2009af272965880bf8e73daffb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): languages/rust/baml/src/raw_objects/mod.rs:398-408 | languages/rust/baml/src/raw_objects/mod.rs:439-449 \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":"languages/rust/baml/src/raw_objects/mod.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54de9a60967c318a323a994be0bd90b1b06f37d6ac15928e429553691f31ec2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:45-50 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:173-179 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf8c10f0c4297565f76437d9d2c0191753b94e4208f8829ef7dfee6e015589a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): baml_language/sdks/swift/Sources/BamlBridge/Decode.swift:432-435 | baml_language/sdks/swift/Sources/BamlBridge/Decode.swift:455-459 | baml_language/sdks/swift/Sources/BamlBridge/Decode.swift:476-480 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 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":"baml_language/sdks/swift/Sources/BamlBridge/Decode.swift"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"895be30a9fd612321bceab008cbbc738b625fe7903f8964db09e63a38eb5dd21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): baml_language/sdks/swift/Sources/BamlBridge/Runtime.swift:222-233 | baml_language/sdks/swift/Sources/BamlBridge/Runtime.swift:235-245 | baml_language/sdks/swift/Sources/BamlBridge/Runtime.swift:265-279 | baml_language/sdks/swift/Sources/BamlBridge/Runtime.swift:281-292 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/Runtime.swift"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ed8a7aed17971a15e392477e09b8d19f34bba52737b1a1392faa626b64cb34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:65-71 | baml_language/crates/baml_type/src/unify.rs:158-164 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f112223f7144f06ab641277b8fb348dd47f2943105b3e662146e486bb8a1dbd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/infer/unify.rs:497-515 | baml_language/crates/baml_compiler2_hir_ty/src/infer/unify.rs:519-542 \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":"baml_language/crates/baml_compiler2_hir_ty/src/infer/unify.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b59bb7f4cae6dfad744de3c043191680b13e180161401fd4ae89884ebcbd16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 1\u002B corresponding lines): baml_language/crates/baml_fmt/src/ast/attributes.rs:214-214 | baml_language/crates/baml_fmt/src/ast/declarations.rs:479-479 | baml_language/crates/baml_fmt/src/ast/expressions.rs:800-800 | baml_language/crates/baml_fmt/src/ast/expressions.rs:2127-2127 | baml_language/crates/baml_fmt/src/ast/statements.rs:298-298 | baml_language/crates/baml_fmt/src/ast/tokens.rs:50-50 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 1 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/attributes.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"21dd154616dca6d8e2d33c02a179048bd68f61d28c0b3ac0ef91a9421ae658e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): baml_language/crates/bex_engine/src/lib.rs:7834-7846 | baml_language/crates/bex_engine/src/lib.rs:7853-7865 | baml_language/crates/bex_engine/src/lib.rs:7883-7898 | baml_language/crates/bex_engine/src/lib.rs:7905-7920 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 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":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":7834}}}],"partialFingerprints":{"codehealthFindingId/v1":"59add0e0442b3041c7ff4df5247787c21f58e86e7f70f3f6671c1a841fb42bec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): baml_language/crates/bex_sap/src/deserializer/coercer/coerce_enum.rs:101-112 | baml_language/crates/bex_sap/src/deserializer/coercer/coerce_enum.rs:191-201 \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":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_enum.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"638d2af45abb627792c1f1823817001907b3e2aa559a489178404fefb40e45ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): engine/language_client_python/src/types/log_collector.rs:40-51 | engine/language_client_ruby/ext/ruby_ffi/src/types/log_collector.rs:124-132 | engine/language_client_typescript/src/types/log_collector.rs:77-88 \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":"engine/language_client_ruby/ext/ruby_ffi/src/types/log_collector.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a598db267958bf04c53f707be2b82f212c5fa2fe437e7dc07c218b63185eda5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): baml_language/sdks/go/baml_go/value.go:130-138 | baml_language/sdks/go/baml_go/value.go:177-183 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/value.go"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d89628c50bfc3096733abc4364958a4fd6dd9681f13065af749d0f177f7d95c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): baml_language/sdks/swift/Sources/BamlBridge/Runtime.swift:180-188 | baml_language/sdks/swift/Sources/BamlBridge/Runtime.swift:191-199 | baml_language/sdks/swift/Sources/BamlBridge/Runtime.swift:201-208 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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":"baml_language/sdks/swift/Sources/BamlBridge/Runtime.swift"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b30ac43069f7ed8420b20af8307c62535742cad09ed00b83a96db8cac100626"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): baml_language/crates/baml_artifact/src/lib.rs:173-186 | baml_language/crates/baml_base/src/lang.rs:145-158 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_artifact/src/lib.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8ff8e01b64811ae194c1ab1376ba003e9898a8d746b311cfeae4d49cead79f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/facts.rs:137-146 | baml_language/crates/baml_compiler2_hir_ty/src/facts.rs:148-157 \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":"baml_language/crates/baml_compiler2_hir_ty/src/facts.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"966aa9a76343819e0ad212dbe6a508624f356f9e673e12f83b08558bb2391901"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/ide.rs:36-47 | baml_language/crates/baml_ide/src/describe.rs:1018-1033 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/ide.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7502222ad5d094647441118822928824fc05eb4eab73894b808c686f9efdc13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): baml_language/crates/baml_compiler2_visualization/src/control_flow/mod.rs:444-452 | engine/baml-runtime/src/control_flow/flatten/mod.rs:48-56 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_visualization/src/control_flow/mod.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e629074f3dc71384db2c303a0505940879fcb80cf4f3072ec4d2f8a8769010f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/crates/bex_sap/src/deserializer/coercer/coerce_enum.rs:125-141 | baml_language/crates/bex_sap/src/deserializer/coercer/coerce_enum.rs:216-232 \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":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_enum.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49cc1881218e6bc3200f0c0b4090165d16a38f0890a3357f299ac7e269bb502"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:52-63 | baml_language/sdks/typescript/sdkgen_typescript_shared/src/leaf.rs:59-76 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8746a8b6d78f50f3f452b78992e0c3f6f88a1db827c67d8d1b10bb31f3dfac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): baml_language/sdks/rust/bridge_rust/src/runtime.rs:219-229 | baml_language/sdks/rust/bridge_rust/src/runtime.rs:248-258 \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":"baml_language/sdks/rust/bridge_rust/src/runtime.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae41bc052f98b526e27bb2e78782b0a6e12c34f621874d88e6d097b7caf69d7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): engine/cli/src/api_client.rs:58-70 | engine/cli/src/api_client.rs:86-99 | engine/cli/src/api_client.rs:123-134 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 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":"engine/cli/src/api_client.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fd2af4067c071e1334073de64bfafd2fd2e058371ef4fe1a3acbafc9dc1444"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): engine/language_server/src/server/api.rs:380-393 | engine/language_server/src/server/api.rs:422-438 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/server/api.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eae104499db71abcfef8a4c7184f6018ef5843ea93c6c883884ac9eb7c0f714"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): baml_language/sdks/swift/Sources/BamlBridge/Encode.swift:890-900 | baml_language/sdks/swift/Sources/BamlBridge/Encode.swift:916-926 \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":"baml_language/sdks/swift/Sources/BamlBridge/Encode.swift"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07056d820a9dac4d3107966f907356996cec8c1e1b5c97aff19c0eb82222ff5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:5102-5111 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:5113-5119 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":5102}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4e7a663dc11a7c18c8888b5d389c1d094771091f2bd3f46ca7a9d6afdacd65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): baml_language/crates/baml_type/src/normalize.rs:734-739 | baml_language/crates/baml_type/src/normalize.rs:2908-2921 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/normalize.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"713cf1340a74134de86ca52849aeddfdfda39cb163b98c10c9208662d63b3790"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): baml_language/crates/bex_engine/src/lib.rs:781-790 | baml_language/crates/bex_engine/src/lib.rs:940-951 | baml_language/crates/bex_vm_types/src/errors.rs:543-552 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db12dec072708465632132c2fe643a6716f3a1b1274456dc156fa23cec52c4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs:1312-1320 | baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs:1322-1330 | baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs:2220-2228 | baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs:2254-2262 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6da6ac06b536d39b98c66380dab001c3b8d750f83ac8ae1fe1c4178c19e3b10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): baml_language/crates/sys_native/src/io_impls.rs:783-793 | baml_language/crates/sys_native/src/io_impls.rs:840-850 | baml_language/crates/sys_native/src/io_impls.rs:901-911 | baml_language/crates/sys_native/src/io_impls.rs:990-1003 | baml_language/crates/sys_native/src/io_impls.rs:1028-1041 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6346db2f497b5900de832c334c7bf78bf5a9b33f2ce4bbe40ff584472193e0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 6\u002B corresponding lines): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/names.rs:219-226 | baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/names.rs:228-233 | baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/names.rs:235-242 | baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/names.rs:244-249 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 6 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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/names.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf7853451b8ba9073a3c058785e4ff75e97594d96288f4e10ff6418cd403488"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/baml-lib/baml-core/src/ir/repr.rs:725-735 | engine/baml-lib/baml-core/src/ir/repr.rs:740-750 \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":"engine/baml-lib/baml-core/src/ir/repr.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4c3f101110fdc1e175da7e2bbdbf86d56e2212ad8ca74284aefa781ce71f92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/baml-runtime/src/optimize/storage.rs:294-307 | engine/baml-runtime/src/optimize/storage.rs:358-368 \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":"engine/baml-runtime/src/optimize/storage.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0cb9a0885bd5d193f69acd6468eba848e3c99b840c77efb9044e3657a40b8c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): baml_language/crates/baml_compiler2_mir/src/lower.rs:1178-1184 | baml_language/crates/baml_ide/src/search.rs:381-387 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"b706487ffaca89f5c6f39d37d9d24387b1a7e140519117d6537c631d488564f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/crates/bridge_wasm/src/runs.rs:563-575 | baml_language/crates/bridge_wasm/src/runs.rs:582-594 \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":"baml_language/crates/bridge_wasm/src/runs.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29ba4b9cc47cce5b80175625b61b202a69bc2b38f5f2acab1f587322194cec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): baml_language/crates/sys_native/src/host_dispatch.rs:255-264 | baml_language/crates/sys_native/src/host_dispatch.rs:298-306 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_native/src/host_dispatch.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"26615e308f1518bd401863a66ea91c47c9367b4c29c2e8b410f48b6d7e554321"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): baml_language/sdks/python/src/baml_bridge/proto.py:545-560 | baml_language/sdks/python/src/baml_bridge/proto.py:926-940 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/src/baml_bridge/proto.py"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c57db2a41a990a6b6b46ab8794681897976cf4adb056736bbeb7139d1b3683"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:2163-2171 | baml_language/crates/baml_compiler2_ast/src/lower_tree/types.rs:154-161 \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":"baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs"},"region":{"startLine":2163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55ae2fe8efbed63f8203a372c344954e5adb998cc0b33d248f5256b69799d38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): baml_language/crates/baml_fmt/src/ast/expressions.rs:1609-1616 | baml_language/crates/baml_fmt/src/ast/expressions.rs:3508-3514 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"307a52a8b2e038ce3afd73ce9eb44d9a4cd226b56e86cb8fd70de4c53b0ccbf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/crates/baml_lsp_server/src/playground_server.rs:151-162 | baml_language/crates/bridge_wasm/src/runs.rs:397-408 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"7516523d7fab23ea1ad484a61dffb22b3997140937e622ae1b1d6af6d0b644f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): baml_language/crates/bex_events/src/history/mod.rs:636-647 | baml_language/crates/bex_events/src/value/record.rs:563-571 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_events/src/history/mod.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"59bd2295f827106d9c81ab46dc83e2d25fbd7d9dfadb61403c595aa8fedaab03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): baml_language/forks/google-cloud-auth/src/lib.rs:221-230 | baml_language/forks/google-cloud-auth/src/lib.rs:239-247 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/forks/google-cloud-auth/src/lib.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b8b469f349cbab6238267fcf64f628343006b9695bbc21524c92cb5dab2867"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:429-437 | engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs:394-402 | engine/baml-runtime/src/internal/llm_client/primitive/vertex/vertex_client.rs:506-514 \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":"engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"05342fc59c9141e30507cb96f40177c430db7346ef9a2617c158b673c86cb1e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/baml-runtime/src/type_builder/mod.rs:133-141 | engine/baml-runtime/src/type_builder/mod.rs:181-188 \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":"engine/baml-runtime/src/type_builder/mod.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcabde58fd52a7c51432bf75d742713242aad1a25122c9910fc3413f373966b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/language_client_go/baml_go/raw_objects/utils.go:36-46 | engine/language_client_go/pkg/callbacks.go:79-89 \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":"engine/language_client_go/baml_go/raw_objects/utils.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d21872d0ecedaf88906dab0a4667442235f7816a912c2acd4908ba1266f493"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 13\u002B corresponding lines): engine/language_client_go/pkg/rawobjects_collector.go:112-124 | engine/language_client_go/pkg/rawobjects_http_response.go:41-53 | engine/language_client_go/pkg/rawobjects_timing.go:27-39 | engine/language_client_go/pkg/rawobjects_usage.go:27-39 | engine/language_client_go/pkg/rawobjects_usage.go:41-53 | engine/language_client_go/pkg/rawobjects_usage.go:55-67 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/pkg/rawobjects_collector.go"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"984984bd76aee10799a0de4d92c1274fccf3ee1c107d983b1a395fca5fe4f4ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs:1117-1130 | baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs:2552-2564 \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":"baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a93264707e0df3acb14fa7d20b0e99b9a8a8185e6c318af0af4f6abc2dbad1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): baml_language/crates/baml_lsp/src/snapshot.rs:201-209 | baml_language/sdks/python/rust/bridge_python/src/host_value.rs:403-411 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp/src/snapshot.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"8911265cbd9802d506a2ea68917cc7e340831b0563ac53513289a6145e464767"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): baml_language/crates/bex_engine/src/telemetry.rs:423-436 | baml_language/crates/bex_engine/src/telemetry.rs:443-456 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/telemetry.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff6634156a1ccd72b546dba36e6809f48e720d8ec66f2239e27980d75858ffe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): baml_language/crates/bex_sap/src/jsonish/value.rs:364-370 | engine/baml-lib/jsonish/src/jsonish/value.rs:304-310 | engine/baml-lib/jsonish/src/jsonish/value.rs:315-321 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/value.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"979e5c46a342a0874c0b5e6b17079c2435cc3aa31062284d9ea18eb606007660"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/crates/bex_vm_types/src/types/containers.rs:109-123 | baml_language/crates/bex_vm_types/src/types/containers.rs:159-171 \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":"baml_language/crates/bex_vm_types/src/types/containers.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcaf4fd1d085151e8b12064988ab4fbc8364d7cbbd6fb3dea11dbcc8fdaf3918"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/crates/btel_snapshot/src/walk.rs:326-333 | baml_language/crates/btel_snapshot/src/walk.rs:340-347 \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":"baml_language/crates/btel_snapshot/src/walk.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"4951c7bec67b3d1f864728f4d38667d2614da0dd5d3852c2b7e8aaac75da36d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): baml_language/sdks/python/rust/bridge_python/src/encode.rs:209-215 | baml_language/sdks/typescript/bridge_typescript_web/src/encode.rs:269-280 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/bridge_python/src/encode.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4ab3de23e7f9fbe89ebfe516ef09bb3aa57519386fbb812bd2f84a874809a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 8\u002B corresponding lines): engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:257-264 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:266-273 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:495-502 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:504-511 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:613-620 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:622-629 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:785-792 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:794-801 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 8 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 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab966e52a148ab906d30a185b7f4a73e402b9a1f2544c914b2cab2f8a48b742"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:522-530 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:881-889 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"a372125d798d0e201034e04a303bcf8ef2d189648dd8dfe5905cac5e9e7461bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:15273-15281 | baml_language/crates/baml_compiler2_hir_ty/src/infer/unify.rs:212-221 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":15273}}}],"partialFingerprints":{"codehealthFindingId/v1":"461e2921148234fc7e438feed2a9f37b63e83dd36791d4bd94f09a94147ef53e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): baml_language/crates/bex_vm/src/package_baml/csv.rs:2459-2469 | baml_language/crates/bex_vm/src/package_baml/csv.rs:2471-2481 \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":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":2459}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d79ebd2aa8760ec427c52525c43a29b3cde3d6fb1b468b93d69cce874d4321"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): baml_language/crates/bex_vm/src/package_baml/random.rs:104-108 | baml_language/crates/bex_vm/src/package_baml/random.rs:137-141 \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":"baml_language/crates/bex_vm/src/package_baml/random.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb323d47fffb26c800f6011ea97f34d90f7f38b2164d4e1923532aacec595f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/crates/bridge_cffi/src/call_allocation.rs:70-81 | baml_language/crates/bridge_cffi/src/call_allocation.rs:85-99 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_cffi/src/call_allocation.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b2b57269a74eeee64ca506e4f5224ff1682f6f353179c373548ced21be184c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/crates/sys_native/src/io_impls.rs:1518-1527 | baml_language/crates/sys_native/src/io_impls.rs:1543-1552 \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":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":1518}}}],"partialFingerprints":{"codehealthFindingId/v1":"a676b9ffd56854942c132fc991b5cf5858b6d6bfd263fdb60bcb747873c8726d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): baml_language/sdks/rust/sdkgen_rust/src/effect_rename.rs:30-36 | baml_language/sdks/rust/sdkgen_rust/src/host_types.rs:9-15 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/rust/sdkgen_rust/src/effect_rename.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a797889c33a128249b51a9cad3207b75bcd4234c38959af83b723d47671684a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): engine/generators/languages/python/src/package.rs:97-105 | engine/generators/languages/ruby/src/package.rs:92-100 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/python/src/package.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a9918818b43929b47f1dc167b479853a1e71ff4fdc2e2bf222ce6da28943c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/crates/baml_compiler2_hir/src/body_type_refs.rs:346-353 | baml_language/crates/baml_compiler2_hir/src/body_type_refs.rs:390-397 \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":"baml_language/crates/baml_compiler2_hir/src/body_type_refs.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35fa57726eb5f33113cb8558524f4370255c1f53c075f8c3f02696fea95ba26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/crates/baml_compiler2_mir/src/escape.rs:939-951 | baml_language/crates/baml_compiler2_mir/src/escape.rs:1315-1326 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/escape.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4431a8dbc3b3f5862b4aa23797a61b667377e57f353b83fb12cf21e6a3df9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/crates/baml_compiler2_mir/src/lower.rs:4368-4380 | baml_language/crates/baml_compiler2_mir/src/lower.rs:10151-10160 \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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":4368}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf581f8d37d7c10783025a88e3ff79000076eb8c3a4f414f965a61665bb59d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): baml_language/crates/baml_parser/src/items.rs:1112-1121 | baml_language/crates/baml_parser/src/items.rs:1129-1135 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b84a903ad41ec65f6f5d8d3829d26a1fa63bad5d3c69205926b65b52233ea7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/crates/bex_engine/src/conversion.rs:1161-1172 | baml_language/crates/bridge_encode/src/facts.rs:361-372 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/conversion.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efa8540a4bf729af115ffb290aa53a05504d4ab9af2d3c134e0b2c467eece57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs:227-240 | baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs:244-256 | engine/baml-lib/jsonish/src/deserializer/coercer/mod.rs:56-68 | engine/baml-lib/jsonish/src/deserializer/coercer/mod.rs:76-87 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 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":"baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"e053996dcef657dc2f3c28546acad8546178a0e3876eeeaf7004929cc23216b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/crates/bex_vm_types/src/types.rs:952-960 | engine/baml-vm/src/types.rs:330-337 \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":"baml_language/crates/bex_vm_types/src/types.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf4a1ac0862c061454be849fcb1b490e62f194eaecc69268d9c87291a2e796c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): baml_language/crates/bridge_cffi/src/baml_to_host.rs:291-299 | engine/language_client_cffi/src/panic/ffi_safe.rs:4-12 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_cffi/src/baml_to_host.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96d08be662a80f1849d5bb6be24aa0d424376c7ff1120bebbfebcbea9ee48bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:114-128 | engine/baml-runtime/src/internal/llm_client/primitive/openai/openai_client.rs:534-549 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"13961e66c31d643fcaec52c6c578e0af4009d12ce3dfa1bb26c577bc8fa18bf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoWriter.java:196-201 | baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoWriter.java:207-215 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoWriter.java"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85a9006300dfb7ba5be0498985803b6147f5ab5e82b4931cc7f4de9a444c2ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/render.rs:333-340 | baml_language/crates/bex_vm/src/package_reflect/reflect.rs:249-255 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/render.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"528704e3761aab7c0f3253833d2d3310547d674e14df111fb4aa8e42aa9394bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/crates/baml_fmt/src/ast/attributes.rs:53-62 | baml_language/crates/baml_fmt/src/ast/expressions.rs:788-795 \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":"baml_language/crates/baml_fmt/src/ast/attributes.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"437b1f48cf1b146afbd8921af387eb8c27159e728e41e056866d533690156047"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): baml_language/crates/baml_lsp_server/src/playground_http.rs:495-512 | baml_language/crates/bridge_wasm/src/wasm_http.rs:697-707 \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":"baml_language/crates/baml_lsp_server/src/playground_http.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6c6e6aa696a0cab716fe37745cedca03bb6f3313fefd00278d66132451bd88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): baml_language/crates/bex_vm/src/debug.rs:85-97 | baml_language/crates/bex_vm/src/package_baml/csv.rs:2077-2087 | engine/baml-runtime/src/control_flow/mermaid.rs:165-179 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/debug.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7967992d81f635cffdd79f2eb9e4b56e3d2c658382f4dd67dbb7a36f0eb3a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): baml_language/crates/bex_vm/src/package_reflect/type_class.rs:73-83 | baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs:573-583 \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":"baml_language/crates/bex_vm/src/package_reflect/type_class.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"609005953ef1e36d227440d0de56198ff40a4a5dab057497f15b8ee29cddcc47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): baml_language/crates/tools_size_gate/src/config.rs:238-246 | engine/baml-runtime/src/optimize/storage.rs:145-151 | engine/baml-runtime/src/optimize/storage.rs:383-389 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/tools_size_gate/src/config.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db6b25d03d788565aa2039905306f11bbbd65b95280ff87e4b611c3b6852c9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): engine/baml-lib/jsonish/src/deserializer/coercer/mod.rs:283-298 | baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs:581-587 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/deserializer/coercer/mod.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba475d1b818d92bdb786351d8131b6f6bc591bedc9ee2fb913e5f31732bd5bc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:10821-10831 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:10863-10873 \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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":10821}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e36ad7e9b89e22a01499ebe2aa599fbb79fd0a4e9b0821ef90c481d51d4e6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): baml_language/crates/baml_parser/src/expr.rs:661-665 | baml_language/crates/baml_parser/src/items.rs:688-692 \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":"baml_language/crates/baml_parser/src/expr.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb0300a3d4c493ded3aeb8281a7bee1bdd3b0ece6a6e43a79d2f22774ce5f33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): baml_language/crates/baml_sdkgen_types/src/output_writer.rs:972-978 | baml_language/crates/bex_events/src/value/artifact.rs:158-168 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_sdkgen_types/src/output_writer.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afb76702c79a2ff3b7105d91e8690c9d89c1dc5ce0818d2a6e17f8061c23da2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): baml_language/crates/bex_sap/src/baml_value.rs:243-250 | baml_language/crates/bex_sap/src/baml_value.rs:260-267 | engine/baml-lib/jinja-runtime/src/baml_value_to_jinja_value.rs:293-304 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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":"baml_language/crates/bex_sap/src/baml_value.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"c052eca65370bdcd46f0ee704501dfe6683b1883e8b7300dc5125ef5436bafe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:514-525 | engine/baml-lsp-types/src/baml_lsp_types.rs:119-128 \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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa5414ce854e487c019ebbfa89acd3508ec9d6c50b4940a1c4bf67eb39a861f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/TypeRegistry.java:905-917 | baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/TypeRegistry.java:941-954 \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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/TypeRegistry.java"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2c5e6f1d5e9ae4c2f617c01bd3109114969a4bffa731172f86598c2f9bce45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): engine/language_client_go/pkg/rawobjects_class_builder.go:28-40 | engine/language_client_go/pkg/rawobjects_class_property_builder.go:36-48 | engine/language_client_go/pkg/rawobjects_enum_builder.go:46-58 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 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":"engine/language_client_go/pkg/rawobjects_class_builder.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"122a024e99ced493a1cd46ed4f2a9ac62ea23601f58c34e693adb22122f8506d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): engine/language_client_go/pkg/rawobjects_collector.go:41-53 | engine/language_client_go/pkg/rawobjects_llmrenderable.go:87-99 \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":"engine/language_client_go/pkg/rawobjects_collector.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1b7b73471aa7501f3a21fa43edc6f0c037c68fe12793418f7a4f75db4919ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): baml_language/crates/baml_builtins2_codegen/src/codegen_errors.rs:18-32 | baml_language/crates/baml_builtins2_codegen/src/codegen_panics.rs:18-31 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_builtins2_codegen/src/codegen_errors.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b59132c9f4e0e55cfef3dcf7406a87279e428172518b7e4239535384910f9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:230-244 | baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:666-675 \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":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba232b5ac81ea7c6bc6c0c2c5ccba5e135d4cb872876de49f0bf363a7c1edbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/crates/baml_lsp_server/src/engine.rs:358-370 | baml_language/crates/bridge_wasm/src/playground.rs:460-471 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/engine.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28f7a0b6b216dfd2c66ee72a232c86e04d3ac2d40d92355e861b6f444a8c141"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): baml_language/crates/baml_lsp_server/src/engine.rs:427-437 | baml_language/crates/bridge_wasm/src/playground.rs:512-520 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/engine.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6925417097080926b34abe944fd8a26a6022c1425533b81d00649a5ed9f2c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): baml_language/crates/bex_vm/src/package_baml/regex.rs:267-273 | baml_language/crates/bex_vm/src/package_baml/regex.rs:280-286 | baml_language/crates/bex_vm/src/package_baml/regex.rs:293-299 | baml_language/crates/bex_vm/src/package_baml/regex.rs:306-317 \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":"baml_language/crates/bex_vm/src/package_baml/regex.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecebdbce2c741f46b9fa9f9db6eaa23dac28c2feea88ee0431ed2fce6ded7bcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/crates/bridge_cffi/src/call_allocation.rs:145-157 | baml_language/sdks/python/rust/bridge_python/src/callback_dispatch.rs:86-100 \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":"baml_language/crates/bridge_cffi/src/call_allocation.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61f1c6f5531a42bd4f3f87d74498027c7673156285ccebdbf71b121470146e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): baml_language/crates/bridge_wasm/src/wasm_time.rs:106-116 | baml_language/crates/sys_native/src/io_impls.rs:104-114 | baml_language/crates/sys_wasm/src/web_sysops.rs:26-34 \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":"baml_language/crates/bridge_wasm/src/wasm_time.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"904f23e1a6dcf4cd199debb237f8a9ab993ebb0c814a78b2c60d82c9037ece29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/baml-schema-wasm/src/js_callback_bridge.rs:85-92 | engine/baml-schema-wasm/src/js_callback_bridge.rs:98-105 \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":"engine/baml-schema-wasm/src/js_callback_bridge.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dea98b0b821e6fe27a6c44186406a3ab48a1766ac45d46cd5b7107a07a32aa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): engine/baml-runtime/src/internal/llm_client/primitive/openai/openai_client.rs:88-103 | engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:329-344 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/openai/openai_client.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"710ac424a87b8da9adf17ebe68fcd315d0bc94236a37b73c1f6c3f8202195076"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/baml-runtime/src/internal/llm_client/strategy/roundrobin.rs:84-94 | engine/baml-runtime/src/internal/llm_client/strategy/fallback.rs:45-52 \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":"engine/baml-runtime/src/internal/llm_client/strategy/roundrobin.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"95aca673ad664bc0122c0512c1bbcfe23e33f702619b4c878a82f8bce7209dd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): baml_language/sdks/go/baml_go/native_unix.go:284-290 | baml_language/sdks/go/baml_go/native_unix.go:296-302 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/native_unix.go"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"1557c01a21b0253887a227dadbe132e1addd6923ae300111009a5008f12cbb27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): baml_language/sdks/swift/Sources/BamlBridge/Decode.swift:461-468 | baml_language/sdks/swift/Sources/BamlBridge/Prompt.swift:61-67 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/Decode.swift"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb35d1e39e3aaa52792f16eb738852e77916bbb532f1a5b951dda3701391a11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/crates/baml_cli/src/project_load.rs:416-423 | baml_language/crates/baml_db/src/testing.rs:62-69 \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":"baml_language/crates/baml_cli/src/project_load.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de89b005b0a8cb781b44b85cb3db3d82f23068fb03b34deffa58aaf922fc39e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): baml_language/crates/baml_compiler2_emit/src/refs.rs:72-81 | baml_language/crates/baml_compiler2_hir_ty/src/layout.rs:120-129 | baml_language/crates/baml_compiler2_hir_ty/src/layout.rs:143-152 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/refs.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e15609d3a05e369a24bb7e463d272ebdd86d160b7b45142415ba0120e5e5e12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/crates/baml_compiler2_hir/src/body.rs:76-85 | baml_language/crates/baml_compiler2_hir/src/body.rs:122-131 \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":"baml_language/crates/baml_compiler2_hir/src/body.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"664918ae9428f9adcad94b1ff3b2e4c3e363de0abc8e8f06f97981ed4af81cd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): baml_language/crates/baml_lsp_server/src/playground_server.rs:599-611 | baml_language/crates/bridge_wasm/src/runs.rs:544-556 \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":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf91ab88c83713c5e62579c7268cb37b17bceee6032599c4c902e0185518890c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): baml_language/crates/bex_vm/src/package_baml/ops_math.rs:283-290 | baml_language/crates/bex_vm/src/package_baml/ops_math.rs:320-326 | baml_language/crates/bex_vm/src/package_baml/ops_math.rs:356-363 | baml_language/crates/bex_vm/src/package_baml/ops_math.rs:393-399 \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":"baml_language/crates/bex_vm/src/package_baml/ops_math.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e837cd2d6c55453666d803debfdc7a9ceae5d19a50879ee70eaa39d2a80aa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): baml_language/crates/bex_vm/src/package_reflect/type_class.rs:991-999 | baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs:1533-1541 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/type_class.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c894e02eb44951e568e9070e5b3e18dc30301bbeabddc001d566989595aad72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/crates/bridge_wasm/src/runs.rs:114-125 | baml_language/crates/bridge_wasm/src/runs.rs:190-202 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_wasm/src/runs.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b3ed4e2f0c9010b2dbb1d50b52f57bf9c7961ec947d579e5197d593fc41144"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs:107-112 | baml_language/crates/baml_compiler2_mir/src/lower.rs:143-152 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4d0d51146e3e414724a923cc37782a5a83991aa1c45f5508fb42202a1941f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/crates/bex_sap/src/jsonish/value.rs:333-340 | engine/baml-lib/jsonish/src/jsonish/value.rs:275-283 \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":"baml_language/crates/bex_sap/src/jsonish/value.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6c666ddaffed739b70d680652563b7d776143cf46f8cdd28b9fec778c54629"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): baml_language/crates/bex_vm/src/types.rs:25-33 | engine/baml-vm/src/types.rs:246-255 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/types.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e57d76ae9a82a4fae10b537b613ae7f02390114ccdce80ca85b31f8a338a22c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): baml_language/crates/bridge_wasm/src/wasm_io.rs:69-79 | baml_language/crates/baml_lsp_server/src/playground_io.rs:146-154 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_wasm/src/wasm_io.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a59dca7954a1b3c3e66d6bda0dc6d7b903bcba0a5da9ac6a26dc292bf766d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:533-536 | baml_language/crates/baml_type/src/unify.rs:1038-1041 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c79f51d2f82018e5de1bc674bcb77fefd47f5cc830af6b9179d984bf50662a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/crates/bex_sap/src/baml_value.rs:232-239 | engine/baml-lib/jinja-runtime/src/baml_value_to_jinja_value.rs:378-387 \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":"baml_language/crates/bex_sap/src/baml_value.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e18866f6b47acb713c1760cbcf50248e9d29f5d0c01db24b017551dbdce913"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): baml_language/sdks/rust/bridge_rust/src/function.rs:251-259 | baml_language/sdks/rust/bridge_rust/src/rust_type.rs:31-39 | baml_language/sdks/rust/bridge_rust/src/spec.rs:77-85 \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":"baml_language/sdks/rust/bridge_rust/src/function.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cec4fd6c20fe371fee11d1309593819ba5c291c533c6ea8a36307b94ffd04ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:56-67 | engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs:48-59 | engine/baml-runtime/src/internal/llm_client/strategy/fallback.rs:29-38 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f323721b0da68675f1164a3dc96d38c515568c8903dee9e985c9e4bbc88fde1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:1812-1821 | baml_language/crates/baml_ide/src/export.rs:729-736 \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":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":1812}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbdc87db0bc17902a77d97272aa02225b534c4f20e40547931300004bdbac7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:2334-2343 | baml_language/crates/baml_ide/src/export.rs:720-727 \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":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":2334}}}],"partialFingerprints":{"codehealthFindingId/v1":"256e886759e5159d32a272cabf392583ee58a0edd203b5e6043e2a01c423d945"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): baml_language/crates/baml_parser/src/expr.rs:631-635 | baml_language/crates/baml_parser/src/items.rs:628-632 \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":"baml_language/crates/baml_parser/src/expr.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c48d6b009feeca7acfef8ab53557f2fc284d90cc63f322fb65beabe88d76c91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): baml_language/crates/baml_query_btel/src/ingest.rs:103-108 | baml_language/crates/btel_recorder/src/lib.rs:35-40 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba616abe69297aff3f34be28776449f2cae27f69b9131a9b69529761baa63dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): baml_language/crates/bex_vm/src/package_baml/resolve.rs:1304-1309 | baml_language/crates/bex_vm/src/package_baml/resolve.rs:1315-1326 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/resolve.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5f23a0ee61141b8b2b185799ed07d505cbcb730c10ac874017dc2b4c555eb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/crates/bridge_cffi/src/ffi/callbacks.rs:17-30 | engine/language_client_cffi/src/ffi/callbacks.rs:116-127 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_cffi/src/ffi/callbacks.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"731821a4addbba144736c8ca5f301b5ffd2d8717d08e886d963aa9327133216c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): engine/baml-lib/baml-core/src/ir/ir_hasher/class.rs:38-46 | engine/baml-lib/baml-core/src/ir/ir_hasher/enum.rs:36-45 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/ir/ir_hasher/class.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f425e9fbdc80056667549c57b7adbc16e613108694eb8e3c486afdcf6352b4cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): engine/baml-lib/llm-client/src/clients/fallback.rs:22-27 | engine/baml-lib/llm-client/src/clients/round_robin.rs:24-30 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/llm-client/src/clients/fallback.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"988afb76fcdbbcddd88a0bb1866b1dd004414ccda29c1290f45c556f9eecf1b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): engine/generators/languages/python/src/type.rs:43-50 | engine/generators/languages/typescript/src/type.rs:20-26 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/python/src/type.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"833304890b2cbb4359944ccd144dd57c27c37ad501525690b43ee4c0b44c3db0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): baml_language/sdks/go/baml_go/invocation.go:35-43 | baml_language/sdks/go/baml_go/runtime.go:365-376 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/invocation.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f65e99ebdc7f465a6bc3de6a94cc888d6799ffa6830c4bd020d64a065df386"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): baml_language/crates/baml_builtins2_codegen/src/codegen.rs:670-680 | baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:766-772 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_builtins2_codegen/src/codegen.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fadbc5449c714c26a839b9be8a1f19bce739a96e5019c31f70d2029c8c8637c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/crates/baml_compiler2_hir/src/builder.rs:1254-1263 | baml_language/crates/baml_compiler2_mir/src/lower.rs:2543-2552 \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":"baml_language/crates/baml_compiler2_hir/src/builder.rs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"11964515de3844983342aeabd036591d92ac0d989998b889fc720306c4df87df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): baml_language/crates/bex_external_types/src/handle.rs:187-193 | baml_language/crates/btel_types/src/context.rs:52-58 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_external_types/src/handle.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32225166b4397cb4512a903a57c8d3b48ae7854661063c8ab25d091329c1d3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/crates/bex_vm_types/src/bytecode.rs:1970-1979 | engine/baml-vm/src/bytecode.rs:303-313 \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":"baml_language/crates/bex_vm_types/src/bytecode.rs"},"region":{"startLine":1970}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7e3908066f734de402c8773fc7e80efb127c4edaed689cfbf4305d51b535cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/sdks/csharp/sdkgen_csharp/src/hash.rs:1-12 | baml_language/crates/baml_sdkgen_types/src/output_writer.rs:1577-1584 \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":"baml_language/sdks/csharp/sdkgen_csharp/src/hash.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12be93eeebca35be4366faa03d39951c1327f21f747c62bf970a94f8d6a7413"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:542-547 | baml_language/crates/baml_type/src/unify.rs:1052-1054 \u2014 These two members are one piece of code written twice and then edited apart: 3 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":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ae560f034d58186d7b31cc9d8fcd4dd57af83240a1068b3c7d3ae95f94ba4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): engine/generators/languages/python/src/package.rs:87-95 | engine/generators/languages/ruby/src/package.rs:82-90 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/python/src/package.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fafe91d54a1d0b20033243179234f16e8917ab58c09d335ee2a751b343d0903"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): engine/language_client_python/src/types/log_collector.rs:54-62 | engine/language_client_ruby/ext/ruby_ffi/src/types/log_collector.rs:92-100 | engine/language_client_typescript/src/types/log_collector.rs:41-49 \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":"engine/language_client_ruby/ext/ruby_ffi/src/types/log_collector.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e346a7254bf4f580d06f0275e4b0765c1fc88889857541fc0efd72ec041492"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): baml_language/crates/baml_compiler2_mir/src/lower.rs:685-692 | baml_language/crates/baml_compiler2_rust/src/analysis.rs:761-767 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be747ef5f4b9f09533a0c26106947893768014c35188bbe5347d6c848164d50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): engine/baml-compiler/src/hir/dump.rs:51-56 | engine/baml-runtime/src/cli/repl.rs:824-829 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/hir/dump.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"565043f1df14e3731ce47acdfbf7b2a86caa0a4219f3c6c17fe2372338761b92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): baml_language/sdks/go/baml_go/prompt.go:93-99 | baml_language/sdks/go/baml_go/stream.go:64-71 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/prompt.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bff90b86a25298b94494a1e30ff44a27663c9f91fb16803d969fee36143390"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/crates/baml_compiler2_emit/src/lib.rs:251-258 | baml_language/crates/baml_compiler2_hir/src/signature.rs:190-197 \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":"baml_language/crates/baml_compiler2_emit/src/lib.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c854439a8274648bb2c2c48aec69a79cd45ce1e8eefb4537e06e354444faf58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/crates/bex_vm/src/package_baml/prompt.rs:341-348 | baml_language/crates/bex_vm/src/package_baml/root.rs:527-534 \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":"baml_language/crates/bex_vm/src/package_baml/prompt.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"287456405ada1632e203a5aa0a55a250b682becd074e5b4f00539ce83a435951"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): baml_language/crates/bex_vm/src/vm.rs:3864-3870 | baml_language/crates/bex_vm/src/vm/compiled_rt/record.rs:585-591 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":3864}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cac36ed5583cfdd25c9799d6a15a35a30b033816efd297134fb484e9b3ae26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): baml_language/crates/tools_size_gate/src/baseline.rs:102-108 | baml_language/crates/tools_size_gate/src/human_size.rs:77-83 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/tools_size_gate/src/baseline.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"27697d3c1d6db609eea0c464a52bb02efed26d3e3ff308f8a5fa32524dc76bbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): engine/baml-runtime/src/cli/check.rs:32-41 | engine/baml-runtime/src/cli/generate.rs:32-41 \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":"engine/baml-runtime/src/cli/check.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af0a15db1b30ef814c4adaae44b96f0e3be917381b2e73c5a071f1f8cb9c6f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/crates/baml_compiler2_visualization/src/control_flow/mod.rs:383-394 | engine/baml-runtime/src/control_flow.rs:924-933 \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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/mod.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"630349345b81230a52879c14c63ab1e75d44d6711f924b66da502a4e60ee4125"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): baml_language/crates/bex_cache/src/lib.rs:839-846 | baml_language/crates/btel_reader/src/discovery.rs:174-181 | engine/baml-lib/ast/src/parser/parse.rs:249-258 | engine/baml-lib/prompt-parser/src/parser/parse_prompt.rs:493-502 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 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":"baml_language/crates/bex_cache/src/lib.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2d338564c2a04fa281152659b87070e63a82057087ce97ebece54c1714e1cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): baml_language/crates/bex_vm/src/package_baml/json/mod.rs:728-732 | baml_language/crates/bex_vm/src/package_baml/spawn.rs:113-117 \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":"baml_language/crates/bex_vm/src/package_baml/json/mod.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8fe45fec7f98dfb91141de7b492270b0b6a5cdb07036ed051231a07130fdfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): baml_language/forks/aws-config/src/lib.rs:253-261 | baml_language/forks/aws-config/src/providers.rs:109-117 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/forks/aws-config/src/lib.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"be784ae8a25bb8dbdcdb88c6cc8bbb3b44eeedde071a9e4ca41575fde7f8e2c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): engine/generators/languages/go/src/ir_to_go/type_aliases.rs:12-20 | engine/generators/languages/rust/src/ir_to_rust/type_aliases.rs:12-20 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/go/src/ir_to_go/type_aliases.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"691bb21605f1844139d7691330ace6647175d2a19c434284025d7ea6d906280a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/sdks/go/baml_go/class.go:221-228 | baml_language/sdks/go/baml_go/optional.go:66-73 \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":"baml_language/sdks/go/baml_go/class.go"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7104cd879a0a327988dc47eeb5d65c6f6098b3b9d6ae44a3e8c8d8d28efcd74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/sdks/go/baml_go/class.go:257-264 | baml_language/sdks/go/baml_go/optional.go:75-82 \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":"baml_language/sdks/go/baml_go/class.go"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"28279d6049ed5f7c3792c6fc226f6cfd6f0614a733539fd1b12e7125ef8ee763"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlError.java:26-31 | baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlTypeMismatchError.java:22-27 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlError.java"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"132419865ddab38cc8f45c91bb4ec24ea4313a9695efd2f3b6166ebe952d9758"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:932-938 | baml_language/crates/baml_compiler2_hir_ty/src/globals.rs:306-309 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a2c97793120270d62a205f0b2d061eaba6c8199d2904b5dee702906b0f49e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/crates/baml_type/src/simplify_sap.rs:157-164 | baml_language/sdks/rust/sdkgen_rust/src/unions.rs:328-335 \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":"baml_language/crates/baml_type/src/simplify_sap.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5b33f96b9ed8141a5c0ad37bc8098be19758a16c9f0477714ceb57674a709d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/crates/sys_native/src/io_impls.rs:2288-2295 | baml_language/crates/sys_wasm/src/web_sysops.rs:793-800 \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":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":2288}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c38b642b1fad071a75a8eefcedd3233b57d25519634d57bddd6889463e14e59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs:252-258 | engine/baml-runtime/src/internal/llm_client/primitive/request.rs:114-121 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c445264d0567210ab79393c346531cec35d9e93566d1d9162b77a5d5f0ca60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): baml_language/crates/bex_external_types/src/runtime_ty_identity.rs:89-95 | baml_language/crates/bex_vm/src/package_baml/resolve.rs:1214-1220 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_external_types/src/runtime_ty_identity.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20e2fda40c5b800c8cef37ffb1397354d67d025a7d07b389075e6d9a1544e44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): baml_language/crates/bex_vm/src/package_baml/csv.rs:1699-1710 | baml_language/crates/bex_vm/src/package_baml/json/mod.rs:68-74 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf0aec8631a76a9fdebacd8069509ac73fb6ec6cd0ee2d38b0865beb3da66ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): baml_language/crates/bex_vm_types/src/types/function.rs:748-754 | engine/baml-vm/src/types.rs:435-441 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm_types/src/types/function.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"00cbb540adf083fecbde2d0a09a841cd5aa31856a038efb71c5cb47a581321b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/generators/languages/ruby/src/package.rs:38-45 | engine/generators/languages/rust/src/package.rs:24-33 \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":"engine/generators/languages/ruby/src/package.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ccda165f31d4b0b5caffbf233b509f6ced2090a707800a1710a173a4171621"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:1989-1992 | baml_language/crates/baml_ide/src/export.rs:738-745 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":1989}}}],"partialFingerprints":{"codehealthFindingId/v1":"73417a406aa2d29e5bf550975716e78247e3aff83682655d540a8400a25adccf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): baml_language/crates/baml_compiler2_emit/src/refs.rs:87-96 | baml_language/crates/baml_compiler2_hir_ty/src/layout.rs:112-117 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/refs.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"540d45ac147111bdf2b70b29f60f54a227c53dbd5dd544978c8c31f1d3744082"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/crates/bex_vm/src/package_baml/future.rs:25-35 | baml_language/crates/bex_vm/src/vm.rs:2144-2151 \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":"baml_language/crates/bex_vm/src/package_baml/future.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50ae29c65051ff674c11acb420bd20a390fcb73b32ac319f2125d7ce47855f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/generators/data/recursive_types/go/main.go:7-15 | engine/generators/data/sample/go/main.go:7-14 \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":"engine/generators/data/recursive_types/go/main.go"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2307a2d3bdcc9c7424b090560af53ae93ca34f8abf6093ad2d03a7903e7006"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): baml_language/crates/baml_builtins2_codegen/src/codegen.rs:691-701 | baml_language/crates/baml_compiler2_ast/src/lower_cst.rs:316-328 \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":"baml_language/crates/baml_builtins2_codegen/src/codegen.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"b175d5b4567d42985611ded5cc175950d5a449dbeb971fc6255816547d39082f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/callable.rs:280-286 | baml_language/crates/baml_compiler2_hir_ty/src/package_interface.rs:562-568 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/callable.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"a460ea175e7fb7537b48be1894b842aab73f59f3011c5a6d6178c0f6bcea34bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): baml_language/crates/baml_ide/src/search.rs:319-324 | baml_language/crates/baml_ide/src/symbols.rs:149-157 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/search.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ed65de1c8065659e106ef95df5f2ecb5f2f1f1dce2b57e4fd618e6aac1536e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): baml_language/crates/baml_lsp_server/src/engine.rs:313-320 | baml_language/crates/bridge_wasm/src/playground.rs:547-552 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/engine.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"34744c2bef5b26e525413718a3a2ae768ba4180243e4954010dcfccc60def143"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): baml_language/crates/baml_lsp_server/src/playground_server.rs:77-83 | baml_language/crates/bex_events/src/run.rs:1561-1567 | baml_language/crates/bridge_wasm/src/runs.rs:257-263 \u2014 These 3 members are one piece of code written 3 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 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afaf6d1d7c93cf7302adce17f7eb6818b574b4d7b0a2b1c92434833a59c0726"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:373-382 | baml_language/sdks/swift/rust/sdkgen_swift/src/lib.rs:581-590 \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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1322c1c5a3a6bff6e4ae65dc75cc6d6ac012928b8742cc41f716172c062d59c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): baml_language/sdks/swift/rust/sdkgen_swift/src/lib.rs:744-807 | engine/generators/languages/rust/src/utils.rs:12-26 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/rust/sdkgen_swift/src/lib.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b65428192d39bfd2457b9ed907f193c1a5902f50c060cf54c979ecb9e937e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): baml_language/crates/baml_type/src/lib.rs:194-201 | baml_language/crates/bridge_encode/src/facts.rs:351-358 | baml_language/crates/bridge_encode/src/plan.rs:1547-1554 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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":"baml_language/crates/baml_type/src/lib.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85fa40f94c3792bb46d31de96b59e57393ffae34b603e96bfdcc21b5689d055"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): baml_language/crates/bex_vm/src/package_baml/array.rs:367-379 | baml_language/crates/bex_vm/src/package_baml/json/encode.rs:392-403 | baml_language/crates/bex_vm/src/package_baml/ops.rs:656-665 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/array.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4c9584bc922ce3ad52915986d8b948695432a387e19c692ff30e53d959cf64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): engine/language_client_python/src/types/log_collector.rs:454-462 | engine/language_client_ruby/ext/ruby_ffi/src/types/log_collector.rs:337-345 | engine/language_client_typescript/src/types/log_collector.rs:271-279 \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":"engine/language_client_ruby/ext/ruby_ffi/src/types/log_collector.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"296f3f10647b834da6ec54c83fe8fc0ca8c9dc0f7a8c6ad92beb8eb833042024"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:3405-3410 | baml_language/crates/baml_lsp_server/src/playground_http.rs:54-59 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":3405}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c265134e4324c4e16d4eede83e3a7709ace07b50a039d3d541791f969ee302f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): baml_language/crates/baml_compiler2_hir_ty/src/render.rs:120-125 | baml_language/crates/bex_vm/src/package_load.rs:746-751 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/render.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7ba8dc04d1a3554ce7356ef6fe11443e017f534bc6c79c04ad2f34c3c5c370"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): baml_language/sdks/go/sdkgen_go/src/lib.rs:3270-3278 | baml_language/sdks/go/sdkgen_go/src/names.rs:1195-1203 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":3270}}}],"partialFingerprints":{"codehealthFindingId/v1":"9685d5a338425bb31441b301e2d59d00c857c6e45fdd5c18f127d0a089fba419"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): baml_language/crates/baml_syntax_macros/src/lib.rs:83-88 | languages/rust/baml-macros/src/lib.rs:104-109 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_syntax_macros/src/lib.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5d3ced18dc9d17a6b9190d48d7aa6d0c7301ee85758b4bd6bc25bebe7fa571"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): baml_language/crates/bex_engine/src/thread.rs:69-71 | baml_language/crates/bex_vm/src/package_baml/spawn.rs:60-62 \u2014 These two members are one piece of code written twice and then edited apart: 3 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":"baml_language/crates/bex_engine/src/thread.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36ccf8ecc00237084ba08700f89a9594131750e62ad781f0a90d4ec00993787"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): baml_language/sdks/csharp/sdkgen_csharp/src/output.rs:246-251 | baml_language/sdks/go/sdkgen_go/src/packages.rs:167-172 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/sdkgen_csharp/src/output.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd89c073858b3f898b5e8a37601f76beb25aaaa4b271fa6781d6f7bd5f550c1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): engine/language_client_cffi/src/ffi/objects.rs:27-30 | engine/language_client_cffi/src/raw_ptr_wrapper.rs:22-25 | languages/rust/baml/src/raw_objects/mod.rs:25-28 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 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":"engine/language_client_cffi/src/ffi/objects.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5b45d16c2b8d52a6bae9960b6c3c8265d2b3b3a44c481815d61829f3707da9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): languages/rust/baml/src/codec/from_baml_value.rs:78-83 | languages/rust/baml/src/codec/from_baml_value_ref.rs:91-96 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"languages/rust/baml/src/codec/from_baml_value.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33cd45fa1621dfb0297ba1e21989081aa12580d07efeb2a0c04cd806d6fd704"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): languages/rust/baml/src/codec/from_baml_value.rs:88-93 | languages/rust/baml/src/codec/from_baml_value_ref.rs:101-106 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"languages/rust/baml/src/codec/from_baml_value.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cac9056aa2a09516737d8e37d5b4c2a9aab074c6b5338b95592b5e2f147874d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): languages/rust/baml/src/codec/from_baml_value.rs:98-103 | languages/rust/baml/src/codec/from_baml_value_ref.rs:111-116 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"languages/rust/baml/src/codec/from_baml_value.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"024d03b113fef93195034ef69ceac230682bc0d973dc294cb5adc0a0a0764c18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): baml_language/crates/bex_engine/src/trace_heap.rs:277-283 | baml_language/crates/btel_bcs/src/body.rs:169-175 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/trace_heap.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c23e3e251d5acd349016f1970d571c8d1cb6ada5b32738e962c06098fdc806"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): baml_language/crates/sys_ops/src/lib.rs:1297-1302 | baml_language/crates/sys_wasm/src/web_sysops.rs:183-188 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_ops/src/lib.rs"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"123f7f9a11af939e0e66190bc01f9797dfa25c0a5883c07a7ba5b005ebbe21bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/lib.rs:529-536 | baml_language/sdks/typescript/sdkgen_typescript_shared/src/lib.rs:242-249 \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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/lib.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"6419016e27d98e4cc78bcccd184d155143569a39fa88d29ce83e25bb00f7ab29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): baml_language/crates/baml_compiler2_metrics/src/npath.rs:155-159 | baml_language/crates/baml_compiler2_metrics/src/structure.rs:309-313 \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":"baml_language/crates/baml_compiler2_metrics/src/npath.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e4d67ef28dd2cb218b026af212ecc20209f076bddef930532ac15b03376007"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:1703-1706 | baml_language/sdks/typescript/sdkgen_typescript_shared/src/leaf.rs:1116-1119 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ddd231c7ab1a50651186ca64e9a3bab9bec2fffe3374bc8c16ffbe7ad42495c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): baml_language/crates/bex_vm/src/package_baml/csv.rs:164-169 | baml_language/crates/bex_vm/src/package_baml/regex.rs:198-203 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"26da81531112617a2f31c2daae22bd1229e7f870e40342f4209f48c9a4e75bd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): baml_language/crates/baml_lsp_server/src/engine.rs:378-384 | baml_language/crates/bridge_wasm/src/playground.rs:474-479 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/engine.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fca26e6a3e255ef0e2593c1101d43d2197e9b81eec305326941801a4fe4040e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): baml_language/sdks/java/sdkgen_java/src/emit.rs:105-111 | baml_language/sdks/typescript/sdkgen_typescript_shared/src/leaf.rs:558-565 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/sdkgen_java/src/emit.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c9d388a16db096aeb8e2391c4e55fed2c609b15488d3eae01de29b64f9b59c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (189 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:537-725 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:572-760 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 586 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:537\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn process_token( \u0026mut\u0060 in one and \u0060\u0026mut\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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e89638b0e1a223e04b34ddf6ac2323fc8dc5cf93124432dd8e691d7c7ba166"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (128\u2013129 lines \u00D7 2): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2140-2268 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2697-2824 \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 \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2140\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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":2140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d15866b0df51bc4037b0f42b72fed83fdb154005e4d481ff8ceb7e4c109f8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (92\u201396 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:259-354 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:289-380 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 586 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:259\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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af6a3e77f143767e614d188013e37c69675d6e3d69fdd081154a07187d39bbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (89 lines \u00D7 2): engine/baml-compiler/src/thir/interpret.rs:1082-1170 | engine/baml-compiler/src/thir/interpret.rs:1175-1263 \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":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"3590752dca3dd5a38f3b2e9a5b32aa8ad50a896ca6770289c6de14c4ac88d056"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (97 lines \u00D7 2): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1487-1583 | engine/language_server/src/baml_project/mod.rs:887-983 \u2014 before extracting anything, compare \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs\u0060 and \u0060engine/language_server/src/baml_project/mod.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 183 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1487\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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffeb275c560fef828eb737281d62acc292b992dcada82a215c031443dc76d60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (62\u201369 lines \u00D7 2): baml_language/sdks/csharp/bridge_csharp/src/Cffi/NativeApi.cs:128-196 | baml_language/sdks/csharp/bridge_csharp/src/Cffi/NativeApi.cs:209-270 \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 \u0060baml_language/sdks/csharp/bridge_csharp/src/Cffi/NativeApi.cs:128\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":"baml_language/sdks/csharp/bridge_csharp/src/Cffi/NativeApi.cs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e862dfa23a5b887af03b49907f50a75bb3b7d7fc1cd50526952d80f214ab899f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44\u201366 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:5222-5287 | baml_language/crates/baml_compiler2_mir/src/lower.rs:5751-5794 \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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":5222}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2035cb9ac5cea2aafd8d0a7e1906451982ab950c72eae0f935bea6dd8a071d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (63 lines \u00D7 2): baml_language/crates/bridge_wasm/src/runs.rs:718-780 | baml_language/crates/bridge_wasm/src/runs.rs:860-922 \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 \u0060baml_language/crates/bridge_wasm/src/runs.rs:718\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":"baml_language/crates/bridge_wasm/src/runs.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cb8168f3edb800ba6593929c1ec7be125badb1a6960ff06d74ac47fc5db7bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (62 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/dedent.rs:8-69 | engine/bstd/src/dedent.rs:7-68 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/dedent.rs\u0060 and \u0060engine/bstd/src/dedent.rs\u0060 as WHOLE FILES: 96% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/dedent.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30774d61c2dc57d0a2d1e74e29494ee71a98a61b34a227cee6662bce39fe6c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (59 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs:181-239 | engine/baml-lib/jsonish/src/deserializer/deserialize_flags.rs:190-248 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs\u0060 and \u0060engine/baml-lib/jsonish/src/deserializer/deserialize_flags.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 127 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"83330d695edd073b640691e139c6db1356eaa6917a00883f9b9f14f48a44f3ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (92\u2013103 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:256-347 | baml_language/crates/baml_type/src/unify.rs:557-659 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs\u0060 and \u0060baml_language/crates/baml_type/src/unify.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 452 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:256\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":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"363189a2e4bbc38964d28982fff23dd6ed23affa12485703d1928c73177edde4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (57 lines \u00D7 3): engine/baml-lib/baml-types/src/baml_value.rs:555-611 | engine/baml-lib/baml-types/src/baml_value.rs:694-750 | engine/baml-lib/baml-types/src/baml_value.rs:830-886 \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 \u0060engine/baml-lib/baml-types/src/baml_value.rs:555\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060field_type\u0060 to \u0060\u0026TypeIR\u0060 in one and \u0060\u0026TypeNonStreaming\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":"engine/baml-lib/baml-types/src/baml_value.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78af1a8ee39052230133af39ecec48a80e9df5edd552232bcc358731cf9b6dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (56 lines \u00D7 2): baml_language/crates/baml_lsp_server/src/playground_http.rs:367-422 | baml_language/crates/baml_lsp_server/src/playground_http.rs:426-481 \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":"baml_language/crates/baml_lsp_server/src/playground_http.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c4ce6014e12b14ad7b87a4ebd1930043f5eb11e24d21187b82022943a83f2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (53 lines \u00D7 2): baml_language/crates/bex_vm/src/vm.rs:5470-5522 | baml_language/crates/bex_vm/src/vm.rs:5584-5636 \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 \u0060baml_language/crates/bex_vm/src/vm.rs:5470\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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":5470}}}],"partialFingerprints":{"codehealthFindingId/v1":"01539cac5936ac6bf10f1259566caab59a797b402a7c9c742e822d9c09e52ae3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (50\u201352 lines \u00D7 2): baml_language/sdks/python/rust/bridge_python/src/encode.rs:221-272 | baml_language/sdks/typescript/bridge_typescript_web/src/encode.rs:291-340 \u2014 before extracting anything, compare \u0060baml_language/sdks/python/rust/bridge_python/src/encode.rs\u0060 and \u0060baml_language/sdks/typescript/bridge_typescript_web/src/encode.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/bridge_python/src/encode.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbda82aba02e9d198108b2993e917988478c114e57570b15c0239b3bfed7e29e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48\u201350 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:626-673 | baml_language/crates/baml_type/src/unify.rs:1152-1201 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs\u0060 and \u0060baml_language/crates/baml_type/src/unify.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 452 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:626\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c93eb04a9d4598656df120c0d062e977a02e622d877bcc0d059de88060336bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (54\u201356 lines \u00D7 2): baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:430-485 | engine/baml-runtime/src/control_flow/flatten/step2_hoist_branch_arms.rs:20-73 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:430\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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"5905fb8040ecdcb072c7aa029ad6cf2ffe987bbfaad79c3c4d55e2c0954c5348"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2): engine/baml-lib/baml-derive/src/lib.rs:149-198 | engine/baml-lib/baml-derive/src/lib.rs:211-260 \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 \u0060engine/baml-lib/baml-derive/src/lib.rs:149\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":"engine/baml-lib/baml-derive/src/lib.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea977a688f0915b5db1a7b2090c830ebdc6b2327f8201a0f2d97cd7009bf4262"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2): baml_language/crates/bex_events/src/history/mod.rs:747-795 | baml_language/crates/bex_events/src/run.rs:1570-1618 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"baml_language/crates/bex_events/src/history/mod.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8c275b222e1ad932f5b5be9cccbd9030bac01eef5f3fcd6f06f7397b80fa05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:311-357 | baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:407-453 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"9230e535fb711289f117a8c2ca2c9e98e652ac3cd4ad4f6537208ebc114b081d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 3): engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs:770-814 | engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs:836-880 | engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs:903-947 \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 \u0060engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs:770\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs:835\u0060 calls \u0060walk_classes\u0060 and \u0060engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs:766\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39fa5e2ada7db4efedef958f82191c6e3535398010f3d8a6522ff04029d4b27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/optimize.rs:155-199 | baml_language/crates/baml_compiler2_mir/src/optimize.rs:227-271 \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 \u0060baml_language/crates/baml_compiler2_mir/src/optimize.rs:155\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":"baml_language/crates/baml_compiler2_mir/src/optimize.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b797b9587d2048f96531490cb0824a7a895534b2cea14eb289283e9038e3135"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): engine/generators/languages/go/src/ir_to_go/mod.rs:158-200 | engine/generators/languages/rust/src/ir_to_rust/mod.rs:176-218 \u2014 before extracting anything, compare \u0060engine/generators/languages/go/src/ir_to_go/mod.rs\u0060 and \u0060engine/generators/languages/rust/src/ir_to_rust/mod.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 208 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/generators/languages/go/src/ir_to_go/mod.rs:158\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":"engine/generators/languages/go/src/ir_to_go/mod.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"a095d7b0f647b6d37c185ffae31816aff6c9c9ad35369d8123671d21b7f5c357"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): baml_language/crates/baml_compiler2_visualization/src/control_flow/mod.rs:397-438 | engine/baml-runtime/src/control_flow.rs:936-977 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/mod.rs\u0060 and \u0060engine/baml-runtime/src/control_flow.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 94 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_visualization/src/control_flow/mod.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d97b87c0e3793628096b6d31b25adc4f8f0c9d8bd577e4f9a1127c93df746c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): baml_language/sdks/go/sdkgen_go/src/lib.rs:875-916 | baml_language/sdks/go/sdkgen_go/src/lib.rs:956-997 \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 \u0060baml_language/sdks/go/sdkgen_go/src/lib.rs:875\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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e13f21318c2d7ea7a5a18aa0ba8f8792e315f7794b6393ca7d77812a7df85a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:1691-1731 | baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:1774-1814 \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 \u0060baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:1691\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":"baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs"},"region":{"startLine":1691}}}],"partialFingerprints":{"codehealthFindingId/v1":"094e67209bd5d9137e7facfbc4607d42ff931ef441863b2a7453b3851a18cb23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): baml_language/crates/baml_db/src/check.rs:1372-1412 | baml_language/crates/baml_db/src/check.rs:1423-1463 \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":"baml_language/crates/baml_db/src/check.rs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"6890b377dece769ba8275877c643be90a228d3f82902ac1f414bef4be394e184"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201340 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:839-869 | baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:950-989 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:839\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. 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":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"52433a2ea51772a075d5902c6e400e557952afea02a0e84f669848073e89f7d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:437-476 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:465-504 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 586 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:437\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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d87d435fb31cc986d4031661bfc7d1d022852204278b68ce63cbf66b7c45e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/markdown_parser.rs:46-85 | engine/baml-lib/jsonish/src/jsonish/parser/markdown_parser.rs:49-88 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/markdown_parser.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c187bc344e6c504f4dd1980e98089c29a1fb0ae6e5580e66fa4a681d532f8798"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39\u201340 lines \u00D7 2): engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/functions.rs:83-121 | engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/template_strings.rs:52-91 \u2014 before extracting anything, compare \u0060engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/functions.rs\u0060 and \u0060engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/template_strings.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/functions.rs:83\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":"engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/functions.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b043b92b6151f6289640873497960206fd7174598ad8642f57d30165178270"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38\u201339 lines \u00D7 2): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2652-2689 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2927-2965 \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 \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2652\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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":2652}}}],"partialFingerprints":{"codehealthFindingId/v1":"88160b517adc7e9450835043dd54f77eea8a8c37616d52a50a8641e5c44829ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): engine/baml-compiler/src/thir/interpret.rs:558-595 | engine/baml-compiler/src/thir/interpret.rs:655-692 \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 \u0060engine/baml-compiler/src/thir/interpret.rs:558\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/baml-compiler/src/thir/interpret.rs:654\u0060 calls \u0060as_ref\u0060 and \u0060engine/baml-compiler/src/thir/interpret.rs:557\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"d379135fa1c7cb81f0a276a20623ddfa7ec654fc795f7a278b3b92fc64fec760"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): engine/baml-compiler/src/watch.rs:257-294 | engine/baml-compiler/src/watch.rs:306-343 \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 \u0060engine/baml-compiler/src/watch.rs:257\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":"engine/baml-compiler/src/watch.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ffca13f7f30b1858951501dceff64ea92314efcabbc3904a2068b1c04016ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): baml_language/crates/baml_ide/src/symbol_pool.rs:304-339 | baml_language/crates/baml_ide/src/symbol_pool.rs:532-567 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_ide/src/symbol_pool.rs:304\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":"baml_language/crates/baml_ide/src/symbol_pool.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f3921261a470f3796dbcf0dc388bd251791ea1743a4811fe62d46171c59a1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/orchestrator/mod.rs:206-241 | engine/baml-runtime/src/internal/llm_client/orchestrator/mod.rs:268-303 \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 \u0060engine/baml-runtime/src/internal/llm_client/orchestrator/mod.rs:206\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":"engine/baml-runtime/src/internal/llm_client/orchestrator/mod.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f685ccbfa67bf1b8b751df9a439ab23feefd0db5037b4a7b72ed5946011ece6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201335 lines \u00D7 4): baml_language/crates/baml_compiler2_mir/src/lower.rs:9094-9128 | baml_language/crates/baml_compiler2_mir/src/lower.rs:9177-9211 | baml_language/crates/baml_compiler2_mir/src/lower.rs:9238-9272 | baml_language/crates/baml_compiler2_mir/src/lower.rs:9342-9373 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:9094\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":9094}}}],"partialFingerprints":{"codehealthFindingId/v1":"0046e9604f8a350e463746e659ecf2fa8b3511b0080f29cf6fb32721a3579aa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201335 lines \u00D7 3): engine/baml-compiler/src/thir/interpret.rs:828-862 | engine/baml-compiler/src/thir/interpret.rs:1085-1116 | engine/baml-compiler/src/thir/interpret.rs:1178-1209 \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 \u0060engine/baml-compiler/src/thir/interpret.rs:828\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54b919e82784d9581b565eed454f9ac06e146d4a8ba377591b718d3e1fb16d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201335 lines \u00D7 2): baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:554-588 | engine/baml-runtime/src/control_flow/flatten/step3_inline_implicit_nodes.rs:45-76 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs\u0060 and \u0060engine/baml-runtime/src/control_flow/flatten/step3_inline_implicit_nodes.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 132 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bcd17269dcd269cad90f744e113a3486aa367fd138922103d6d5ffe03e2a70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201334 lines \u00D7 3): baml_language/crates/baml_fmt/src/ast/attributes.rs:158-191 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1499-1530 | baml_language/crates/baml_fmt/src/ast/types.rs:501-532 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_fmt/src/ast/attributes.rs\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 162 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_fmt/src/ast/attributes.rs:158\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":"baml_language/crates/baml_fmt/src/ast/attributes.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da237851950209f57080fcf49ca171f6c57c26d29fc36d13f10ac68829d6db6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:87-120 | baml_language/crates/baml_type/src/unify.rs:197-230 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs\u0060 and \u0060baml_language/crates/baml_type/src/unify.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 452 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"feab68a17b6fb53a8d494ea7ddf89f84f59b9282de02b0af50aaebbe7f397cde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201334 lines \u00D7 2): baml_language/crates/baml_ide/src/symbol_pool.rs:272-299 | baml_language/crates/baml_ide/src/symbol_pool.rs:497-530 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/symbol_pool.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2bcc96ac4955710615c83ba6b7751f4d396f987af051349f3a914f0ae6cc7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:498-531 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:528-561 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 586 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:498\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn process_token( \u0026mut\u0060 in one and \u0060\u0026mut\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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba20b0a6701d031a74f800688da9d96c4e9071b7b1b4934b192915060e70325"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): baml_language/crates/bridge_wasm/src/wasm_http.rs:242-274 | baml_language/crates/bridge_wasm/src/wasm_http.rs:291-323 \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 \u0060baml_language/crates/bridge_wasm/src/wasm_http.rs:242\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_wasm/src/wasm_http.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c681e1fc612f081b7e48c22d35e1dba3893b1de4c4e991fcd996d6690abcab8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201333 lines \u00D7 2): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/lib.rs:274-306 | baml_language/sdks/typescript/sdkgen_typescript_shared/src/lib.rs:131-159 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/lib.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa4a5990aa50abdfbf68e5eacf14614b2c74a3d3b55253c3e626acee8c2a8fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201333 lines \u00D7 2): engine/baml-compiler/src/thir/typecheck.rs:933-965 | engine/baml-compiler/src/thir/typecheck.rs:1092-1123 \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 \u0060engine/baml-compiler/src/thir/typecheck.rs:933\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":"engine/baml-compiler/src/thir/typecheck.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"683cf789abbfc3c3d8119df52920a0417cb3310f9cff3b420451ec68dbe96376"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 3): baml_language/crates/bridge_wasm/src/runs.rs:693-724 | baml_language/crates/bridge_wasm/src/runs.rs:835-866 | baml_language/crates/bridge_wasm/src/runs.rs:1377-1408 \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 \u0060baml_language/crates/bridge_wasm/src/runs.rs:693\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/crates/bridge_wasm/src/runs.rs:834\u0060 calls \u0060to_string\u0060 and \u0060baml_language/crates/bridge_wasm/src/runs.rs:692\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_wasm/src/runs.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aae9b2aff916ef715b6154187d348db4a3d9167749411d9b7d460ab7b283c62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201332 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:4998-5029 | baml_language/crates/baml_compiler2_mir/src/lower.rs:5552-5580 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:4998\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":4998}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a76b7a8ecbef63cfba3df19863020dbc41a3cf848d2ce76b448b172cae0bb28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/pattern.rs:488-519 | baml_language/crates/baml_fmt/src/ast/types.rs:201-232 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_fmt/src/ast/pattern.rs\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/types.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_fmt/src/ast/pattern.rs:488\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":"baml_language/crates/baml_fmt/src/ast/pattern.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5b18574305e4e0a8c8a8fa32a9a89ca3c38501f05f0b033f19362e7c8e3be8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/value.rs:255-290 | engine/baml-lib/jsonish/src/jsonish/value.rs:197-232 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/value.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/value.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 164 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/value.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"835cede40247780f9ab4354b1b157c73f4b51ad14837c84d254019e6d30bb6e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201332 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs:318-347 | engine/baml-runtime/src/internal/llm_client/primitive/vertex/vertex_client.rs:523-554 \u2014 before extracting anything, compare \u0060engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs\u0060 and \u0060engine/baml-runtime/src/internal/llm_client/primitive/vertex/vertex_client.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 119 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ee36fb7d77ec3774f8f9a0a94983bddf28254f299d8d41bffbc36fdd191e3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1278-1309 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1370-1401 \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 \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1278\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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"d403f33e0209e6ba92c318832e3648ec098be69233ca948e272c8bdc6e63369c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201331 lines \u00D7 4): engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/functions.rs:112-140 | engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/template_strings.rs:82-110 | engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/types.rs:152-182 | engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/types.rs:198-228 \u2014 before extracting anything, compare \u0060engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/functions.rs\u0060 and \u0060engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/template_strings.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/functions.rs:112\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, \u0060engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/functions.rs:111\u0060 calls \u0060span\u0060 and \u0060engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/types.rs:151\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":"engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/functions.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8ca9460234a705063b02c537fd97b8533ad72d03093d4ff6e6d771014c1c51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:9630-9660 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:9840-9870 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":9630}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac61ae50ab9da167791578ba5b04a54be79f592e2dfeaf70be1cf6695a68633"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201331 lines \u00D7 2): baml_language/crates/bex_engine/src/lib.rs:6670-6700 | baml_language/crates/bex_engine/src/lib.rs:6761-6785 \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 \u0060baml_language/crates/bex_engine/src/lib.rs:6670\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":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":6670}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40019768cdbaeb634ccf05bc0894e75b9838123d2bd8264c6b327096566f0a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201331 lines \u00D7 2): baml_language/crates/bex_vm/src/vm.rs:10674-10704 | baml_language/crates/bex_vm/src/vm/compiled_rt/frame.rs:401-428 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_vm/src/vm.rs:10674\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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":10674}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fb341396620b05f2397620c5f90808f47205c115cc6245f91772ccf39ffb2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201330 lines \u00D7 2): baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedCanonicalCodecs.cs:173-202 | baml_language/sdks/csharp/bridge_csharp/src/Values/BamlValue.cs:563-590 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedCanonicalCodecs.cs:173\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. 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":"baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedCanonicalCodecs.cs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca412d1cccd40790d55f27091321df305ee51b8dc616a835f26ac9e6e41f66bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): engine/language_server/src/baml_project/mod.rs:641-670 | engine/language_server/src/baml_project/mod.rs:995-1024 \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 \u0060engine/language_server/src/baml_project/mod.rs:641\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":"engine/language_server/src/baml_project/mod.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b896698401f1ec9cd19fb427dd2a8b888b9a1a5ecfdbfb571e02b3afd7d002"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 3): engine/baml-lib/baml-core/src/ir/ir_helpers/error_utils.rs:23-51 | engine/baml-lib/diagnostics/src/error.rs:37-65 | engine/baml-lib/jinja/src/evaluate_type/mod.rs:44-72 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. 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":"engine/baml-lib/baml-core/src/ir/ir_helpers/error_utils.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e75d0d14dc9b89479b3785c4281043ac42574410cfeddcd3b92bd2ea86bffa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 3): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2122-2150 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2679-2706 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2955-2982 \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 \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2122\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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":2122}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d72b094e01cfb452c930d1f6fd2ab516681309647ab0cef1f37a35ec688969"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/pattern.rs:182-212 | baml_language/crates/baml_fmt/src/ast/pattern.rs:339-369 \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":"baml_language/crates/baml_fmt/src/ast/pattern.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"6631c4efb560de04941843c10bc5607799ca582bcf03846b8532dc07faa19405"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 3): baml_language/crates/baml_compiler2_visualization/src/control_flow/mod.rs:266-293 | engine/baml-compiler/src/viz_builder.rs:27-54 | engine/baml-runtime/src/control_flow.rs:185-212 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/mod.rs\u0060 and \u0060engine/baml-runtime/src/control_flow.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 94 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060kind\u0060 to \u0060\u0026CounterKind\u0060 in one and \u0060CounterKind\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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/mod.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"255653425e78be33bf8e5d7c44148b0ffab900d4f1b39f8712725d2fd1b4f206"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40\u201346 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:461-500 | baml_language/crates/baml_type/src/unify.rs:824-869 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs\u0060 and \u0060baml_language/crates/baml_type/src/unify.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 452 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78caf32c4839bd374c7d9123c096992ec7efffcfdad4f5cf3738cc07a075adf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:7534-7561 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:7633-7660 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:7534\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":7534}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc69a366aaf4752b8d7235c4ce6b06c96dfd568445e436203b6603716c67611b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): baml_language/crates/baml_lsp_server/src/playground_http.rs:83-110 | baml_language/crates/baml_lsp_server/src/playground_http.rs:134-161 \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 \u0060baml_language/crates/baml_lsp_server/src/playground_http.rs:83\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":"baml_language/crates/baml_lsp_server/src/playground_http.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4acc4891e49d34e3a8bb6b47c16b22a5281c8d4608f355ac1df09d13c99809"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:187-213 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:215-242 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 586 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:187\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed5f9e608fa738b68628a56b975c6cea93b58e700f41942dbb9e8a7b87023a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/value.rs:130-157 | engine/baml-lib/jsonish/src/jsonish/value.rs:120-147 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/value.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/value.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 164 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/value.rs:130\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":"baml_language/crates/bex_sap/src/jsonish/value.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b036b198ff44fc66c62354c26d526d2e257f9972ff333e9cfeb858dffb7586d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201328 lines \u00D7 2): engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs:424-451 | engine/language_server/src/baml_project/mod.rs:1560-1585 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7eecc27ce2908f025c9d020213470e183149a9b52e61bc6ba41dede95b8e3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/classes.rs:41-68 | engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/enums.rs:17-44 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/classes.rs:41\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":"engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/classes.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5bef97bac8a05f028b516a7c7917b82a225a7bac427ab25bcfeb130ded22758"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 3): baml_language/crates/bridge_wasm/src/runs.rs:769-795 | baml_language/crates/bridge_wasm/src/runs.rs:911-937 | baml_language/crates/bridge_wasm/src/runs.rs:1424-1450 \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 \u0060baml_language/crates/bridge_wasm/src/runs.rs:769\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":"baml_language/crates/bridge_wasm/src/runs.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae82521b8a796d484beec8a65dac9fd06d28f2a420891993a3fcc22adf8351b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 3): engine/baml-lib/ast/src/parser/parse_expr.rs:390-416 | engine/baml-lib/ast/src/parser/parse_expr.rs:420-446 | engine/baml-lib/ast/src/parser/parse_expr.rs:450-476 \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 \u0060engine/baml-lib/ast/src/parser/parse_expr.rs:390\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":"engine/baml-lib/ast/src/parser/parse_expr.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"196d3b4eaf071fcf0f20e826045d6bc80c8e5da883569c451c9837c89b2335bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/value.rs:84-110 | engine/baml-lib/jsonish/src/jsonish/value.rs:76-102 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/value.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/value.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 164 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/value.rs:84\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":"baml_language/crates/bex_sap/src/jsonish/value.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e286f0d8ff800f7874c66fad2c15eba8000e78e8977450fd867f52e840cb8836"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/orchestrator/call.rs:77-103 | engine/baml-runtime/src/internal/llm_client/orchestrator/stream.rs:192-218 \u2014 before extracting anything, compare \u0060engine/baml-runtime/src/internal/llm_client/orchestrator/call.rs\u0060 and \u0060engine/baml-runtime/src/internal/llm_client/orchestrator/stream.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/internal/llm_client/orchestrator/call.rs:77\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":"engine/baml-runtime/src/internal/llm_client/orchestrator/call.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff499df19e0ef27f778d27a65b6ee0fe53872beafe54313cc11ac6634c41c71f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201327 lines \u00D7 2): engine/generators/languages/typescript/src/ir_to_ts/mod.rs:75-101 | engine/generators/languages/typescript/src/ir_to_ts/mod.rs:165-189 \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 \u0060engine/generators/languages/typescript/src/ir_to_ts/mod.rs:75\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":"engine/generators/languages/typescript/src/ir_to_ts/mod.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"41522ab6024db1b3f00a91270036f7b75492b703f364da7f500348078c96c5f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201326 lines \u00D7 2): baml_language/crates/baml_compiler2_hir/src/builder.rs:505-520 | baml_language/crates/baml_compiler2_hir/src/builder.rs:550-575 \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 \u0060baml_language/crates/baml_compiler2_hir/src/builder.rs:505\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":"baml_language/crates/baml_compiler2_hir/src/builder.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"4788d31426207c22b8213fd9aa6094a5d8cfb9aac66ac4da69adc2e1a6a2da4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/markdown_parser.rs:87-111 | engine/baml-lib/jsonish/src/jsonish/parser/markdown_parser.rs:92-117 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/markdown_parser.rs:87\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/markdown_parser.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"665f280ed9ad0fb5829b7037689c848dcc0da8e32edaa55107c88dac4a8081e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201326 lines \u00D7 2): engine/baml-compiler/src/codegen.rs:590-608 | engine/baml-compiler/src/codegen.rs:652-677 \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 \u0060engine/baml-compiler/src/codegen.rs:590\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":"engine/baml-compiler/src/codegen.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"154f5f60c0cce6dc098be868d8a74692a9363a18e27daa3544be7d45214fde6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): engine/baml-runtime/src/optimize/applier.rs:367-392 | engine/baml-runtime/src/optimize/applier.rs:507-532 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/optimize/applier.rs:367\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":"engine/baml-runtime/src/optimize/applier.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac80affab941dc4a0a4b0e64942951fc6d63a68baeebd7d172e92e0a4f812e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): engine/generators/languages/go/src/ir_to_go/mod.rs:300-325 | engine/generators/languages/rust/src/ir_to_rust/mod.rs:330-355 \u2014 before extracting anything, compare \u0060engine/generators/languages/go/src/ir_to_go/mod.rs\u0060 and \u0060engine/generators/languages/rust/src/ir_to_rust/mod.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 208 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/generators/languages/go/src/ir_to_go/mod.rs:300\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/go/src/ir_to_go/mod.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1c3481bbace90afb4bc23b68f09af2b9a4ca2f090f1704533241dea4bdd241"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): engine/generators/languages/python/src/ir_to_py/functions.rs:14-39 | engine/generators/languages/python/src/ir_to_py/functions.rs:54-79 \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 \u0060engine/generators/languages/python/src/ir_to_py/functions.rs:14\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060function\u0060 to \u0060\u0026FunctionNode\u0060 in one and \u0060\u0026ExprFunctionNode\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":"engine/generators/languages/python/src/ir_to_py/functions.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c9fc6a529c0a14864556d47dde314cf35f540cae5e01a41c1243e014efd98c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:127-158 | baml_language/crates/baml_type/src/unify.rs:288-319 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs\u0060 and \u0060baml_language/crates/baml_type/src/unify.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 452 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:127\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":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce3ed30c2a3b6589c2ca2bfc1d32294d34848718c53a1be0fa10af6a74d65c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:730-762 | baml_language/crates/baml_type/src/unify.rs:1259-1291 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs\u0060 and \u0060baml_language/crates/baml_type/src/unify.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 452 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:730\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":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"160c21c0b4683a2fee130426ae1e4b25064408ee70025f2db01d44b033f535b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201325 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:1081-1101 | baml_language/crates/baml_compiler2_hir_ty/src/interfaces/coherence.rs:314-338 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs\u0060 and \u0060baml_language/crates/baml_compiler2_hir_ty/src/interfaces/coherence.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:1081\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"3661a90d81c9fc87a94dea1155e6a37eaacffad70d1253e2fbd247fa198219bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): baml_language/crates/baml_ide/src/describe.rs:858-882 | baml_language/crates/baml_ide/src/describe.rs:970-992 \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 \u0060baml_language/crates/baml_ide/src/describe.rs:858\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":"baml_language/crates/baml_ide/src/describe.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"2191a919a674d18813e262a05cb20a32f883a96c692b538dc559e04a82fffe07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201325 lines \u00D7 2): baml_language/crates/baml_type/src/normalize.rs:1407-1431 | baml_language/crates/baml_type/src/normalize.rs:3192-3213 \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 \u0060baml_language/crates/baml_type/src/normalize.rs:1407\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":"baml_language/crates/baml_type/src/normalize.rs"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf807a9d2c1f6784e84597fa919d2435e2d64e205fedb4c9811fdaa76f4c3f07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/value.rs:47-76 | engine/baml-lib/jsonish/src/jsonish/value.rs:39-68 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/value.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/value.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 164 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/value.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d3c8505e40a8e76cb2225918cf36581ef10c1a06a4f63fdcef3e8a188e2d1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): baml_language/crates/bridge_wasm/src/runs.rs:667-691 | baml_language/crates/bridge_wasm/src/runs.rs:808-832 \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 \u0060baml_language/crates/bridge_wasm/src/runs.rs:667\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/crates/bridge_wasm/src/runs.rs:835\u0060 calls \u0060to_string\u0060 and \u0060baml_language/crates/bridge_wasm/src/runs.rs:694\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":"baml_language/crates/bridge_wasm/src/runs.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"54271be6c650cc79a38f978846ddfe82b4b80c7f030e2112dab1147b31d44bc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201325 lines \u00D7 2): baml_language/crates/btel_snapshot/src/graph.rs:367-391 | baml_language/crates/btel_snapshot/src/shape.rs:195-216 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/btel_snapshot/src/graph.rs:367\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":"baml_language/crates/btel_snapshot/src/graph.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9b7ba091cf1ad0b1fb20bfb412091dc95b4f8ba9a4afb67bf1f87aaa5e85af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/orchestrator/call.rs:166-190 | engine/baml-runtime/src/internal/llm_client/orchestrator/stream.rs:522-546 \u2014 before extracting anything, compare \u0060engine/baml-runtime/src/internal/llm_client/orchestrator/call.rs\u0060 and \u0060engine/baml-runtime/src/internal/llm_client/orchestrator/stream.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/internal/llm_client/orchestrator/call.rs:166\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":"engine/baml-runtime/src/internal/llm_client/orchestrator/call.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf38bc72381012d1114409e2befaf8d497d42fce03bd96a71cc0c3987096791c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1863-1887 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1938-1961 \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 \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1863\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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d52a1a70062aca2ff914b5e13093ee289069c43285421b3677894e8d8a390f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): baml_language/crates/baml_cli/src/pack_command.rs:574-596 | baml_language/crates/baml_cli/src/run_command.rs:928-951 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_cli/src/pack_command.rs\u0060 and \u0060baml_language/crates/baml_cli/src/run_command.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_cli/src/pack_command.rs:574\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":"baml_language/crates/baml_cli/src/pack_command.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"e814769e2532e1a5cca46cd822d0912e655f11066d61e1528b24ec7c2266feea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/attributes.rs:109-132 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1399-1420 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_fmt/src/ast/attributes.rs\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 162 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_fmt/src/ast/attributes.rs:109\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":"baml_language/crates/baml_fmt/src/ast/attributes.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e7c4fa3e8a237b00151d059fca777907a473cd535e4873383d902b07864687"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): baml_language/crates/bex_vm/src/debug.rs:230-252 | baml_language/crates/bex_vm/src/debug.rs:422-445 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/debug.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3f73d11d94e3eba77c097531f77d9582f35d247a030638d087e20b34a91e29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201324 lines \u00D7 2): engine/baml-runtime/src/optimize/gepa_runtime.rs:101-124 | engine/baml-runtime/src/optimize/gepa_runtime.rs:362-382 \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 \u0060engine/baml-runtime/src/optimize/gepa_runtime.rs:101\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":"engine/baml-runtime/src/optimize/gepa_runtime.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b9c1fbdf1753036fab3f6b26c6737d3140a920a010967fc89ccee7207e2588"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201323 lines \u00D7 2): baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1665-1687 | baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:2048-2066 \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 \u0060baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1665\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":"baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db78b54dff04d30ab21d8c837ab22a2b81b48252574a368e8b9bfd40604935e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs:605-627 | baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs:1013-1035 \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 \u0060baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs:605\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":"baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c624f8f5b229f02abe75092cde35b292511452162b9f51e50f4a337fc19fb8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): baml_language/crates/baml_ide/src/cursor_context.rs:136-158 | baml_language/crates/baml_ide/src/cursor_context.rs:224-246 \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":"baml_language/crates/baml_ide/src/cursor_context.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"119691d2eb71e82ccf024c2528077d2090f8930041162ca14ed87549fd873a0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): baml_language/crates/baml_lsp_server/src/playground_server.rs:1599-1621 | baml_language/crates/baml_lsp_server/src/playground_server.rs:1698-1720 \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 \u0060baml_language/crates/baml_lsp_server/src/playground_server.rs:1599\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":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":1599}}}],"partialFingerprints":{"codehealthFindingId/v1":"184dc32121d76fc1c1e22bc86623e5a153b7e48a4a672b9f0089e552022c5fd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): baml_language/crates/baml_type/src/template.rs:254-276 | baml_language/crates/baml_type/src/template.rs:321-343 \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 \u0060baml_language/crates/baml_type/src/template.rs:254\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":"baml_language/crates/baml_type/src/template.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0fbe95dace17ce10a89f50e9f7e3d0790a7b8de99f3815aa49eda40190a4ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): baml_language/crates/bex_events/src/history/mod.rs:722-744 | baml_language/crates/bex_events/src/run.rs:1621-1643 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"baml_language/crates/bex_events/src/history/mod.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"4caf8441df020f20495327097911a7a1d82b1a5b96022ba8ff65a4fac6822913"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/coercer/match_string.rs:296-318 | engine/baml-lib/jsonish/src/deserializer/coercer/match_string.rs:267-289 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/deserializer/coercer/match_string.rs\u0060 and \u0060engine/baml-lib/jsonish/src/deserializer/coercer/match_string.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/coercer/match_string.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff35976114bc9c8a47b213fc0df80d96186e9c6e6b8b39fd3202e34a6ecb92ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/emit/mod.rs:216-239 | baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/emit/mod.rs:327-350 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/emit/mod.rs:216\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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/emit/mod.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd2448fd7f2fabbc85d43ed65aea127b885837f9c0deda8aa14365e21dadd43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): engine/baml-lib/baml-types/src/baml_value.rs:157-179 | engine/baml-lib/baml-types/src/baml_value.rs:956-978 \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 \u0060engine/baml-lib/baml-types/src/baml_value.rs:157\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":"engine/baml-lib/baml-types/src/baml_value.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49d0d9103534bae495301abf97534f08b6608b765e214fb84e17c4009f9514a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): engine/generators/languages/go/src/ir_to_go/mod.rs:114-136 | engine/generators/languages/go/src/ir_to_go/mod.rs:145-167 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/generators/languages/go/src/ir_to_go/mod.rs:168\u0060 calls \u0060make_optional\u0060 and \u0060engine/generators/languages/go/src/ir_to_go/mod.rs:137\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/go/src/ir_to_go/mod.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"37480ec999ab309d03c150d0e00fe4310c7052a7c0a8c1ca79262177dadf3eb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): engine/generators/languages/rust/src/ir_to_rust/mod.rs:132-154 | engine/generators/languages/rust/src/ir_to_rust/mod.rs:163-185 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/generators/languages/rust/src/ir_to_rust/mod.rs:186\u0060 calls \u0060make_optional\u0060 and \u0060engine/generators/languages/rust/src/ir_to_rust/mod.rs:155\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/rust/src/ir_to_rust/mod.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a9fbe00419e4b1b947eb7227a82d02b1b8d434494b276b5d1ac800c2ec5a0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 4): baml_language/crates/baml_type/src/normalize.rs:772-793 | baml_language/crates/baml_type/src/normalize.rs:1475-1496 | baml_language/crates/baml_type/src/normalize.rs:2476-2497 | baml_language/crates/baml_type/src/normalize.rs:2637-2658 \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 \u0060baml_language/crates/baml_type/src/normalize.rs:772\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":"baml_language/crates/baml_type/src/normalize.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6f46d457108c787b2d2e408d2b991a7c5cc1ddb03898dd9379a11aeb8f8872"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 4): engine/generators/languages/go/src/ir_to_go/unions.rs:27-48 | engine/generators/languages/go/src/ir_to_go/unions.rs:90-111 | engine/generators/languages/rust/src/ir_to_rust/unions.rs:35-56 | engine/generators/languages/rust/src/ir_to_rust/unions.rs:141-162 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/generators/languages/go/src/ir_to_go/unions.rs:27\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":"engine/generators/languages/go/src/ir_to_go/unions.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7d2e825a332b1e5903e8ce64bc8a0edd467717c9f7f6bd45898631281b5e6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201322 lines \u00D7 4): languages/rust/baml/src/runtime.rs:98-119 | languages/rust/baml/src/runtime.rs:177-195 | languages/rust/baml/src/runtime.rs:221-242 | languages/rust/baml/src/runtime.rs:299-319 \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 \u0060languages/rust/baml/src/runtime.rs:98\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":"languages/rust/baml/src/runtime.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2641c888e3db72181a6077f4b75547d721f07aa7d5bf18c4a037318cbf03a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 3): baml_language/crates/bex_vm/src/debug.rs:231-252 | baml_language/crates/bex_vm/src/debug.rs:424-445 | baml_language/crates/bex_vm_types/src/bytecode.rs:2692-2712 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/crates/bex_vm_types/src/bytecode.rs:2691\u0060 calls \u0060UnaryOp\u0060 and \u0060baml_language/crates/bex_vm/src/debug.rs:423\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":"baml_language/crates/bex_vm/src/debug.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"913318cfe785e5ff09749aa8e9d0739f5786ddbf570cd4c189e26dffee16e562"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): engine/baml-compiler/src/thir/interpret.rs:599-620 | engine/baml-compiler/src/thir/interpret.rs:1143-1164 | engine/baml-compiler/src/thir/interpret.rs:1236-1257 \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 \u0060engine/baml-compiler/src/thir/interpret.rs:599\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":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69fb464af5170dc99288e7e6ed25efe07a5a5ba2019b21f50ff9b3b556759eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:4650-4671 | baml_language/crates/baml_compiler2_mir/src/lower.rs:4921-4942 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:4650\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":4650}}}],"partialFingerprints":{"codehealthFindingId/v1":"30adab89ef6c6bce6f031bc07f1c64f21e9dfa160688d7d808c948e2a7e9726d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:721-742 | engine/baml-runtime/src/control_flow/flatten/step3_inline_implicit_nodes.rs:187-207 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs\u0060 and \u0060engine/baml-runtime/src/control_flow/flatten/step3_inline_implicit_nodes.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 132 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"819ee8c76f3ca6383d96b9f514d56a101409f7ea3c91364bd308f99737bcb895"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/pattern.rs:234-255 | baml_language/crates/baml_fmt/src/ast/pattern.rs:391-412 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_fmt/src/ast/pattern.rs:234\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/crates/baml_fmt/src/ast/pattern.rs:413\u0060 calls \u0060Some\u0060, \u0060print_array_ascription\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/pattern.rs:256\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":"baml_language/crates/baml_fmt/src/ast/pattern.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"287b9b9e6db35bbce81c7a0022e4ff1231f0f7cff91cf86207e144ae85c11ffb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs:156-177 | engine/baml-lib/jsonish/src/deserializer/deserialize_flags.rs:168-189 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs\u0060 and \u0060engine/baml-lib/jsonish/src/deserializer/deserialize_flags.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 127 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs:178\u0060 calls \u0060OptionalFieldError\u0060 and \u0060engine/baml-lib/jsonish/src/deserializer/deserialize_flags.rs:190\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":"baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"e006a208614bf34237eac088e55cd54d67fd3e63c1f7a7767fef7cdb2b62d8ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:396-417 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:423-444 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 586 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:396\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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc3591967d7e1e6f640b455e355a734042644c4991ce5e85684deb0964e80e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201322 lines \u00D7 2): baml_language/crates/sys_native/src/shell.rs:94-107 | baml_language/crates/sys_native/src/shell.rs:136-157 \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 \u0060baml_language/crates/sys_native/src/shell.rs:94\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":"baml_language/crates/sys_native/src/shell.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc1699e9c73844466676972cf72cda3c2c0bd366f042105d5fada0a5018122b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): engine/baml-lib/baml-log/src/logger.rs:733-753 | engine/baml-lib/baml-log/src/logger.rs:870-891 \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 \u0060engine/baml-lib/baml-log/src/logger.rs:870\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":"engine/baml-lib/baml-log/src/logger.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"579ac98e9a7043b1da290004fdb7b294b9aab79db502ffae93f940a3d7b822d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): engine/baml-lib/llm-client/src/clients/anthropic.rs:197-217 | engine/baml-lib/llm-client/src/clients/google_ai.rs:187-208 \u2014 before extracting anything, compare \u0060engine/baml-lib/llm-client/src/clients/anthropic.rs\u0060 and \u0060engine/baml-lib/llm-client/src/clients/google_ai.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/llm-client/src/clients/anthropic.rs:197\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":"engine/baml-lib/llm-client/src/clients/anthropic.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce298c437e092b18c48c9b13db66a9a6bb23970d632a1940d2ec536ffa143f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): engine/baml-runtime/src/cli/serve/mod.rs:385-406 | engine/baml-runtime/src/cli/serve/mod.rs:512-533 \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 \u0060engine/baml-runtime/src/cli/serve/mod.rs:385\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":"engine/baml-runtime/src/cli/serve/mod.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d143132f0c6c8418407c42c51fad4f1a543d109449d6866cd18e49953050de0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs:984-1005 | engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs:1429-1450 \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 \u0060engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs:984\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":"engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"175172e5880f5e7b6a29af7928f20ecf5a3e7761241beea7c106bc99a1cb5b18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): engine/baml-runtime/src/optimize/tui.rs:1119-1140 | engine/baml-runtime/src/optimize/tui.rs:1518-1538 \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 \u0060engine/baml-runtime/src/optimize/tui.rs:1119\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":"engine/baml-runtime/src/optimize/tui.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e2470c840e51f1b51bd2d818d7ebf6e98214ab5fcb3314d789c3438be4c319"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): engine/baml_cffi_macros/src/lib.rs:923-944 | engine/baml_cffi_macros/src/lib.rs:986-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 \u0060engine/baml_cffi_macros/src/lib.rs:923\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":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e3e2ae4c0218083afba082a4087120e50a26ff71c9e6b2c0108c9aac142381"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 2): baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:224-244 | baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:1110-1127 \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 \u0060baml_language/crates/baml_compiler2_ast/src/lower_expr_body.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c032f61d29b32f3f1e664771d78343fd183503b88b0f958bbb77e95519f5d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): baml_language/crates/baml_compiler2_emit/src/refs.rs:211-231 | baml_language/crates/baml_compiler2_rust/src/coords.rs:30-49 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_emit/src/refs.rs:211\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":"baml_language/crates/baml_compiler2_emit/src/refs.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e6c0844dba763a247a5b5e59ad812b96f219e2dee620eff8fc112117c4c1a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201321 lines \u00D7 2): baml_language/crates/baml_compiler2_emit/src/stack_carry.rs:800-815 | baml_language/crates/baml_compiler2_emit/src/stack_carry.rs:837-857 \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 \u0060baml_language/crates/baml_compiler2_emit/src/stack_carry.rs:837\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":"baml_language/crates/baml_compiler2_emit/src/stack_carry.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1746c23caa884746271e0f6fbc653fa60b06545c8e9c3fca3afa32b37b5665"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:2244-2264 | baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:2308-2328 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:2244\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":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a72b6fbc656bf71ce23400ea972b9d23ffd071d91e0d9ab9de9395dab97c57e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201321 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:4111-4125 | baml_language/crates/baml_compiler2_mir/src/lower.rs:11726-11746 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:4111\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":4111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a35984f360fc89f8724124f5931bc14a1a752df8604d1c1d8bb9f182348a21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:6186-6203 | baml_language/crates/baml_compiler2_mir/src/lower.rs:12231-12251 \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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":6186}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe7cc9150a9d9283c0c76802b7ffeafb42af173f13425d7be813b4b429957e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:6473-6493 | baml_language/crates/baml_compiler2_mir/src/lower.rs:6573-6592 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:6473\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":6473}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6bf4ba51adca13948af12abcfea019e77f1267990842cedb2780115cf4a3c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201321 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:6824-6839 | baml_language/crates/baml_compiler2_mir/src/lower.rs:12392-12412 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:6824\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":6824}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0dcf72e4b3861e763f9cf21f1a155d1cd18861b61112dc0b7718597bedf16d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:10293-10311 | baml_language/crates/baml_compiler2_mir/src/lower.rs:10350-10370 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:10293\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":10293}}}],"partialFingerprints":{"codehealthFindingId/v1":"7081ae507ecfe28e2f2228fd2d49698e63e4d925b3f1d92bc04c4b5513c0ce7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): baml_language/crates/baml_lsp/src/dispatch/mod.rs:126-146 | baml_language/crates/baml_lsp/src/dispatch/mod.rs:178-198 \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 \u0060baml_language/crates/baml_lsp/src/dispatch/mod.rs:126\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":"baml_language/crates/baml_lsp/src/dispatch/mod.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"d283eb184c77e16685e324ab18c759a7a869f3b4ad1c2e2af8053ff79c26db5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs:138-158 | engine/baml-lib/jsonish/src/deserializer/coercer/array_helper.rs:113-133 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs\u0060 and \u0060engine/baml-lib/jsonish/src/deserializer/coercer/array_helper.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 98 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs:138\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":"baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"14027346869bcd1b541a8258115814ff3c5f9008b7af1df67d4073e1b05ab94c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): baml_language/crates/bex_vm/src/debug.rs:591-611 | engine/baml-vm/src/debug.rs:295-315 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_vm/src/debug.rs\u0060 and \u0060engine/baml-vm/src/debug.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_vm/src/debug.rs:591\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":"baml_language/crates/bex_vm/src/debug.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"d879edb3edcda5a02f81884398172564e30cb1e77766db8822284ae2cd8ee0e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): baml_language/crates/bex_vm/src/telemetry.rs:825-845 | baml_language/crates/bex_vm/src/telemetry.rs:923-943 \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":"baml_language/crates/bex_vm/src/telemetry.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15c94e451b5a5947de3b6047d938d0fd5ad7fca8c897effb2222b83c1e66c1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): engine/baml-compiler/src/hir/dump.rs:140-160 | engine/baml-compiler/src/hir/dump.rs:185-205 \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 \u0060engine/baml-compiler/src/hir/dump.rs:140\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":"engine/baml-compiler/src/hir/dump.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb66a6bdd888ade0b1c5f875f733111b9a510d3ad419e17b73cfb80d770e02b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): engine/baml-compiler/src/thir/typecheck.rs:290-309 | engine/baml-compiler/src/thir/typecheck.rs:359-379 \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. 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":"engine/baml-compiler/src/thir/typecheck.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"144a980cc5ea61d49656158dd3fd1aa17d0806af9dd61c591a40fa317dec87fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): engine/baml-lib/jsonish/src/helpers/mod.rs:257-277 | engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs:443-463 \u2014 before extracting anything, compare \u0060engine/baml-lib/jsonish/src/helpers/mod.rs\u0060 and \u0060engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/helpers/mod.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cea6c717c16592a6b49675d43ee90845f04c5d9ff4e7b66f92561ffaa3c4980"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): engine/baml-rpc/src/runtime_api/baml_value.rs:36-58 | engine/baml-rpc/src/runtime_api/baml_value.rs:122-144 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-rpc/src/runtime_api/baml_value.rs:36\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":"engine/baml-rpc/src/runtime_api/baml_value.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4751b36adfc152d88a5bcc35c7faaf5e6ebfbb177b7c152bf14c915fef1c6cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): engine/baml-runtime/src/cli/repl.rs:497-515 | engine/baml-runtime/src/cli/repl.rs:672-692 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/cli/repl.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03b6620156525ce4c32550f71ccdfbb3eff53c439f88ce96d477c73a9b3e38e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): engine/generators/languages/python/src/watchers.rs:148-175 | engine/generators/languages/typescript/src/watchers.rs:144-171 \u2014 before extracting anything, compare \u0060engine/generators/languages/python/src/watchers.rs\u0060 and \u0060engine/generators/languages/typescript/src/watchers.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/generators/languages/python/src/watchers.rs:148\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":"engine/generators/languages/python/src/watchers.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5aa3dad7fd43358bf6eb43d0f0c53d50963164745a8209115d9a5ab1cfd875b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): engine/generators/languages/python/src/watchers.rs:199-219 | engine/generators/languages/typescript/src/watchers.rs:195-215 \u2014 before extracting anything, compare \u0060engine/generators/languages/python/src/watchers.rs\u0060 and \u0060engine/generators/languages/typescript/src/watchers.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/generators/languages/python/src/watchers.rs:199\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":"engine/generators/languages/python/src/watchers.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fdb948f90cece75a6784011d4527c64cd2da7cd15b25e01d92b38e06a30274"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): engine/generators/languages/ruby/src/ir_to_rb/mod.rs:238-258 | engine/generators/languages/ruby/src/ir_to_rb/mod.rs:264-284 \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 \u0060engine/generators/languages/ruby/src/ir_to_rb/mod.rs:238\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060meta\u0060 to \u0060\u0026type_meta::NonStreaming\u0060 in one and \u0060\u0026TypeMetaStreaming\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":"engine/generators/languages/ruby/src/ir_to_rb/mod.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab01408c3f2351378b35f1e454c8148f853165546e4f4333348b0ceb37512ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 3): baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:760-779 | baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:813-832 | baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:898-916 \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 \u0060baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:760\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:919\u0060 calls \u0060alloc_expr\u0060, \u0060Path\u0060 and \u0060baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:779\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"19654d0b5e1b61b4be6de532fc541da250a41b94044e1b5bea0865c773d13102"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 3): baml_language/sdks/go/sdkgen_go/src/lib.rs:757-775 | baml_language/sdks/go/sdkgen_go/src/lib.rs:888-907 | baml_language/sdks/go/sdkgen_go/src/lib.rs:969-988 \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 \u0060baml_language/sdks/go/sdkgen_go/src/lib.rs:757\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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae4d3853a120d7274635e5747628e27c0badc36be7a9dc6cfa235137f3e896a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): baml_language/crates/baml_cli/src/run_command.rs:798-817 | baml_language/crates/baml_cli/src/run_command.rs:1198-1217 \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 \u0060baml_language/crates/baml_cli/src/run_command.rs:798\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":"baml_language/crates/baml_cli/src/run_command.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"0399a83886baacf044e34dc282802695ed028bb56f94a04e27bbb4b3dd620cc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs:629-648 | baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs:1037-1056 \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 \u0060baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs:629\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":"baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad06300148ab3a8c5b1bbb167065079fd38e9e2a6a769a38b174360b597eb95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:8570-8589 | baml_language/crates/baml_compiler2_mir/src/lower.rs:8676-8692 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:8570\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":8570}}}],"partialFingerprints":{"codehealthFindingId/v1":"431b1ee257b99c2a1ff231d634c48980187d1affa02ed3a910ef29502660da14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/pretty.rs:392-410 | baml_language/crates/baml_compiler2_mir/src/pretty.rs:432-451 \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 \u0060baml_language/crates/baml_compiler2_mir/src/pretty.rs:432\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/pretty.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7ad858e4c69a15f49b72c89ceb6b797740973213fcc12388f14dce83a4eb86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): baml_language/crates/bex_engine/src/lib.rs:6649-6666 | baml_language/crates/bex_engine/src/lib.rs:6714-6733 \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 \u0060baml_language/crates/bex_engine/src/lib.rs:6649\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":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":6649}}}],"partialFingerprints":{"codehealthFindingId/v1":"6190cf57b9163b3d4805ea5fc2945409ee3652f2699931fcd2c51d5487256023"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): baml_language/crates/bex_events/src/history/mod.rs:318-337 | baml_language/crates/bridge_wasm/src/runs.rs:154-171 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_events/src/history/mod.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6b884fd882de19895f050891aae4f094b112f0ec6538c4784dff87745adc53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/entry.rs:185-204 | engine/baml-lib/jsonish/src/jsonish/parser/entry.rs:196-215 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/entry.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/entry.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/entry.rs:185\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":"baml_language/crates/bex_sap/src/jsonish/parser/entry.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a75511d486fbbd6dcb1f7c2a2b82e63f932eba5a2e9007c01e941702d579d2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser.rs:41-60 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser.rs:35-54 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser.rs\u0060 as WHOLE FILES: 84% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser.rs:41\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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a839a3d127df68a2bc887e8aa7366a2933f5e3342103b0d663f34856ea2316"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:1893-1911 | baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:2886-2905 \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 \u0060baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:1893\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":1893}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc593eea66c82197856a0ba8dd8834a1a159639d27fe806d2ac8cdb52ca066e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201320 lines \u00D7 2): engine/baml-compiler/src/thir/typecheck.rs:1813-1828 | engine/baml-compiler/src/thir/typecheck.rs:2188-2207 \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 \u0060engine/baml-compiler/src/thir/typecheck.rs:1813\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, \u0060engine/baml-compiler/src/thir/typecheck.rs:1811\u0060 calls \u0060is_empty\u0060 and \u0060engine/baml-compiler/src/thir/typecheck.rs:2187\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":"engine/baml-compiler/src/thir/typecheck.rs"},"region":{"startLine":1813}}}],"partialFingerprints":{"codehealthFindingId/v1":"37eb8e240c6dc8902e3c513c8aba8852449d4613f02858473eedef4108afe428"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:86-105 | engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:112-131 \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 \u0060engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:86\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:135\u0060 calls \u0060push\u0060 and \u0060engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:106\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":"engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d1dd6e5f487dcd401371a6eb9e24b430f2699e938abcae5a67ce4b19425c01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): engine/baml-lib/baml-core/src/validate/generator_loader/v2.rs:134-153 | engine/baml-lib/baml-core/src/validate/generator_loader/v2.rs:258-277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/baml-core/src/validate/generator_loader/v2.rs:134\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":"engine/baml-lib/baml-core/src/validate/generator_loader/v2.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"53dbbb5be3032341228efcf31f9a0666e39059f281306b3cfa09ec66b2ed5a1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/openai/response_handler.rs:822-840 | engine/baml-runtime/src/internal/llm_client/primitive/openai/response_handler.rs:874-893 \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 \u0060engine/baml-runtime/src/internal/llm_client/primitive/openai/response_handler.rs:822\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":"engine/baml-runtime/src/internal/llm_client/primitive/openai/response_handler.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"052c37ec0b4f8f5c9d7ee06ff062fa4977dcf91653ab3d7c2503ace92448a155"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): engine/generators/languages/go/src/ir_to_go/mod.rs:127-146 | engine/generators/languages/rust/src/ir_to_rust/mod.rs:145-164 \u2014 before extracting anything, compare \u0060engine/generators/languages/go/src/ir_to_go/mod.rs\u0060 and \u0060engine/generators/languages/rust/src/ir_to_rust/mod.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 208 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/generators/languages/go/src/ir_to_go/mod.rs:127\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":"engine/generators/languages/go/src/ir_to_go/mod.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"03440be45f368dd87f52b8134eb18e0f920603ba64950ddca3a8f2b77f9eafd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): engine/generators/languages/python/src/watchers.rs:297-316 | engine/generators/languages/typescript/src/watchers.rs:285-304 \u2014 before extracting anything, compare \u0060engine/generators/languages/python/src/watchers.rs\u0060 and \u0060engine/generators/languages/typescript/src/watchers.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/python/src/watchers.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"f162d93f1823d68e8943acf22d63288cd924e0e70bc16a071ae2b4abb1604f43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): languages/rust/baml/src/runtime.rs:458-477 | languages/rust/baml/src/runtime.rs:504-523 \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":"languages/rust/baml/src/runtime.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"e167b851f087b6f88f50f2f201ce773bf8a2a06e42849f46e928f73e489d80aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 4): baml_language/crates/baml_compiler2_mir/src/lower.rs:7873-7891 | baml_language/crates/baml_compiler2_mir/src/lower.rs:7925-7941 | baml_language/crates/baml_compiler2_mir/src/lower.rs:8009-8025 | baml_language/crates/baml_compiler2_mir/src/lower.rs:8260-8276 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:7873\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":7873}}}],"partialFingerprints":{"codehealthFindingId/v1":"3689517c1c92944efc3f0824f6d3b2382eab21ce56afef6c6febdda58ed4aec6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 4): baml_language/crates/baml_fmt/src/ast/declarations.rs:459-476 | baml_language/crates/baml_fmt/src/ast/declarations.rs:580-599 | baml_language/crates/baml_fmt/src/ast/declarations.rs:888-905 | baml_language/crates/baml_fmt/src/ast/declarations.rs:974-991 \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 \u0060baml_language/crates/baml_fmt/src/ast/declarations.rs:459\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":"baml_language/crates/baml_fmt/src/ast/declarations.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"672a49a9249fc0165a66e146afa34cc59ad7823e103b16454d34794e8acc2a21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 4): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1301-1318 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1393-1411 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1889-1906 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1963-1980 \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 \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1301\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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"98584eaac9fd31fe53abeaa066dab390486a0aa6d8266a43eca7e95450b7eb15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:1523-1541 | baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:1701-1719 | baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:1784-1802 \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 \u0060baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:1523\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":"baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"c215b6e5ead15d07573a45ff2566fc0fd87b6ab9b7f9b907e17b6d10fce8f657"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201319 lines \u00D7 3): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:334-347 | baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs:1054-1072 | baml_language/crates/baml_type/src/unify.rs:646-659 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs\u0060 and \u0060baml_language/crates/baml_type/src/unify.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 452 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:334\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"80bf9dba3b415f217c0b6cc637277eb52cff068e95336014a1f441272a1cce8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedProgram.cs:198-215 | baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedProgram.cs:234-251 \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 \u0060baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedProgram.cs:198\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedProgram.cs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da63bae5b7d1f3bd679d7b891e735a6246a7203b18b0d79121d9700743800e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs:355-370 | baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs:405-420 \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":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"433e14c28f274a3fb6955f9459d8fa96f1bd804ce2c2cc6d7025922f96dee1b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/method_resolution.rs:1162-1177 | baml_language/crates/baml_compiler2_hir_ty/src/method_resolution.rs:1220-1238 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/method_resolution.rs:1162\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/method_resolution.rs"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b10a4d66bba552173222aecb1aa7d52d9b68e9dc8575c0b088b06567b459376"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201319 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:12098-12109 | baml_language/crates/baml_compiler2_mir/src/lower.rs:12158-12176 \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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":12098}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2dece286fcb0a633369f80d8032863832cb35e380af6dc47c94ccba1763422c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:380-398 | baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:416-434 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:380\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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa9b6d992506d3b065dfe49fa8e771f1e836d144b1353595cd3471f02f74d3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): baml_language/crates/baml_ide/src/resolve.rs:279-297 | baml_language/crates/baml_ide/src/resolve.rs:451-469 \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 \u0060baml_language/crates/baml_ide/src/resolve.rs:279\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/resolve.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"3193f3ab4a1827e67c625cd9697e9aaceb176006342716c7c755e4bb898d4d00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): baml_language/crates/baml_type/src/normalize/mu.rs:696-717 | baml_language/crates/baml_type/src/normalize/mu.rs:1427-1448 \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 \u0060baml_language/crates/baml_type/src/normalize/mu.rs:696\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":"baml_language/crates/baml_type/src/normalize/mu.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8508702e09f7410e44a67ea358a3c4eca4611e34fa059b428464759bffd9f40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/mod.rs:40-58 | engine/baml-lib/jsonish/src/jsonish/parser/mod.rs:37-55 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/mod.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/mod.rs\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/mod.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2adc12fd2fdcf5a2fb916a1e2affb1024e697626b057729536d59625210f96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): baml_language/crates/bex_vm/src/package_reflect/reflect.rs:501-519 | baml_language/crates/bex_vm/src/type_context.rs:70-88 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/reflect.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3ee93f6f3f6fe27cfbda8a32dcf171a22f67ce0460f6fec92f1e06fde872e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201319 lines \u00D7 3): baml_language/crates/bridge_wasm/src/wasm_http.rs:758-774 | baml_language/crates/sys_native/src/io_impls.rs:3060-3063 | baml_language/crates/sys_native/src/io_impls.rs:3504-3522 \u2014 before extracting anything, compare \u0060baml_language/crates/bridge_wasm/src/wasm_http.rs\u0060 and \u0060baml_language/crates/sys_native/src/io_impls.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bridge_wasm/src/wasm_http.rs:758\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_wasm/src/wasm_http.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b01545a747465ae8d486bcc05c1a38d5407d36768e12ccf7425d45349e06c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): baml_language/crates/sys_ops/src/lib.rs:3168-3186 | baml_language/crates/sys_ops/src/lib.rs:3264-3282 \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 \u0060baml_language/crates/sys_ops/src/lib.rs:3168\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":"baml_language/crates/sys_ops/src/lib.rs"},"region":{"startLine":3168}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab21b17adf5c9d3bef845e6a8dd6fa25489855ecf1cad49a2f23ddc5606db5ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): baml_language/crates/sys_ops/src/output_format.rs:528-545 | engine/baml-lib/jinja-runtime/src/output_format/types.rs:1009-1027 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_ops/src/output_format.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24ca1982b0c2e2d26ddd9cfeef0bbff382486d02db612f1f455012a88d6af33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): baml_language/sdks/go/sdkgen_go/src/lib.rs:2704-2719 | baml_language/sdks/go/sdkgen_go/src/lib.rs:2797-2815 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdks/go/sdkgen_go/src/lib.rs:2704\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":2704}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1acab79a7a288d04e7fa5b18a5f4c6fba87f3dd14640a741a3ca545d3239c72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201319 lines \u00D7 2): engine/baml-compiler/src/thir.rs:315-329 | engine/baml-lib/baml-types/src/expr.rs:260-278 \u2014 before extracting anything, compare \u0060engine/baml-compiler/src/thir.rs\u0060 and \u0060engine/baml-lib/baml-types/src/expr.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/baml-types/src/expr.rs:260\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/thir.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fe0293e516b1c5c4ab38efcf8a42713e7ce147246ad8c2d86a6156608ed5de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): engine/baml-lib/jsonish/src/helpers/mod.rs:325-344 | engine/baml-runtime/src/internal/llm_client/mod.rs:38-57 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/helpers/mod.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5c1ed4ebda97e0b75cb7af78056d9aaae39e5579be4260a2570b52ee6564ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): engine/baml-vm/src/vm.rs:852-870 | engine/baml-vm/src/vm.rs:889-906 \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":"engine/baml-vm/src/vm.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"386150719169be794902993433b213c1c0f0058c4571fc45008bcfbb2a35e9e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): engine/generators/languages/python/src/ir_to_py/mod.rs:40-58 | engine/generators/languages/python/src/ir_to_py/mod.rs:142-157 \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 \u0060engine/generators/languages/python/src/ir_to_py/mod.rs:40\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/python/src/ir_to_py/mod.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc54f08af53aef05bf52570c8514a617bdc79bb29ca55008cdc10d3adbc8766"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): engine/generators/languages/ruby/src/ir_to_rb/mod.rs:109-127 | engine/generators/languages/ruby/src/ir_to_rb/mod.rs:208-225 \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 \u0060engine/generators/languages/ruby/src/ir_to_rb/mod.rs:109\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":"engine/generators/languages/ruby/src/ir_to_rb/mod.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90ee3c4f28fafe209a1f0236505d900dd34b02e99b7cf04f345e12b82ec662f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 4): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1253-1270 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1345-1362 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1843-1860 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1918-1935 \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 \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1253\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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d46d430ea753a134bd6a3c350a613ddef2a7fc6eb781a87c1b72e05a378d290"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 3): baml_language/crates/baml_cli/src/pack_command.rs:574-591 | baml_language/crates/baml_cli/src/run_command.rs:928-944 | baml_language/crates/baml_cli/src/test_command.rs:468-483 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_cli/src/pack_command.rs\u0060 and \u0060baml_language/crates/baml_cli/src/run_command.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_cli/src/pack_command.rs:574\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":"baml_language/crates/baml_cli/src/pack_command.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"50dd37ca80e3a6e0f4d2b048fb3255b220024e523e6eb161ecf6945c280831d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:2222-2239 | baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:2245-2262 | baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:2309-2326 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:2222\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":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":2222}}}],"partialFingerprints":{"codehealthFindingId/v1":"983bbf32aef8418dd7ade1ed6582b9c3af87f8519b1591d9063bf122aa50d59d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2165-2182 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2721-2738 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2990-3007 \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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66c52937454232a56bfbdf370acc88f450869aa42d6361527b6cf4248525ee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): baml_language/sdks/csharp/bridge_csharp/src/Proto/PrimitiveProtocol.cs:310-326 | baml_language/sdks/csharp/bridge_csharp/src/Proto/PrimitiveProtocol.cs:366-382 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/sdks/csharp/bridge_csharp/src/Proto/PrimitiveProtocol.cs:308\u0060 calls \u0060RequireExpectedStreamType\u0060 and \u0060baml_language/sdks/csharp/bridge_csharp/src/Proto/PrimitiveProtocol.cs:364\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":"baml_language/sdks/csharp/bridge_csharp/src/Proto/PrimitiveProtocol.cs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b3103c3b302f977a6abe78b9f2bbb2dc3ef6e95a6e77a16e2fb5c1eb706fb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): baml_language/crates/baml_builtins2_codegen/src/codegen.rs:885-902 | baml_language/crates/baml_builtins2_codegen/src/codegen.rs:983-1000 \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":"baml_language/crates/baml_builtins2_codegen/src/codegen.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce61c0258dd7f5ae4163d220bf6eb46fa559e3741b5afea29755170bf643966"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): baml_language/crates/baml_compiler2_emit/src/analysis.rs:906-923 | baml_language/crates/baml_compiler2_emit/src/analysis.rs:952-966 \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 \u0060baml_language/crates/baml_compiler2_emit/src/analysis.rs:906\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":"baml_language/crates/baml_compiler2_emit/src/analysis.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ea767985e396043cb8c31d1dd6f0a77340085a2110e6c9453c5f0f0e30c7a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201318 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs:949-966 | baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs:1500-1510 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs:949\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"130dad4ec78a4372195121ae2255b69658991b6a6dfd4658998f55d60d24875b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:1963-1980 | baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:2160-2177 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:1963\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":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":1963}}}],"partialFingerprints":{"codehealthFindingId/v1":"729ccd590c1c754e436f3d6b487b83db1e9fb74ff780b3303aa75ddb00bd4fff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:487-504 | engine/baml-runtime/src/control_flow/flatten/step2_hoist_branch_arms.rs:74-91 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:487\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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89d908c99575cd6aa5ae7a907a57fb50878ae5e6200dcfed540ec405c994283"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:320-337 | baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:471-488 \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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e909fce9d19e7c336af45ff351682052893f90d18f8b7120d467cb155f901a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): baml_language/crates/baml_lsp_server/src/playground_seam.rs:1079-1096 | baml_language/crates/bridge_wasm/src/playground.rs:578-595 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_lsp_server/src/playground_seam.rs:1079\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":"baml_language/crates/baml_lsp_server/src/playground_seam.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4fb070091717b07f7d11f8ef91d552a91d0f5d417069533888c9c1b4491151"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): baml_language/crates/baml_parser/src/lib.rs:75-92 | baml_language/crates/baml_parser/src/types.rs:774-791 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_parser/src/lib.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a0f503584f57816d671abb4a9400e614483c82a1080dc04c059bbf421e2955"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs:112-128 | engine/baml-lib/jsonish/src/deserializer/coercer/array_helper.rs:77-94 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs\u0060 and \u0060engine/baml-lib/jsonish/src/deserializer/coercer/array_helper.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 98 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs:112\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ab3242ed9d58bc9fdb40ee41228cffd3ccf7c8b202a1e2187240f32c492e76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs:239-256 | engine/baml-lib/jsonish/src/deserializer/coercer/array_helper.rs:203-218 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs\u0060 and \u0060engine/baml-lib/jsonish/src/deserializer/coercer/array_helper.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 98 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs:239\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"3682cf135d31ffb4cf466efe638647f29023cd23739fd9398c14cdecb58802d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:238-257 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:268-287 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 586 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:238\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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8088ca2bebe84bc85c4de7541403e31abd25c572fc24c67e8cd9a82b7ec50f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:357-374 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:384-401 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 586 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:357\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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f36ff19a1aae911a3fdbc1ab655bf5018a7c0a56f8912b9bcfed02da4f176c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): baml_language/crates/bridge_cffi/src/ffi/handle.rs:180-197 | baml_language/crates/bridge_cffi/src/ffi/handle.rs:271-288 \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":"baml_language/crates/bridge_cffi/src/ffi/handle.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e3b9d41a470f994f55b13e708a0d581f771faaeff88374dd1bd76147ace7db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): baml_language/crates/bridge_ctypes/src/wire_depth.rs:106-123 | baml_language/sdks/rust/bridge_rust/src/encode.rs:465-482 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bridge_ctypes/src/wire_depth.rs:106\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060ty\u0060 to \u0060\u0026BamlTy\u0060 in one and \u0060\u0026wire::BamlTy\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":"baml_language/crates/bridge_ctypes/src/wire_depth.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1a2cb7b96b4cd0d71bf571fd69cecff1769f44427382bbf752f9393b7d3266"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): baml_language/crates/bridge_ctypes/src/wire_depth.rs:133-150 | baml_language/sdks/rust/bridge_rust/src/encode.rs:492-509 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bridge_ctypes/src/wire_depth.rs:133\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060ty\u0060 to \u0060\u0026BamlTy\u0060 in one and \u0060\u0026wire::BamlTy\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":"baml_language/crates/bridge_ctypes/src/wire_depth.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e77d3c1dc5be042263ad31e0c79dc43de17210a744ad46b9e29e27aa50bed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): baml_language/crates/btel_recorder/src/lib.rs:292-309 | baml_language/crates/btel_recorder/src/lib.rs:316-333 \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 \u0060baml_language/crates/btel_recorder/src/lib.rs:292\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":"baml_language/crates/btel_recorder/src/lib.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"945a8d2b3d1e3c19707f07bc85e37da297f6276fafaece5cc413ac80cbb03390"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/utils.rs:20-35 | engine/generators/languages/python/src/utils.rs:19-36 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/utils.rs:20\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/utils.rs:18\u0060 calls \u0060escape_for_docstring\u0060 and \u0060engine/generators/languages/python/src/utils.rs:17\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/utils.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f5c9a20d1a1f73ef80dc9adafb4f3c49d44bb7cb14c6ccde73948f7a3e903e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): engine/baml-runtime/src/async_interpreter_runtime.rs:494-509 | engine/baml-runtime/src/async_vm_runtime.rs:796-813 \u2014 before extracting anything, compare \u0060engine/baml-runtime/src/async_interpreter_runtime.rs\u0060 and \u0060engine/baml-runtime/src/async_vm_runtime.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/async_interpreter_runtime.rs:494\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/async_interpreter_runtime.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf0da093748380434f623edaf69251c096c8409e4082f102195079482ef7373"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): engine/baml-runtime/src/optimize/storage.rs:215-232 | engine/baml-runtime/src/optimize/tui.rs:1236-1253 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/optimize/storage.rs:215\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":"engine/baml-runtime/src/optimize/storage.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"3048a162f29787dcb1c3f7ba4ab195337f4c00e9b1052710ad5ff72f42800327"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): engine/generators/languages/python/src/watchers.rs:89-106 | engine/generators/languages/typescript/src/watchers.rs:93-110 \u2014 before extracting anything, compare \u0060engine/generators/languages/python/src/watchers.rs\u0060 and \u0060engine/generators/languages/typescript/src/watchers.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/generators/languages/python/src/watchers.rs:89\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":"engine/generators/languages/python/src/watchers.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2a517e2a0e695806a3fd8170806fb8dbca84492cde7ec010e0e93974a0a451"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): engine/language_client_ruby/ext/ruby_ffi/src/ruby_to_json.rs:221-238 | engine/language_client_ruby/ext/ruby_ffi/src/ruby_to_json.rs:244-261 \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 \u0060engine/language_client_ruby/ext/ruby_ffi/src/ruby_to_json.rs:221\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060from\u0060 to \u0060Value\u0060 in one and \u0060RHash\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":"engine/language_client_ruby/ext/ruby_ffi/src/ruby_to_json.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc516d128013ba2fa93d9785f5d7ec12b83572a1bcb9470c47d5dff632b9f11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201318 lines \u00D7 2): languages/rust/baml/src/args.rs:269-281 | languages/rust/baml/src/args.rs:427-444 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060languages/rust/baml/src/args.rs:269\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060languages/rust/baml/src/args.rs:445\u0060 calls \u0060is_cancelled\u0060, \u0060on_cancel\u0060 and \u0060languages/rust/baml/src/args.rs:283\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":"languages/rust/baml/src/args.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5aa090026c69b3dede1ec00cc12f89b767f8bd36700a1ec9519d781db7e702d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 4): baml_language/crates/bex_vm/src/package_reflect/graft.rs:1186-1202 | baml_language/crates/bex_vm/src/package_reflect/graft.rs:1343-1358 | baml_language/crates/bex_vm_types/src/types/object.rs:217-232 | baml_language/crates/bex_vm_types/src/types/object.rs:250-265 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/graft.rs"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4968d04c53ece8cfe78ac3b4645600497528a2a9e9949c93851c9ebdd632686"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:1502-1518 | baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:1683-1699 | baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:1766-1782 \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":"baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"949936b49e99fe802b028727d4fd95792111b80da555f34d0f12f2e2ecf476cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): engine/baml-lib/baml-types/src/baml_value.rs:500-516 | engine/baml-lib/baml-types/src/baml_value.rs:637-653 | engine/baml-lib/baml-types/src/baml_value.rs:774-790 \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 \u0060engine/baml-lib/baml-types/src/baml_value.rs:500\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":"engine/baml-lib/baml-types/src/baml_value.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"5535bd9c7e7eb16d9a26f217a6957f95d45d8b092ce06be23d5d98166c5c1fb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): engine/generators/languages/python/src/ir_to_py/functions.rs:22-38 | engine/generators/languages/python/src/ir_to_py/functions.rs:62-78 | engine/generators/languages/ruby/src/ir_to_rb/functions.rs:22-38 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/generators/languages/python/src/ir_to_py/functions.rs:22\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060function\u0060 to \u0060\u0026FunctionNode\u0060 in one and \u0060\u0026ExprFunctionNode\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":"engine/generators/languages/python/src/ir_to_py/functions.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad792ea3099fca70ab1165e79d2c4d1514cdd3ecdf93b019b1b4c5b93559bea2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs:375-390 | baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs:441-456 \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":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fa0cc31478b142717f208f0c83306b34c5f69a40a7039aaa87235161019aa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): baml_language/crates/baml_builtins2_codegen/src/extract.rs:296-311 | baml_language/crates/baml_builtins2_codegen/src/extract.rs:656-672 \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":"baml_language/crates/baml_builtins2_codegen/src/extract.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78a2307b4f338e9e13aa1e0af923d86bd1f259099c1cfde180495c95b38c17d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201317 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:359-370 | baml_language/crates/baml_type/src/unify.rs:669-685 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs\u0060 and \u0060baml_language/crates/baml_type/src/unify.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 452 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:359\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":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"d165a5743a982305e391047aa08e3db5f6efd64d4e3991735e3b77e9642dd7c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:6127-6142 | baml_language/crates/baml_compiler2_mir/src/lower.rs:10328-10344 \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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":6127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96c5dd1377988531b0e17ae76f193f6211d27ca8f01c7d241684fb1d36d2f00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): baml_language/crates/baml_ide/src/listing.rs:259-275 | baml_language/crates/baml_ide/src/listing.rs:330-346 \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 \u0060baml_language/crates/baml_ide/src/listing.rs:259\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":"baml_language/crates/baml_ide/src/listing.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ca5bd41050bd8baf5f57bab646233de14b4613f98f989ba8c7bc43b8417534"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): baml_language/crates/baml_lsp_server/src/playground_server.rs:1951-1967 | baml_language/crates/baml_lsp_server/src/playground_server.rs:1985-2001 \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 \u0060baml_language/crates/baml_lsp_server/src/playground_server.rs:1951\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":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":1951}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6859f0d147a1569321e4e90d0e1ebbb842a706dc22fab4d4eafe48440822e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): baml_language/crates/baml_lsp_server/src/playground_server.rs:2207-2223 | baml_language/crates/baml_lsp_server/src/playground_server.rs:2245-2261 \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 \u0060baml_language/crates/baml_lsp_server/src/playground_server.rs:2207\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":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":2207}}}],"partialFingerprints":{"codehealthFindingId/v1":"5132f16b639e49c79e41c69443d0153b99eefc1e7f14ec2c4ef11e8bfdb94c1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): baml_language/crates/bex_vm/src/package_baml/array.rs:133-149 | baml_language/crates/bex_vm/src/package_baml/root.rs:1063-1079 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/array.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"25745eb289d998ae54e128d5ded71cd3b19ba56c9d1a413cbb30e87fc51bbab3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): baml_language/crates/bex_vm/src/package_baml/array.rs:1171-1187 | baml_language/crates/bex_vm/src/package_baml/array.rs:1199-1215 \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 \u0060baml_language/crates/bex_vm/src/package_baml/array.rs:1171\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":"baml_language/crates/bex_vm/src/package_baml/array.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"9defc36cbbe0c3391a4080a555a0f59674cc194965d4fb8f9431eb52bc53a636"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): baml_language/crates/bex_vm/src/package_baml/ops.rs:521-537 | baml_language/crates/bex_vm/src/package_baml/ops.rs:554-570 \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 \u0060baml_language/crates/bex_vm/src/package_baml/ops.rs:521\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":"baml_language/crates/bex_vm/src/package_baml/ops.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"281c22bcbed876a65c01774eb746a552a578afb42f91590446faa52b9a275cd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): baml_language/crates/btel_snapshot/src/graph.rs:341-357 | baml_language/crates/btel_snapshot/src/shape.rs:154-170 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/btel_snapshot/src/graph.rs:341\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":"baml_language/crates/btel_snapshot/src/graph.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8c450e66ceafe07d491f6b499efed8c1324b7aedbb506c242cf387b2ccef1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): baml_language/sdks/go/sdkgen_go/src/names.rs:432-448 | baml_language/sdks/go/sdkgen_go/src/names.rs:531-547 \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 \u0060baml_language/sdks/go/sdkgen_go/src/names.rs:432\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":"baml_language/sdks/go/sdkgen_go/src/names.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"5272e35e8ec85fbd4bd5ffd9948b692dfd500a17eed32869dd6fba96cc72e396"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/emit/typemap_file.rs:78-91 | baml_language/sdks/typescript/sdkgen_typescript_shared/src/emit/typemap_file.rs:66-82 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/emit/typemap_file.rs:78\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/emit/typemap_file.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af1a98ce9575b5eb521c634c17e1ac358f73068fa84a03bcb3ff2525dd32522"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201317 lines \u00D7 2): baml_language/sdks/typescript/sdkgen_typescript_shared/src/translate_ty.rs:101-117 | baml_language/sdks/typescript/sdkgen_typescript_shared/src/translate_ty.rs:384-394 \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 \u0060baml_language/sdks/typescript/sdkgen_typescript_shared/src/translate_ty.rs:101\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":"baml_language/sdks/typescript/sdkgen_typescript_shared/src/translate_ty.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec82ed1a7c4320e58ec5ab22c8ac26fd84ad384a1cd52a013ed877917968ed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/baml-lib/ast/src/formatter/mod.rs:296-312 | engine/baml-lib/ast/src/formatter/mod.rs:349-365 \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 \u0060engine/baml-lib/ast/src/formatter/mod.rs:296\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":"engine/baml-lib/ast/src/formatter/mod.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9d8e081cd55b5552d0557483dcbb96ad65933b6e5897c258bf69a0158183bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/baml-lib/ast/src/parser/parse_expression.rs:234-250 | engine/baml-lib/ast/src/parser/parse_expression.rs:425-441 \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 \u0060engine/baml-lib/ast/src/parser/parse_expression.rs:234\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":"engine/baml-lib/ast/src/parser/parse_expression.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abc5019ae8bea61ff3a1d0b93fe92c06fbf1fe00109cec3e94f37417d4fcbb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/baml-lib/baml-types/src/baml_value.rs:133-149 | engine/baml-lib/baml-types/src/baml_value.rs:930-946 \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 \u0060engine/baml-lib/baml-types/src/baml_value.rs:133\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":"engine/baml-lib/baml-types/src/baml_value.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a48b417b4e7a98ee2e7099afa08ef68ccd77679de0de15b454d9a7fe534540"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): engine/baml-lib/diagnostics/src/error.rs:553-568 | engine/baml-lib/diagnostics/src/warning.rs:119-135 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/diagnostics/src/error.rs:553\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, \u0060engine/baml-lib/diagnostics/src/error.rs:552\u0060 calls \u0060sort_by_match\u0060, \u0060Some\u0060 and \u0060engine/baml-lib/diagnostics/src/warning.rs:117\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/diagnostics/src/error.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"015daa9e57773e726d5343bb065cd19be2030901a5c60b8305262c4e16dd9865"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/baml-lib/jsonish/src/helpers/mod.rs:299-315 | engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs:514-530 \u2014 before extracting anything, compare \u0060engine/baml-lib/jsonish/src/helpers/mod.rs\u0060 and \u0060engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/jsonish/src/helpers/mod.rs:299\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":"engine/baml-lib/jsonish/src/helpers/mod.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe262e3391474194dd772441e4b6f137d720c88e9a77f0a0cffa5ba73593152e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/baml-rpc/src/ast/type_reference.rs:273-289 | engine/baml-rpc/src/ast/type_reference.rs:292-308 \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":"engine/baml-rpc/src/ast/type_reference.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"f142c1ea03c0f2c6a5e12adb4724ce29ecb8a6cf310ed9c7ae2822efdfbb0a62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): engine/baml-runtime/src/async_interpreter_runtime.rs:381-396 | engine/baml-runtime/src/async_interpreter_runtime.rs:413-429 \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 \u0060engine/baml-runtime/src/async_interpreter_runtime.rs:413\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":"engine/baml-runtime/src/async_interpreter_runtime.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"753135b64633d3ab911000e08334fb425e4556be06d414c3984f5f151e3e91a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/mod.rs:330-346 | engine/baml-runtime/src/internal/llm_client/mod.rs:360-376 \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 \u0060engine/baml-runtime/src/internal/llm_client/mod.rs:330\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":"engine/baml-runtime/src/internal/llm_client/mod.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"9023546275b19d855928612ddf5cfd7f722d1dfce53384a5687f5aec703bd698"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/baml-runtime/src/runtime_methods/prepare_function.rs:119-135 | engine/baml-runtime/src/runtime_methods/prepare_function.rs:161-177 \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":"engine/baml-runtime/src/runtime_methods/prepare_function.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb835bb8feb8eacde641e6aaea40f5f9432dad83f8e68d2479e183f03823fc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/baml-runtime/src/types/response.rs:432-448 | engine/baml-runtime/src/types/response.rs:463-479 \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 \u0060engine/baml-runtime/src/types/response.rs:432\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":"engine/baml-runtime/src/types/response.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"41da59aeb49f54a6e958400f9f2ad0e91b8084da8c57af3ecf5958d17ce8db32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201317 lines \u00D7 5): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2093-2094 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2468-2484 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2574-2590 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2851-2852 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:3070-3071 \u2014 all 5 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 \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2468\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2468\u0060 calls \u0060get\u0060, \u0060as_string\u0060, \u0060unwrap\u0060 and \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2093\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":2093}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab532d17cf42132b0a8b5d2949268299be3c3aba85c028bc4e41178200e2b4db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:424-440 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:448-464 \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":"engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a6e7b09dbe9adfd64d085123a5869ac7deb0a9924566c96591cc024bd61ab2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): languages/rust/baml/src/codec/helpers.rs:14-30 | languages/rust/baml/src/lib.rs:149-165 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"languages/rust/baml/src/codec/helpers.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89ab7178434f9be9eacb44cac0270e094a0e575f0b5cc6444f84caa9a4299d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:531-546 | baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:619-634 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:654-669 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 586 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"599f0e8e078cf32d10393e89d1921b5b2491c466cdcc587029f66a328357fee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): baml_language/sdks/csharp/bridge_csharp/src/Values/BamlValue.cs:15-30 | baml_language/sdks/csharp/bridge_csharp/src/Values/BamlValue.cs:36-51 \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":"baml_language/sdks/csharp/bridge_csharp/src/Values/BamlValue.cs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"333c48dc2191d01cc6e929764804d67548d0402d90e25b84fc280ab386b33f35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 2): baml_language/crates/baml_cli/src/project_load.rs:149-160 | baml_language/crates/baml_cli/src/project_load.rs:383-398 \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 \u0060baml_language/crates/baml_cli/src/project_load.rs:149\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":"baml_language/crates/baml_cli/src/project_load.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf88e3b5f904b1fa70373ee2ea2ba849bfd0e123fbd95a9d70d707fa98f7ae81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:930-947 | baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:962-977 \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 \u0060baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:930\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":"baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"07196a51789ff0151136dde88f1514fc14c98e7256bcbd3d96ab5bbfc5aeeebc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:1226-1241 | baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:918-933 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea5b962a391f911325e9f627a2864bb149cbb6c2f368831ffa117c2af468492"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:7043-7058 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:10085-10099 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:7043\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":7043}}}],"partialFingerprints":{"codehealthFindingId/v1":"05027b62b413c5d84693b26db0ad8eb67fe1833a2e1832dbe33c13becf435b41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:12521-12536 | baml_language/crates/baml_compiler2_mir/src/lower.rs:12589-12604 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:12521\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":12521}}}],"partialFingerprints":{"codehealthFindingId/v1":"913c568b7a988715bfaf634ed3eff7b61e73c01e4353473b794271571ca98980"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:697-712 | engine/baml-runtime/src/control_flow/flatten/step3_inline_implicit_nodes.rs:165-178 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs\u0060 and \u0060engine/baml-runtime/src/control_flow/flatten/step3_inline_implicit_nodes.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 132 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:697\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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d46a11e48466eda315f507290dcd50d99a14217c427d350752f708c4109425"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/pattern.rs:28-43 | baml_language/crates/baml_fmt/src/ast/pattern.rs:57-72 \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":"baml_language/crates/baml_fmt/src/ast/pattern.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd12cb135a3ca48966722f52aaf4562107d18eea7dc57215324e5faf632dedb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): baml_language/crates/baml_ide/src/export.rs:1081-1096 | baml_language/crates/baml_ide/src/export.rs:1109-1124 \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 \u0060baml_language/crates/baml_ide/src/export.rs:1081\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":"baml_language/crates/baml_ide/src/export.rs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2d8c6184c7084273133f5ef43db53bb21d049dc2be595b82f1c56f461f8425"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): baml_language/crates/baml_lsp_server/src/playground_server.rs:521-536 | baml_language/crates/bridge_wasm/src/runs.rs:468-483 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_lsp_server/src/playground_server.rs:521\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":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89b285353158e91b8a21e348dc98ed198aa9df5004572b1d6e8ed72b62ab1d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): baml_language/crates/baml_path/src/native/non_windows.rs:12-27 | baml_language/crates/baml_path/src/native/windows.rs:32-47 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_path/src/native/non_windows.rs:12\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":"baml_language/crates/baml_path/src/native/non_windows.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6864a2b23a7ea513ddcf48815a4ecddc56477e106a3758efb6017a2f6c2c8dcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): baml_language/crates/baml_query_btel/src/ingest.rs:712-727 | baml_language/crates/baml_query_btel/src/ingest.rs:927-942 \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 \u0060baml_language/crates/baml_query_btel/src/ingest.rs:712\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":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b2a28a9e5b4635ae00fbc5b1d94eb9ceb15243f613a17a353563250c601963"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): baml_language/crates/baml_query_btel/src/sql.rs:538-551 | baml_language/crates/baml_query_btel/src/sql.rs:572-587 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/sql.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f043255dbd24cbb025eb2c6a4e6fb9b24d75b3a301ca0c4750c87d3ab684eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): baml_language/crates/baml_type_macros/src/emit.rs:296-311 | baml_language/crates/baml_type_macros/src/emit.rs:777-792 \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 \u0060baml_language/crates/baml_type_macros/src/emit.rs:296\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":"baml_language/crates/baml_type_macros/src/emit.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"398a61264f912105c42ad802fd69dfd387d42f8589d95d478b75c5540fc98ebb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/coercer/match_string.rs:155-170 | engine/baml-lib/jsonish/src/deserializer/coercer/match_string.rs:144-159 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/deserializer/coercer/match_string.rs\u0060 and \u0060engine/baml-lib/jsonish/src/deserializer/coercer/match_string.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/coercer/match_string.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00a55bb40b27ea479baa6c69dc7bb66df61272981f34dcb26995635183e895c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:115-130 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:120-135 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 586 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:115\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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"d534e0a6df23a9f0957e0118ffa0ef5183cc66f0fbffe24fbe8f9929c0021de3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/multi_json_parser.rs:11-26 | engine/baml-lib/jsonish/src/jsonish/parser/multi_json_parser.rs:10-25 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/multi_json_parser.rs:11\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":"baml_language/crates/bex_sap/src/jsonish/parser/multi_json_parser.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e04a472bff127887e5f2d20ae96fe69b4de79442ca594be4c3a699d450fa8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): baml_language/crates/bex_vm/src/debug.rs:561-576 | engine/baml-vm/src/debug.rs:264-279 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_vm/src/debug.rs\u0060 and \u0060engine/baml-vm/src/debug.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_vm/src/debug.rs:561\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/debug.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af7cc5276f2f98c4445c953a29c48415af3159a935792b599cca1f0b5d36702"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): baml_language/crates/bex_vm/src/package_baml/array.rs:1125-1140 | baml_language/crates/bex_vm/src/package_baml/array.rs:1148-1163 \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 \u0060baml_language/crates/bex_vm/src/package_baml/array.rs:1125\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":"baml_language/crates/bex_vm/src/package_baml/array.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d3c1d0438e11abfa5d5e69a7013b63ece87a8a95c965086be5f3fde7913882"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): baml_language/crates/bex_vm/src/package_baml/root.rs:402-418 | baml_language/crates/bex_vm/src/package_baml/root.rs:468-484 \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":"baml_language/crates/bex_vm/src/package_baml/root.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac18af9c8e3f6ebf67b74ada97d3a435ae7f0c217f4b23ade8a96c081f8673b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs:999-1011 | baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs:399-414 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs:999\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":"baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2eaef53e16669a6c11151f84886067e64ceb57dcaa25f4b37eea423ae84990f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201316 lines \u00D7 2): baml_language/crates/bex_vm/src/vm.rs:8976-8984 | baml_language/crates/bex_vm/src/vm.rs:9002-9017 \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 \u0060baml_language/crates/bex_vm/src/vm.rs:8976\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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":8976}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca32c3d88c2351a8af78c835ee4259a2620451f27edf51c22fb9d2f1f2b5def3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): baml_language/crates/tools_size_gate/src/main.rs:310-325 | baml_language/crates/tools_size_gate/src/main.rs:505-518 \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":"baml_language/crates/tools_size_gate/src/main.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4b92f6d885ad8ae49bbff0a7144c6a107be885c75599555f5023594106f2db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): baml_language/sdks/go/sdkgen_go/src/lib.rs:1699-1714 | baml_language/sdks/go/sdkgen_go/src/lib.rs:1790-1805 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/sdks/go/sdkgen_go/src/lib.rs:1716\u0060 calls \u0060iter\u0060, \u0060filter\u0060 and \u0060baml_language/sdks/go/sdkgen_go/src/lib.rs:1807\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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"1689afc2c4a578e38bf914e3d56b162c879f9c04555a004376685e5b7a790fb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 2): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:1408-1419 | baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:2304-2319 \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 \u0060baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:1408\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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":1408}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a251416a35c9b0cec5d90be26fb1fe5d6ab21febeeeb7f97ac1c05dcfda10f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): engine/baml-compiler/src/thir/interpret.rs:1856-1872 | engine/baml-compiler/src/thir/interpret.rs:2298-2313 \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":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":1856}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b933ed4cfcd1c7b4d1f6b1bf7b5c518c44c860d584bc5352c099b6db809d9a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): engine/baml-lib/baml-types/src/baml_value.rs:116-131 | engine/baml-lib/baml-types/src/baml_value.rs:913-928 \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":"engine/baml-lib/baml-types/src/baml_value.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3716c40da792a7aaebd84ac94c3832365623b089b7631c017abfef79dc6da709"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): engine/baml-lib/jsonish/src/deserializer/coercer/ir_ref/coerce_alias.rs:34-49 | engine/baml-lib/jsonish/src/deserializer/coercer/ir_ref/coerce_enum.rs:59-74 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/jsonish/src/deserializer/coercer/ir_ref/coerce_alias.rs:34\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":"engine/baml-lib/jsonish/src/deserializer/coercer/ir_ref/coerce_alias.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a35868c64d05a9ffb58bdea831ff48b64946463d89ad81bd223c99a5241126"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): engine/baml-runtime/src/cli/serve/mod.rs:411-426 | engine/baml-runtime/src/cli/serve/mod.rs:541-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/cli/serve/mod.rs:411\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":"engine/baml-runtime/src/cli/serve/mod.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"099c1088c7730de3775c3af6bd7c953ba10f2efc9b0ade2cfeddf6bf9e674d2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): engine/baml-runtime/src/cli/serve/ping.rs:19-33 | engine/playground-server/src/handlers/ping.rs:19-34 \u2014 before extracting anything, compare \u0060engine/baml-runtime/src/cli/serve/ping.rs\u0060 and \u0060engine/playground-server/src/handlers/ping.rs\u0060 as WHOLE FILES: 86% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/cli/serve/ping.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e8577f79c76dba050104a06ca6e0dea28278771dbdefe2d3ba66b3cf75a0f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/request.rs:281-296 | engine/baml-runtime/src/internal/llm_client/primitive/request.rs:339-354 \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 \u0060engine/baml-runtime/src/internal/llm_client/primitive/request.rs:281\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":"engine/baml-runtime/src/internal/llm_client/primitive/request.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d959812f1909279d25f7256d0b7c236f4ba6732d0b834f3e3f544029d2b5c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): engine/baml-runtime/src/optimize/applier.rs:224-239 | engine/baml-runtime/src/optimize/applier.rs:458-472 \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":"engine/baml-runtime/src/optimize/applier.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e1256219af3cbf8da78e2e1fe2812208b49e669114e9bc74473d4ef51236a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): engine/baml-vm/src/vm.rs:1458-1473 | engine/baml-vm/src/vm.rs:1642-1657 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-vm/src/vm.rs"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12b038548d5cec4b2b5180a19a31ca9a37ae3c923b5101468d8386b9ad85a15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): engine/generators/languages/go/src/ir_to_go/mod.rs:99-114 | engine/generators/languages/rust/src/ir_to_rust/mod.rs:117-132 \u2014 before extracting anything, compare \u0060engine/generators/languages/go/src/ir_to_go/mod.rs\u0060 and \u0060engine/generators/languages/rust/src/ir_to_rust/mod.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 208 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/generators/languages/go/src/ir_to_go/mod.rs:99\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":"engine/generators/languages/go/src/ir_to_go/mod.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"f476a582c420c628ca468b45bac247503338352591de754a5b68a2cff3ee024f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): engine/language_client_cffi/src/ffi/functions.rs:83-98 | engine/language_client_cffi/src/ffi/functions.rs:258-273 \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":"engine/language_client_cffi/src/ffi/functions.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d84b560a6774942d231a8f8225a4d076eacfbd2fb42e64a4f96ecf541d11af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): engine/language_client_ruby/ext/ruby_ffi/src/lib.rs:59-74 | engine/language_client_ruby/ext/ruby_ffi/src/lib.rs:85-100 \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 \u0060engine/language_client_ruby/ext/ruby_ffi/src/lib.rs:59\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":"engine/language_client_ruby/ext/ruby_ffi/src/lib.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a2aeb5540b26e90ccb7c991f08b6e4984228788aaa56baa33194d129b897d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 24): baml_language/crates/btel_records/src/lib.rs:820-834 | baml_language/crates/btel_records/src/lib.rs:841-855 | baml_language/crates/btel_records/src/lib.rs:862-876 | baml_language/crates/btel_records/src/lib.rs:883-897 | baml_language/crates/btel_records/src/lib.rs:904-918 | baml_language/crates/btel_records/src/lib.rs:925-939 | baml_language/crates/btel_records/src/lib.rs:946-960 | baml_language/crates/btel_records/src/lib.rs:967-981 | baml_language/crates/btel_records/src/lib.rs:988-1002 | baml_language/crates/btel_records/src/lib.rs:1010-1024 | baml_language/crates/btel_records/src/lib.rs:1031-1045 | baml_language/crates/btel_records/src/lib.rs:1053-1067 | baml_language/crates/btel_records/src/lib.rs:1074-1088 | baml_language/crates/btel_records/src/lib.rs:1096-1110 | baml_language/crates/btel_records/src/lib.rs:1117-1131 | baml_language/crates/btel_records/src/lib.rs:1139-1153 | baml_language/crates/btel_records/src/lib.rs:1160-1174 | baml_language/crates/btel_records/src/lib.rs:1181-1195 | baml_language/crates/btel_records/src/lib.rs:1202-1216 | baml_language/crates/btel_records/src/lib.rs:1223-1237 | baml_language/crates/btel_records/src/lib.rs:1244-1258 | baml_language/crates/btel_records/src/lib.rs:1266-1280 | baml_language/crates/btel_records/src/lib.rs:1287-1301 | baml_language/crates/btel_records/src/lib.rs:1309-1323 \u2014 all 24 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 \u0060baml_language/crates/btel_records/src/lib.rs:820\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":"baml_language/crates/btel_records/src/lib.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc85a122777dd47561c06553bf881f5f8c7ee902fe44631cbe41ec9dd273b012"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 8): baml_language/crates/btel_recorder/src/lib.rs:519-533 | baml_language/crates/btel_recorder/src/lib.rs:544-558 | baml_language/crates/btel_recorder/src/lib.rs:619-633 | baml_language/crates/btel_recorder/src/lib.rs:644-658 | baml_language/crates/btel_recorder/src/lib.rs:719-733 | baml_language/crates/btel_recorder/src/lib.rs:745-759 | baml_language/crates/btel_recorder/src/lib.rs:770-784 | baml_language/crates/btel_recorder/src/lib.rs:795-809 \u2014 all 8 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 \u0060baml_language/crates/btel_recorder/src/lib.rs:519\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":"baml_language/crates/btel_recorder/src/lib.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c291629f412313917c6b49ed89244b4ee2095b7f237e8a6550643025af874b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 8): baml_language/crates/btel_recorder/src/lib.rs:569-583 | baml_language/crates/btel_recorder/src/lib.rs:594-608 | baml_language/crates/btel_recorder/src/lib.rs:669-683 | baml_language/crates/btel_recorder/src/lib.rs:694-708 | baml_language/crates/btel_recorder/src/lib.rs:820-834 | baml_language/crates/btel_recorder/src/lib.rs:846-860 | baml_language/crates/btel_recorder/src/lib.rs:871-885 | baml_language/crates/btel_recorder/src/lib.rs:896-910 \u2014 all 8 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 \u0060baml_language/crates/btel_recorder/src/lib.rs:569\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":"baml_language/crates/btel_recorder/src/lib.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfea729a85563ebe7e74de9ce7d24358efd802f2687cc471cf196eb5994e57b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 7): languages/rust/baml/src/runtime.rs:92-106 | languages/rust/baml/src/runtime.rs:171-184 | languages/rust/baml/src/runtime.rs:215-229 | languages/rust/baml/src/runtime.rs:293-307 | languages/rust/baml/src/runtime.rs:361-375 | languages/rust/baml/src/runtime.rs:461-475 | languages/rust/baml/src/runtime.rs:507-521 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060languages/rust/baml/src/runtime.rs:92\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":"languages/rust/baml/src/runtime.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0637831365beae877bf80caaa0bb1c06e11318eb4e53ed6f8c72a7adfefe51e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 5): baml_language/crates/baml_compiler2_mir/src/lower.rs:9096-9108 | baml_language/crates/baml_compiler2_mir/src/lower.rs:9179-9191 | baml_language/crates/baml_compiler2_mir/src/lower.rs:9240-9252 | baml_language/crates/baml_compiler2_mir/src/lower.rs:9344-9356 | baml_language/crates/baml_compiler2_mir/src/lower.rs:9465-9479 \u2014 all 5 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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:9096\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":9096}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec6e14f7000bd22c82ae4dbe2062de65238945dc75574e06194356ab324de16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 5): baml_language/crates/baml_compiler2_mir/src/lower.rs:9111-9125 | baml_language/crates/baml_compiler2_mir/src/lower.rs:9194-9208 | baml_language/crates/baml_compiler2_mir/src/lower.rs:9255-9269 | baml_language/crates/baml_compiler2_mir/src/lower.rs:9359-9370 | baml_language/crates/baml_compiler2_mir/src/lower.rs:9484-9497 \u2014 all 5 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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:9111\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":9111}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e89e7dba6f8ba527e4a0899ebbe566caa0bdcee604423181b881729ec75a55a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1246-1260 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1338-1352 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1836-1850 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1911-1925 | engine/language_server/src/baml_project/mod.rs:803-817 \u2014 before extracting anything, compare \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs\u0060 and \u0060engine/language_server/src/baml_project/mod.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 183 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1246\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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"155fb6e98d0422127ff6ff6975b12c5ac17486aa3f93e48321f2111dc1e7730e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): baml_language/crates/bex_vm/src/vm.rs:11416-11430 | baml_language/crates/bex_vm/src/vm.rs:11442-11456 | baml_language/crates/bex_vm/src/vm.rs:11476-11490 | baml_language/crates/bex_vm/src/vm.rs:11510-11524 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":11416}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08cd6d807dd11dcc19d99ffe5ef88c82cbf8746eda8039b30ef11df4f134d69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): baml_language/crates/btel_recorder/src/lib.rs:921-935 | baml_language/crates/btel_recorder/src/lib.rs:971-985 | baml_language/crates/btel_recorder/src/lib.rs:1021-1035 | baml_language/crates/btel_recorder/src/lib.rs:1047-1061 \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 \u0060baml_language/crates/btel_recorder/src/lib.rs:921\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":"baml_language/crates/btel_recorder/src/lib.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca235025e83e7fb8cfed0006bca355be069f2170b43604cb60025a964d79374"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): baml_language/crates/btel_recorder/src/lib.rs:946-960 | baml_language/crates/btel_recorder/src/lib.rs:996-1010 | baml_language/crates/btel_recorder/src/lib.rs:1072-1086 | baml_language/crates/btel_recorder/src/lib.rs:1097-1111 \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 \u0060baml_language/crates/btel_recorder/src/lib.rs:946\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":"baml_language/crates/btel_recorder/src/lib.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"beda517bcd38019e8ba8d1aba3b46eeb9b429239c93a7ba0a5c6f35a6e99ba50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): engine/baml-compiler/src/thir/interpret.rs:1855-1869 | engine/baml-compiler/src/thir/interpret.rs:1888-1902 | engine/baml-compiler/src/thir/interpret.rs:2253-2267 | engine/baml-compiler/src/thir/interpret.rs:2297-2311 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64c67facd266fcf5656ca6c7610e43986de4ccc9c4196a4e5ead2001630909a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): baml_language/crates/baml_fmt/src/ast/attributes.rs:118-132 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1406-1420 | baml_language/crates/baml_fmt/src/ast/types.rs:455-469 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_fmt/src/ast/attributes.rs\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 162 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_fmt/src/ast/attributes.rs:118\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":"baml_language/crates/baml_fmt/src/ast/attributes.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fc33122de09e116a9aef61c90c6efa90b959415e81e46ed6a48180eeb2ffeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): baml_language/crates/baml_lsp_server/src/playground_server.rs:1585-1599 | baml_language/crates/bridge_wasm/src/runs.rs:757-771 | baml_language/crates/bridge_wasm/src/runs.rs:899-913 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_lsp_server/src/playground_server.rs:1585\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":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aafce2055c66cad1f35c456745b67bb27da27c8cfa3631be5035e18305f83f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 3): baml_language/crates/bex_vm/src/package_baml/array.rs:385-398 | baml_language/crates/bex_vm/src/package_baml/array.rs:440-454 | baml_language/crates/bex_vm/src/package_baml/array.rs:728-741 \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 \u0060baml_language/crates/bex_vm/src/package_baml/array.rs:385\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":"baml_language/crates/bex_vm/src/package_baml/array.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43854b17452e7da351cf95bcc3bee0873235fd978f1445330ca4db360c2ce01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): baml_language/sdks/java/sdkgen_java/src/emit.rs:301-315 | baml_language/sdks/rust/sdkgen_rust/src/emit/function.rs:719-733 | baml_language/sdks/typescript/sdkgen_typescript_shared/src/emit/mod.rs:216-230 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdks/java/sdkgen_java/src/emit.rs:301\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":"baml_language/sdks/java/sdkgen_java/src/emit.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c47edfa6edb30132b41a73c6bdb01cc284de0bcc262ae190478b0646860bdde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): baml_language/crates/baml_cli/src/pack_command.rs:598-612 | baml_language/crates/baml_cli/src/run_command.rs:953-967 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_cli/src/pack_command.rs\u0060 and \u0060baml_language/crates/baml_cli/src/run_command.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_cli/src/pack_command.rs:598\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":"baml_language/crates/baml_cli/src/pack_command.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"8429a3af561831f051e3b80b90dbd534715fba17f0e4f691fe9322d0b5dd1bd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/throw_facts.rs:105-117 | baml_language/crates/baml_compiler2_hir_ty/src/throw_facts.rs:140-154 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/throw_facts.rs:105\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/crates/baml_compiler2_hir_ty/src/throw_facts.rs:155\u0060 calls \u0060into_iter\u0060, \u0060rewrite_self_target\u0060, \u0060collect\u0060 and \u0060baml_language/crates/baml_compiler2_hir_ty/src/throw_facts.rs:118\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":"baml_language/crates/baml_compiler2_hir_ty/src/throw_facts.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d1024fe6f1dbf2d7410593e6222c167aa22cb48ba3683ed7c3356835ec13ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:4973-4987 | baml_language/crates/baml_compiler2_mir/src/lower.rs:5529-5543 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:4973\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:4969\u0060 calls \u0060span_for_expr\u0060 and \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:5525\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":4973}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4553398973d4f8144036e3f527e5b0e7dd04260d32420e71fe65868b682c5ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201315 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:9694-9701 | baml_language/crates/baml_compiler2_mir/src/lower.rs:11990-12004 \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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":9694}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebdb64ad0598d08393ab7b83f16ecd1211e2f83c10256485f3176d45a6db131"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201315 lines \u00D7 2): baml_language/crates/baml_ide/src/tokens/index.rs:157-171 | baml_language/crates/baml_ide/src/usages.rs:296-304 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_ide/src/tokens/index.rs:157\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/tokens/index.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"46612e894a15c8a8fce0485ea49b5970071a9085650e8e08b429717048894380"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs:246-260 | engine/baml-lib/jsonish/src/deserializer/deserialize_flags.rs:249-263 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs\u0060 and \u0060engine/baml-lib/jsonish/src/deserializer/deserialize_flags.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 127 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs:261\u0060 calls \u0060FloatToBigint\u0060 and \u0060engine/baml-lib/jsonish/src/deserializer/deserialize_flags.rs:264\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":"baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb9825bd5a921f343101bc212eeed7eb2d440d17299166bf984896fc573f96e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): baml_language/crates/bex_vm/src/vm.rs:11677-11691 | baml_language/crates/bex_vm/src/vm.rs:11700-11714 \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 \u0060baml_language/crates/bex_vm/src/vm.rs:11700\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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":11677}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fccc681c2e4bdc965c31161cbb38d88ae4124dd2808a8b0b599255281159cf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): baml_language/crates/btel_snapshot/src/decode.rs:1482-1496 | baml_language/crates/btel_snapshot/src/tags.rs:129-143 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_snapshot/src/decode.rs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a744bc6081d77c8e852cc89269aa42ccdcc984f11d0eaac4aa6e7092e1414fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): baml_language/crates/sys_native/src/io_impls.rs:1716-1730 | baml_language/crates/sys_native/src/io_impls.rs:1752-1766 \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 \u0060baml_language/crates/sys_native/src/io_impls.rs:1716\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d83c60a178737b2fd09a58beac7bba047b43d2b0402e36110b560e7d7a9aab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): baml_language/crates/sys_native/src/io_impls.rs:3377-3391 | baml_language/crates/sys_native/src/io_impls.rs:3461-3475 \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 \u0060baml_language/crates/sys_native/src/io_impls.rs:3377\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":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":3377}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e3605427dd29604b1f476b9a595ae66d875f80389a3127be0d5fcdc6e3f1e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): baml_language/crates/tools_stow/src/main.rs:2111-2125 | baml_language/crates/tools_stow/src/main.rs:2418-2432 \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 \u0060baml_language/crates/tools_stow/src/main.rs:2111\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":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":2111}}}],"partialFingerprints":{"codehealthFindingId/v1":"203e37bf4a36ba0766f70e9af636714652dcdaad7d994758b8f9fe89038b395f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:4030-4044 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:4148-4162 \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 \u0060baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:4030\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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":4030}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e28e14e0eb2fc8e165d73d02841768e554a897b432cf208e32e9dc4959f7ba0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): baml_language/sdks/go/sdkgen_go/src/lib.rs:2224-2238 | baml_language/sdks/go/sdkgen_go/src/lib.rs:2285-2299 \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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":2224}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd0090db4c9eadf48d625e7a66a25a4e86febdf0577f1ee287dcfb9d4d8d734"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): baml_language/sdks/python/rust/bridge_python/src/invocation.rs:129-143 | baml_language/sdks/python/rust/bridge_python/src/invocation.rs:178-192 \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 \u0060baml_language/sdks/python/rust/bridge_python/src/invocation.rs:129\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":"baml_language/sdks/python/rust/bridge_python/src/invocation.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de787ff16f6a4085376a3825e57845c41b947fa4b1d4fbe71e9466ad2dd95df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:1952-1966 | baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:2907-2920 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":1952}}}],"partialFingerprints":{"codehealthFindingId/v1":"745d9fe83f03f1ef2f829fe5dc1c867d0752af37bd52053c06af2ef19c7b1f74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): baml_language/sdks/typescript/sdkgen_typescript_shared/src/leaf.rs:260-274 | baml_language/sdks/typescript/sdkgen_typescript_shared/src/leaf.rs:298-312 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdks/typescript/sdkgen_typescript_shared/src/leaf.rs:260\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":"baml_language/sdks/typescript/sdkgen_typescript_shared/src/leaf.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae5479daf6f79ebce63f36bec14d14338f517c51e7086428d2d079cefc15bf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/baml-lib/diagnostics/src/error.rs:610-624 | engine/baml-lib/diagnostics/src/warning.rs:44-58 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/diagnostics/src/error.rs:610\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":"engine/baml-lib/diagnostics/src/error.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb425e51b4fa7a168476c5fde175fadb697cb80d4d7f3f6791b1c2a753bfe7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): engine/baml-lib/jsonish/src/helpers/mod.rs:239-252 | engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs:426-440 \u2014 before extracting anything, compare \u0060engine/baml-lib/jsonish/src/helpers/mod.rs\u0060 and \u0060engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/jsonish/src/helpers/mod.rs:239\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/helpers/mod.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b27b36c5c0982001bf57a5ea9ab96e30e0d8059e6817a086dddeb0a7ec6283"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/orchestrator/call.rs:118-132 | engine/baml-runtime/src/internal/llm_client/orchestrator/stream.rs:410-424 \u2014 before extracting anything, compare \u0060engine/baml-runtime/src/internal/llm_client/orchestrator/call.rs\u0060 and \u0060engine/baml-runtime/src/internal/llm_client/orchestrator/stream.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/internal/llm_client/orchestrator/call.rs:118\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":"engine/baml-runtime/src/internal/llm_client/orchestrator/call.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e00c1136164eb4b296b21ecc9c3408a3794f6d8d6ee345721b283135836ff25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs:910-924 | engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs:1358-1372 \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 \u0060engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs:910\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":"engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"e649e9b9775bfd93824162faa53f6eb1a04158fe72c3bf150d495f7414f516e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs:1371-1385 | engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs:1388-1402 \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":"engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc9ea0a0995ea6354c379bc58e23d1190d020dd809ee6ff8bcda905ac4246d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs:148-162 | engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs:210-223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76296e36793cfcf47baff20744bef40e905191dd5dc4ba5504dd9681d733a65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/generators/languages/python/src/watchers.rs:257-271 | engine/generators/languages/typescript/src/watchers.rs:245-259 \u2014 before extracting anything, compare \u0060engine/generators/languages/python/src/watchers.rs\u0060 and \u0060engine/generators/languages/typescript/src/watchers.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/generators/languages/python/src/watchers.rs:257\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":"engine/generators/languages/python/src/watchers.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7b1969e6cc129aab09b9d954f34a7c583e0b7c6af6499db2d50cb6a966fdc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): engine/generators/languages/ruby/src/ir_to_rb/mod.rs:91-104 | engine/generators/languages/ruby/src/ir_to_rb/mod.rs:194-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. 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, \u0060engine/generators/languages/ruby/src/ir_to_rb/mod.rs:193\u0060 calls \u0060meta_mut\u0060, \u0060make_optional\u0060 and \u0060engine/generators/languages/ruby/src/ir_to_rb/mod.rs:89\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/ruby/src/ir_to_rb/mod.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4dabdcdaaa2382c0554d2d57c51b99be3a00a42519bbfe412e8057663130bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/generators/languages/ruby/src/type.rs:178-192 | engine/generators/languages/ruby/src/type.rs:195-209 \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":"engine/generators/languages/ruby/src/type.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d578655d9e99928abbef53f692a98042c0651d02649e6fb2c7f863f1e188ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/generators/languages/rust/src/ir_to_rust/classes.rs:16-30 | engine/generators/languages/rust/src/ir_to_rust/classes.rs:42-56 \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 \u0060engine/generators/languages/rust/src/ir_to_rust/classes.rs:16\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/rust/src/ir_to_rust/classes.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8ebfee7606760ec3b010665da5e9b21290f4846ce8fe175a8f65b14f9b57ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/generators/languages/typescript/src/ir_to_ts/functions.rs:10-24 | engine/generators/languages/typescript/src/ir_to_ts/functions.rs:39-53 \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 \u0060engine/generators/languages/typescript/src/ir_to_ts/functions.rs:10\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060function\u0060 to \u0060\u0026FunctionNode\u0060 in one and \u0060\u0026ExprFunctionNode\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":"engine/generators/languages/typescript/src/ir_to_ts/functions.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e98a17b95543173f65d9d11f5ef1c0bbc0e116b6e784aeb996dd66271827c1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): engine/generators/languages/typescript/src/ir_to_ts/type_aliases.rs:58-72 | engine/generators/languages/typescript/src/ir_to_ts/type_aliases.rs:104-117 \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 \u0060engine/generators/languages/typescript/src/ir_to_ts/type_aliases.rs:58\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":"engine/generators/languages/typescript/src/ir_to_ts/type_aliases.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb95523b1c7a3d4de09723cd9c0938ab90627fc2631e1bc032d8e774a7f5dc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): languages/rust/baml/src/codec/helpers.rs:53-67 | languages/rust/baml/src/codec/helpers.rs:72-86 \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":"languages/rust/baml/src/codec/helpers.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b4a690d23b0d6ff9d86d1155d596a71d06da081edd904814aae1c1b6668ca9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): languages/rust/baml/src/runtime.rs:151-165 | languages/rust/baml/src/runtime.rs:273-287 \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":"languages/rust/baml/src/runtime.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0320656b06372c6e05977f83607a95cd245c15f643ccea89707ed16d4ac854"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 7): baml_language/crates/baml_compiler2_emit/src/analysis.rs:917-930 | baml_language/crates/baml_compiler2_emit/src/analysis.rs:940-950 | baml_language/crates/baml_compiler2_emit/src/analysis.rs:963-973 | baml_language/crates/baml_compiler2_emit/src/analysis.rs:976-986 | baml_language/crates/baml_compiler2_emit/src/analysis.rs:994-1004 | baml_language/crates/baml_compiler2_emit/src/analysis.rs:1012-1022 | baml_language/crates/baml_compiler2_emit/src/analysis.rs:1037-1047 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_emit/src/analysis.rs:917\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/crates/baml_compiler2_emit/src/analysis.rs:913\u0060 calls \u0060collect_uses_in_operand\u0060 and \u0060baml_language/crates/baml_compiler2_emit/src/analysis.rs:1010\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":"baml_language/crates/baml_compiler2_emit/src/analysis.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ca1ca4f8bb9cbbf2a4868ecbe31cbe3f7ebf4c7f25d2e9b2f9cfce4e59ef2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 6): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1611-1624 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1631-1644 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1651-1664 | engine/language_server/src/baml_project/mod.rs:522-535 | engine/language_server/src/baml_project/mod.rs:540-553 | engine/language_server/src/baml_project/mod.rs:558-571 \u2014 before extracting anything, compare \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs\u0060 and \u0060engine/language_server/src/baml_project/mod.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 183 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1611\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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad40b54676404fc55058e66a8b75324749ee566e6615da3a0adc8d8c239eb43a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5): baml_language/crates/baml_type/src/normalize.rs:772-785 | baml_language/crates/baml_type/src/normalize.rs:887-900 | baml_language/crates/baml_type/src/normalize.rs:1475-1488 | baml_language/crates/baml_type/src/normalize.rs:2476-2489 | baml_language/crates/baml_type/src/normalize.rs:2637-2650 \u2014 all 5 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":"baml_language/crates/baml_type/src/normalize.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b28f31b985c2df77b97731f878807e2c6b4dbf257a3a9407dd538d62bf848e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5): engine/baml-lib/llm-client/src/clients/helpers.rs:96-109 | engine/baml-lib/llm-client/src/clients/helpers.rs:117-130 | engine/baml-lib/llm-client/src/clients/helpers.rs:138-151 | engine/baml-lib/llm-client/src/clients/helpers.rs:155-168 | engine/baml-lib/llm-client/src/clients/helpers.rs:172-185 \u2014 all 5 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 \u0060engine/baml-lib/llm-client/src/clients/helpers.rs:96\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":"engine/baml-lib/llm-client/src/clients/helpers.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21fa933d81dae1c79bacddfc69230d7e72c806fd6b66e5d0f4305d4718d509a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): baml_language/crates/baml_cli/src/pack_command.rs:599-612 | baml_language/crates/baml_cli/src/run_command.rs:954-967 | baml_language/crates/baml_cli/src/test_command.rs:499-512 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_cli/src/pack_command.rs\u0060 and \u0060baml_language/crates/baml_cli/src/run_command.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/pack_command.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7deff2e47aa9a096ecfe327d836b8e37d3e533bffae94a05175f6d11efd96e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): baml_language/crates/baml_fmt/src/ast/attributes.rs:125-138 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1413-1425 | baml_language/crates/baml_fmt/src/ast/expressions.rs:2540-2552 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_fmt/src/ast/attributes.rs\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 162 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_fmt/src/ast/attributes.rs:125\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":"baml_language/crates/baml_fmt/src/ast/attributes.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c82126a9ef7140ac9a79dd86e0b73dd0dfad80f3283312acae3ee2b797efde6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): baml_language/crates/bex_vm/src/vm.rs:9761-9774 | baml_language/crates/bex_vm/src/vm.rs:9836-9849 | baml_language/crates/bex_vm/src/vm.rs:9860-9873 \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 \u0060baml_language/crates/bex_vm/src/vm.rs:9761\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/crates/bex_vm/src/vm.rs:9776\u0060 calls \u0060store_field_relaxed\u0060 and \u0060baml_language/crates/bex_vm/src/vm.rs:9850\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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":9761}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77e2d378a31b8f3109c3c32950af59952ccf738ccc6db5cf018284006995dd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:1983-1996 | baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:2008-2021 \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 \u0060baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:1983\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":"baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs"},"region":{"startLine":1983}}}],"partialFingerprints":{"codehealthFindingId/v1":"0154a9039a5e70b4ac4bf7b71c55943973c4aea77d87ae0aebc771efd949fed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): baml_language/crates/baml_compiler2_emit/src/stack_carry.rs:1084-1097 | baml_language/crates/baml_compiler2_emit/src/stack_carry.rs:1124-1137 \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":"baml_language/crates/baml_compiler2_emit/src/stack_carry.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"916841931791929ab932b043fe7e871143dbd00ed9156ac74fe0c4a66f25164c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201314 lines \u00D7 2): baml_language/crates/baml_compiler2_hir/src/resolve.rs:69-82 | baml_language/crates/baml_compiler2_hir/src/resolve.rs:171-178 \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 \u0060baml_language/crates/baml_compiler2_hir/src/resolve.rs:69\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":"baml_language/crates/baml_compiler2_hir/src/resolve.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aaf0659f31b7d1883db628ac65df89b6d8827c985c0e62e4f040cc36a0073b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): baml_language/crates/baml_compiler2_hir/src/signature.rs:175-188 | baml_language/crates/baml_compiler2_hir/src/signature.rs:353-366 \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 \u0060baml_language/crates/baml_compiler2_hir/src/signature.rs:175\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":"baml_language/crates/baml_compiler2_hir/src/signature.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd086e637a5001ba50db232978218c46f59be7b2d48af05d05a26dfa04380825"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:712-725 | baml_language/crates/baml_type/src/unify.rs:1240-1253 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs\u0060 and \u0060baml_language/crates/baml_type/src/unify.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 452 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"253f9c90d80c9aec2cd0b9e9ab22238766cd3fe51a30c684ad8f81537ce93b79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/impls.rs:850-863 | baml_language/crates/baml_compiler2_hir_ty/src/impls.rs:939-952 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/impls.rs:850\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":"baml_language/crates/baml_compiler2_hir_ty/src/impls.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"e491381730c8054c04227e8b7d03e050b7bf12174e9f1e9145359fafffbd8c80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/impls.rs:2580-2593 | baml_language/crates/baml_compiler2_hir_ty/src/impls.rs:2623-2636 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/impls.rs:2580\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":"baml_language/crates/baml_compiler2_hir_ty/src/impls.rs"},"region":{"startLine":2580}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ac65bd65fe881a9aafeb59e755b73624e9b9e89dac4ec9abed403e4b0b7537"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:6993-7006 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:10269-10282 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:6993\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":6993}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1154a86a78b28a432ac2e5900c41317c53febbd5eaa5a8430bc7927583b746"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:740-753 | baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:763-774 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:740\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":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2455eed6eef925f4bd49e740ee60256df968fe9210d4e6b5394e544c67c1e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:7757-7770 | baml_language/crates/baml_compiler2_mir/src/lower.rs:7787-7798 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:7757\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":7757}}}],"partialFingerprints":{"codehealthFindingId/v1":"12804bdd3f43e06a23d4871333b9ae309e110c64a275edc2a28cdabb875993bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/expressions.rs:385-398 | baml_language/crates/baml_fmt/src/ast/types.rs:110-123 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/types.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs:385\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":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0c27edfe5c6b4936a80218715bf19809ee0ee08ab2325907e1f91ee8a3cffe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): baml_language/crates/baml_lsp_server/src/playground_server.rs:1560-1573 | baml_language/crates/baml_lsp_server/src/playground_server.rs:1664-1677 \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 \u0060baml_language/crates/baml_lsp_server/src/playground_server.rs:1560\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":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":1560}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdce0283c1e90708da175ddb409163b9dc7f98a61f55eca64e90cc954b7f32f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): baml_language/crates/baml_parser/src/items.rs:2095-2108 | baml_language/crates/baml_parser/src/items.rs:2137-2150 \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 \u0060baml_language/crates/baml_parser/src/items.rs:2095\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":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":2095}}}],"partialFingerprints":{"codehealthFindingId/v1":"90cd2668bdb5e7f43175740c261252f86677422d00ee3619593e645c30b66139"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): baml_language/crates/baml_query_btel/src/ingest/profile.rs:440-453 | baml_language/crates/baml_query_btel/src/ingest/profile.rs:480-490 \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 \u0060baml_language/crates/baml_query_btel/src/ingest/profile.rs:440\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":"baml_language/crates/baml_query_btel/src/ingest/profile.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"839e37ccce20f1e3499588b3b220ea02632de615bda06ebcaffbfce73ff2ad34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): baml_language/crates/baml_sdkgen_types/src/type_queries.rs:37-49 | baml_language/sdks/go/sdkgen_go/src/lib.rs:129-142 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_sdkgen_types/src/type_queries.rs:37\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":"baml_language/crates/baml_sdkgen_types/src/type_queries.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bd77f4aef87bb42f64309fd6c279179224c1b8c303f4dc284b18efc1e4a465"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): baml_language/crates/baml_type_macros/src/emit.rs:313-326 | baml_language/crates/baml_type_macros/src/emit.rs:794-807 \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 \u0060baml_language/crates/baml_type_macros/src/emit.rs:313\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type_macros/src/emit.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6e774b45e6767f1adb00a736aabc23218b3aa73c099e62ab9e391f7331e3e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): baml_language/crates/baml_type_macros/src/emit.rs:328-341 | baml_language/crates/baml_type_macros/src/emit.rs:809-822 \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 \u0060baml_language/crates/baml_type_macros/src/emit.rs:328\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":"baml_language/crates/baml_type_macros/src/emit.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0af321414e544cbf5844cf8a6327084711ef39eab33394c0eb55fd50c05c649"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): baml_language/crates/bex_engine/src/telemetry.rs:259-272 | baml_language/crates/bex_engine/src/telemetry.rs:348-361 \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 \u0060baml_language/crates/bex_engine/src/telemetry.rs:259\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":"baml_language/crates/bex_engine/src/telemetry.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"808e38a9dfa2d729039d6e989cc1728e6c47d7ef1a7cc8cc76f8229b4fa56049"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:99-112 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:104-117 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 586 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:99\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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"5799d179a8844151dac0f8861ed27be1388aac3a0f8dfaf4137988db07f8750d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:149-160 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:155-168 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 586 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:149\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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe27a161644fd39de05201f37f48f48c63acd19d60e340677240b8f9c655763"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/multi_json_parser.rs:31-44 | engine/baml-lib/jsonish/src/jsonish/parser/multi_json_parser.rs:30-43 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/multi_json_parser.rs:31\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":"baml_language/crates/bex_sap/src/jsonish/parser/multi_json_parser.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fe65bb7b59a9f16a76a093d44c7e3f0d3169ac5d451ad36446fb9c47ecbdf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): baml_language/crates/bex_vm/src/vm.rs:11811-11824 | baml_language/crates/bex_vm/src/vm.rs:11832-11845 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":11811}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b1958abd7c9eefada8d69c82235a6e3653dbe5c27e8d3d809ac49c2d1ea70e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): baml_language/crates/bex_vm_types/src/indexable.rs:92-105 | engine/baml-vm/src/indexable.rs:67-80 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_vm_types/src/indexable.rs:92\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":"baml_language/crates/bex_vm_types/src/indexable.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e03c549a350ca946f59d17be0d2e705ff589132681f9f4e4093bc62c896629"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): baml_language/crates/bex_vm_types/src/prompt.rs:59-71 | baml_language/crates/bex_vm_types/src/prompt.rs:186-199 \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 \u0060baml_language/crates/bex_vm_types/src/prompt.rs:59\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm_types/src/prompt.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1d8b984d6c9b7601dfa004e4a1e0c5b304d87f89b53e078a1e47763db30d62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): baml_language/crates/bridge_wasm/src/wasm_http.rs:643-656 | baml_language/crates/bridge_wasm/src/wasm_http.rs:665-677 \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 \u0060baml_language/crates/bridge_wasm/src/wasm_http.rs:643\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/crates/bridge_wasm/src/wasm_http.rs:658\u0060 calls \u0060Some\u0060, \u0060Err\u0060, \u0060unbounded_send\u0060 and \u0060baml_language/crates/bridge_wasm/src/wasm_http.rs:678\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":"baml_language/crates/bridge_wasm/src/wasm_http.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c20dbd9ad1e9ab129c8506d6aee9fe4b3f2b41b44b23b5504cbca03675c3269"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): baml_language/crates/bridge_wasm/src/wasm_random.rs:24-37 | baml_language/crates/sys_native/src/io_impls.rs:223-236 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_wasm/src/wasm_random.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2042ce25c7dd48901a01df2ee438355f5f21946a9f90d733b830d52df27c4c4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): baml_language/crates/sys_types/src/sse.rs:64-77 | baml_language/crates/sys_types/src/sse.rs:130-143 \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":"baml_language/crates/sys_types/src/sse.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa75336d36acd2b2979c30afb3a6c2a2f8ead4df10e4e7a5b6305d4695c00587"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:2524-2537 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:3162-3175 \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 \u0060baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:2524\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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":2524}}}],"partialFingerprints":{"codehealthFindingId/v1":"e193668f37542ff175b9a47ef38f507ce42ee9497c9c85aac3bdf179848bf0db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:3961-3974 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:4082-4095 \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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":3961}}}],"partialFingerprints":{"codehealthFindingId/v1":"05450a5120638afd6cf75e19075131b32a60612c66b5053027e3444437dbbf34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:1361-1374 | baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:2281-2294 \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 \u0060baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:1361\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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"e781be7b9cf2bdf233a1344544812d416baa3f7a5eea313f2e4997c7aefa7067"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): engine/baml-lib/baml-core/src/ir/ir_hasher/mod.rs:450-463 | engine/baml-lib/baml-core/src/ir/ir_hasher/mod.rs:465-477 \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 \u0060engine/baml-lib/baml-core/src/ir/ir_hasher/mod.rs:450\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":"engine/baml-lib/baml-core/src/ir/ir_hasher/mod.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1fa29534f1973b034a82bf1fe567d2b2caa9f42593219f8ed507df90259843"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/baml-lib/jinja/src/evaluate_type/pretty_print.rs:78-91 | engine/baml-lib/jinja/src/evaluate_type/pretty_print.rs:96-109 \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 \u0060engine/baml-lib/jinja/src/evaluate_type/pretty_print.rs:78\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":"engine/baml-lib/jinja/src/evaluate_type/pretty_print.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a141e4a2a25d2292b5e56b5c6649e685346e6363374e07c150fbb97dac61ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/baml-lib/jsonish/src/deserializer/coercer/coerce_array.rs:50-66 | engine/baml-lib/jsonish/src/deserializer/coercer/coerce_map.rs:39-52 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/jsonish/src/deserializer/coercer/coerce_array.rs:50\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060value\u0060 to \u0060Option\u003C\u0026crate::jsonish::Value\u003E\u0060 in one and \u0060Option\u003C\u0026jsonish::Value\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":"engine/baml-lib/jsonish/src/deserializer/coercer/coerce_array.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb14ffcc9dd399628953ebd3a201d6ff7a814a4e1f77a8ccf775d891b0ee9ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/baml-lib/jsonish/src/deserializer/coercer/coerce_array.rs:83-96 | engine/baml-lib/jsonish/src/deserializer/coercer/coerce_map.rs:69-82 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/jsonish/src/deserializer/coercer/coerce_array.rs:83\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060value\u0060 to \u0060Option\u003C\u0026crate::jsonish::Value\u003E\u0060 in one and \u0060Option\u003C\u0026jsonish::Value\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":"engine/baml-lib/jsonish/src/deserializer/coercer/coerce_array.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51ee6611c2323a4efcb2c1d060b72b43361935e63a0765ce73db7f679a51f3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/baml-runtime/src/cli/init.rs:170-183 | engine/baml-runtime/src/cli/init.rs:205-218 \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 \u0060engine/baml-runtime/src/cli/init.rs:170\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":"engine/baml-runtime/src/cli/init.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28a4f22c578e94a4d7c5b23f08de3557d0fcd3ba3e0bcff183dde130e8ca924"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/orchestrator/call.rs:145-158 | engine/baml-runtime/src/internal/llm_client/orchestrator/stream.rs:428-441 \u2014 before extracting anything, compare \u0060engine/baml-runtime/src/internal/llm_client/orchestrator/call.rs\u0060 and \u0060engine/baml-runtime/src/internal/llm_client/orchestrator/stream.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/internal/llm_client/orchestrator/call.rs:145\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/orchestrator/call.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fb502bcb8cd6d0b8aad9a6f6a0c503e9a387ac3ac99451ce397cae7f94abc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/orchestrator/mod.rs:250-262 | engine/baml-runtime/src/internal/llm_client/orchestrator/mod.rs:314-327 \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 \u0060engine/baml-runtime/src/internal/llm_client/orchestrator/mod.rs:250\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":"engine/baml-runtime/src/internal/llm_client/orchestrator/mod.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0b6a2d3729fbbb0b34decc2a7c249995af38a4c6b07b0c3a844a59c91d5d4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): engine/baml-runtime/src/optimize/storage.rs:191-201 | engine/baml-runtime/src/optimize/tui.rs:1209-1222 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/optimize/storage.rs:191\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":"engine/baml-runtime/src/optimize/storage.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3e744a4abdbba5bffb1ed538efe3177446c0d26ccbcfcb1530104b2bd2e658"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): engine/baml-runtime/src/type_builder/mod.rs:597-606 | engine/baml-runtime/src/type_builder/mod.rs:622-635 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/type_builder/mod.rs:597\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/type_builder/mod.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"1add559bdecc00caffacbc701bd6784ed1c4e4e733d9bb3335dec811d7d4efb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1142-1155 | engine/language_server/src/baml_project/mod.rs:751-764 \u2014 before extracting anything, compare \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs\u0060 and \u0060engine/language_server/src/baml_project/mod.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 183 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1142\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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"466045e6cf1b3b6f6ccbb5dc5f633b78ce0385f1421d43419ff999fd4a3e7d5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2064-2077 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2921-2934 \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 \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2064\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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":2064}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d02541152b7fc5cf733cd41f989641ae2b24af87dfcdefcff78f5a37e6edd0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2453-2467 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2559-2573 \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 \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2453\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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":2453}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc023c93568ee119282666e764aacf2bd4d31ef62e3a69154153e25541e2fda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/generators/languages/go/src/ir_to_go/mod.rs:275-288 | engine/generators/languages/go/src/ir_to_go/mod.rs:293-306 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/generators/languages/go/src/ir_to_go/mod.rs:307\u0060 calls \u0060make_optional\u0060 and \u0060engine/generators/languages/go/src/ir_to_go/mod.rs:288\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":"engine/generators/languages/go/src/ir_to_go/mod.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"767e41200a59ecded44a2228a092f81f4706508cd7a1387d0875183ea00f3b86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/generators/languages/python/src/ir_to_py/classes.rs:21-34 | engine/generators/languages/python/src/ir_to_py/classes.rs:41-54 \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 \u0060engine/generators/languages/python/src/ir_to_py/classes.rs:21\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":"engine/generators/languages/python/src/ir_to_py/classes.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"42694adbea5c5dc6909eee903d245c092c7029ca6bd31e6fff18352e39d7a5e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/generators/languages/rust/src/ir_to_rust/mod.rs:305-318 | engine/generators/languages/rust/src/ir_to_rust/mod.rs:323-336 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/generators/languages/rust/src/ir_to_rust/mod.rs:337\u0060 calls \u0060make_optional\u0060 and \u0060engine/generators/languages/rust/src/ir_to_rust/mod.rs:318\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":"engine/generators/languages/rust/src/ir_to_rust/mod.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfe1381b24d79875b0259c3595cb98dd79f9c8a4f24bad767cafcee73fd43a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/language_server/src/baml_project/mod.rs:1299-1312 | engine/language_server/src/server/api/requests/go_to_definition.rs:71-84 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/language_server/src/baml_project/mod.rs:1299\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":"engine/language_server/src/baml_project/mod.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a70aeb3ff495b37ccc3298f75078cd34d9ac2bf747417bdfc884321284dfdfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/language_server/src/server/api/diagnostics.rs:174-187 | engine/language_server/src/server/api/diagnostics.rs:200-213 \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 \u0060engine/language_server/src/server/api/diagnostics.rs:174\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":"engine/language_server/src/server/api/diagnostics.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f32048959bfcfefe4f7140f06a5ed5caac9825f450e720fe0481d4d3867257"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): engine/language_server/src/server/api/diagnostics.rs:241-253 | engine/language_server/src/server/api/diagnostics.rs:287-300 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/language_server/src/server/api/diagnostics.rs:241\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":"engine/language_server/src/server/api/diagnostics.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdc0b4c7a4878c667e5c20e9ae03d387f2531e49fd97fb10ba2d14964af1a2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): engine/language_server/src/server/api/notifications/did_change.rs:38-51 | engine/language_server/src/server/api/notifications/did_save_text_document.rs:37-48 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/language_server/src/server/api/notifications/did_change.rs:36\u0060 calls \u0060now\u0060 and \u0060engine/language_server/src/server/api/notifications/did_save_text_document.rs:36\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":"engine/language_server/src/server/api/notifications/did_change.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"3598d572146626be89669e2b5ae62e296a8a08f9457b2cb8b3b29e4cf7dd9d1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): baml_language/crates/baml_compiler2_mir/src/lower.rs:7904-7916 | baml_language/crates/baml_compiler2_mir/src/lower.rs:7952-7964 | baml_language/crates/baml_compiler2_mir/src/lower.rs:8036-8048 | baml_language/crates/baml_compiler2_mir/src/lower.rs:8287-8299 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:7904\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":7904}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6c8d9f76c9c8a78761b4d303c591963d7ed82db9f5286475f9ab81c9a18d7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): engine/baml_cffi_macros/src/lib.rs:980-992 | engine/baml_cffi_macros/src/lib.rs:1014-1026 | engine/baml_cffi_macros/src/lib.rs:1048-1060 | engine/baml_cffi_macros/src/lib.rs:1099-1111 \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 \u0060engine/baml_cffi_macros/src/lib.rs:980\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":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b229a8a2959511d18f65d9fecb59423debb30cf178550adda221d9951f71f6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:316-328 | baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:467-479 | engine/baml-runtime/src/control_flow.rs:611-623 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs\u0060 and \u0060engine/baml-runtime/src/control_flow.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:316\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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"562b12c3bdffc8ee98ae8b930d2c42292ec44c2cf26dbd704e23ddd054837d75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): baml_language/crates/baml_compiler2_visualization/src/control_flow/mod.rs:369-381 | engine/baml-compiler/src/viz_builder.rs:540-552 | engine/baml-runtime/src/control_flow.rs:901-913 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/mod.rs\u0060 and \u0060engine/baml-runtime/src/control_flow.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 94 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_visualization/src/control_flow/mod.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a0026d1ed4388c1c320a6515615cff730c60f0e9bcf4a97957ea5437e070db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): baml_language/crates/baml_fmt/src/ast/attributes.rs:103-115 | baml_language/crates/baml_fmt/src/ast/declarations.rs:292-303 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1393-1404 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_fmt/src/ast/attributes.rs\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/declarations.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/attributes.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c43189e094b649d4abb29e9147bf2b461d6001757a851defacb3e5bd119eef9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): engine/baml_cffi_macros/src/lib.rs:824-836 | engine/baml_cffi_macros/src/lib.rs:843-855 | engine/baml_cffi_macros/src/lib.rs:898-910 \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 \u0060engine/baml_cffi_macros/src/lib.rs:824\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":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e71544897c4397b630f6e51a36ab5d13aca4552e4bc49280dffc0b1485a343a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): baml_language/crates/baml_cli/src/paint.rs:71-81 | baml_language/crates/baml_ide/src/tokens/classify.rs:49-61 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/paint.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c70eb2b6747207ac95c56a8bde3f6153ddf87ac404fae500e4af4bd5b57c3e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201313 lines \u00D7 2): baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs:432-439 | baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs:752-764 \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 \u0060baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs:432\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90157b2dcab4169498ca39aeb766e923ff3851776488ab9c126a191240cebe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs:1002-1014 | baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs:1035-1047 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060id\u0060 to \u0060Id\u003CAssocTypeDecl\u003E\u0060 in one and \u0060Id\u003CAssocTypeDef\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":"baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13796143bdfa7058701c1e8cdfd09e1b93fa9b9b53b77c16b6167b5dcdafc4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): baml_language/crates/baml_compiler2_emit/src/items.rs:1100-1111 | baml_language/crates/baml_compiler2_emit/src/package/bodies.rs:97-109 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_emit/src/package/bodies.rs:97\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/items.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6799cbcc53a66bb838d74b109fdc3ba11c9261add20a0b247d236fe7064a42b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): baml_language/crates/baml_compiler2_hir/src/builder.rs:1435-1444 | baml_language/crates/baml_compiler2_hir/src/builder.rs:1619-1631 \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 \u0060baml_language/crates/baml_compiler2_hir/src/builder.rs:1619\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":"baml_language/crates/baml_compiler2_hir/src/builder.rs"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2a96dd4acbdd5eb661f36c163544d42eb8c0aefa7d77804a5f8e733e84a32e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:7022-7034 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:7119-7131 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:7022\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":7022}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd6c3afa93a20fbabba30913c6ea7c91987cf1999e2bc610211dc034153e59a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:1810-1818 | baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:1890-1902 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:1810\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9d2e463df3af3d7150c877d1f734dbec6a6a8f5ca57b3a8947a95c48a73660"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:1151-1163 | baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:1307-1319 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:1151\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":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f5e1fff207c8aca51df8e100063abf22a0de782d0a948533e4b958cbd29694"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201313 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:6871-6883 | baml_language/crates/baml_compiler2_mir/src/lower.rs:12426-12433 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:6871\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":6871}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9d1c09e0c76bc158cf63f32aeb572168f458b9902ed9701af4ad226539e2a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:710-722 | engine/baml-runtime/src/control_flow.rs:467-479 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs\u0060 and \u0060engine/baml-runtime/src/control_flow.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:710\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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"544eece6928f26fcab5d304dbc9d01c3f1c85278fc1988e6e4d2a67310351c7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/expressions.rs:997-1009 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1223-1235 \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 \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs:997\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":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d8b82ff40dcd23989d34a8e4a2274bfe46c3a31094b51ec2adaa34139edf10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/expressions.rs:1456-1468 | baml_language/crates/baml_fmt/src/ast/expressions.rs:2602-2614 \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 \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs:1456\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":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9adb459277d9dd0267ff645dce43e1e1c7609529886435a14a849857ea5b13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/crates/baml_lsp_server/src/lsp_ingress.rs:1505-1517 | baml_language/crates/baml_lsp_server/src/lsp_ingress.rs:1519-1531 \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":"baml_language/crates/baml_lsp_server/src/lsp_ingress.rs"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9e0cc9bcadd78e5b4237b44b0d06bdc70102eacc32510c9fa771a038914573"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/crates/baml_query_btel/src/ingest.rs:680-692 | baml_language/crates/baml_query_btel/src/ingest.rs:909-921 \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 \u0060baml_language/crates/baml_query_btel/src/ingest.rs:680\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":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f8eb28a81328e198a9030c995dd6ec4ec34ec59fc20698cca070e1891edc0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): baml_language/crates/baml_query_btel/src/ingest.rs:1113-1122 | baml_language/crates/baml_query_btel/src/ingest/bulk.rs:593-605 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_query_btel/src/ingest.rs:1113\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"176975b78b523e0de65b309aaf4a0984ac2df9f8365e5ba339c24fa2d9269576"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/crates/baml_type/src/normalize.rs:2883-2895 | baml_language/crates/baml_type/src/normalize.rs:3235-3247 \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":"baml_language/crates/baml_type/src/normalize.rs"},"region":{"startLine":2883}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ba80874ba851fa5f70670ab550e9dd9ba70b6831868eb3a8521f8b8a30577b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/crates/bex_events/src/history/mod.rs:175-187 | baml_language/crates/bex_events/src/history/mod.rs:196-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_events/src/history/mod.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0351d10622f3fcd5572576c635e2c3689c97510d5d979af7f3c6f0ae24778af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/crates/bex_events/src/history/mod.rs:253-265 | baml_language/crates/bex_events/src/history/mod.rs:294-306 \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":"baml_language/crates/bex_events/src/history/mod.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8f11c77918df553701c59a2dbe3db8131cc6b25466254373b40f0acacce301"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs:361-373 | engine/baml-lib/jsonish/src/deserializer/coercer/array_helper.rs:302-314 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs\u0060 and \u0060engine/baml-lib/jsonish/src/deserializer/coercer/array_helper.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 98 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs:361\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":"baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddc9b5477693dcbb53e757031eb7f1c430dcb9056fb58b240b1aac6d50b7f4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/coercer/match_string.rs:323-331 | engine/baml-lib/jsonish/src/deserializer/coercer/match_string.rs:294-306 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/deserializer/coercer/match_string.rs\u0060 and \u0060engine/baml-lib/jsonish/src/deserializer/coercer/match_string.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"baml_language/crates/bex_sap/src/deserializer/coercer/match_string.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"640dde1366fceba4c5b0bbe586939a0ddd6883ff15b0b6a1a44fc27b488c7ddd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_collection.rs:38-50 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_collection.rs:38-50 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_collection.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"374078a9061d36a31431e7c629286b6fd848fbeb9e38ad71eeb74a65fa4da244"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:223-235 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:252-264 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 586 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:223\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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b0909c70bf320814f3a872c84d3656f32292c15e95b41ef90510c31d9907d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201313 lines \u00D7 3): baml_language/crates/bex_vm/src/debug.rs:616-628 | baml_language/crates/bex_vm/src/debug.rs:1219-1221 | engine/baml-vm/src/debug.rs:320-332 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_vm/src/debug.rs\u0060 and \u0060engine/baml-vm/src/debug.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_vm/src/debug.rs:616\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/crates/bex_vm/src/debug.rs:616\u0060 calls \u0060push\u0060 and \u0060baml_language/crates/bex_vm/src/debug.rs:1219\u0060 does not \u2014 after which the two agree again for 5 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":"baml_language/crates/bex_vm/src/debug.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"3225a6bd2fbced917c6c5884acaa5ccb483fe4baf040e8730de3ce76d436d3d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/crates/bex_vm/src/package_baml/array.rs:570-582 | baml_language/crates/bex_vm/src/package_baml/array.rs:624-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":"baml_language/crates/bex_vm/src/package_baml/array.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e68c6aebb8b3e73fd69515bd9512356c107aadbcccad5d5e55c0faab1761a2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/crates/bex_vm/src/package_reflect/type_class.rs:1283-1295 | baml_language/crates/bex_vm/src/package_reflect/type_class.rs:1330-1342 \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 \u0060baml_language/crates/bex_vm/src/package_reflect/type_class.rs:1283\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/crates/bex_vm/src/package_reflect/type_class.rs:1329\u0060 calls \u0060render_witness_sources\u0060 and \u0060baml_language/crates/bex_vm/src/package_reflect/type_class.rs:1282\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/type_class.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fc6f3491a56bd142eebacde33b9cb4ffb5e315bdc939828fd37f83989f8d4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201313 lines \u00D7 2): baml_language/crates/bex_vm/src/vm.rs:4392-4399 | baml_language/crates/bex_vm/src/vm.rs:10431-10443 \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 \u0060baml_language/crates/bex_vm/src/vm.rs:4392\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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":4392}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8c7ec6c0661314f499dc736990966203d4fd0b3e02bc1ba084fd9804f99082"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/crates/bex_vm_types/src/bytecode.rs:1954-1966 | engine/baml-vm/src/bytecode.rs:287-299 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"baml_language/crates/bex_vm_types/src/bytecode.rs"},"region":{"startLine":1954}}}],"partialFingerprints":{"codehealthFindingId/v1":"410f140a7b9d150427be495be7a79ae28704fa2963f13dc9cf25b3b2060125b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/crates/bridge_wasm/src/wasm_io_fs.rs:479-491 | baml_language/crates/bridge_wasm/src/wasm_io_fs.rs:501-513 \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 \u0060baml_language/crates/bridge_wasm/src/wasm_io_fs.rs:479\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/crates/bridge_wasm/src/wasm_io_fs.rs:478\u0060 calls \u0060into_bytes\u0060 and \u0060baml_language/crates/bridge_wasm/src/wasm_io_fs.rs:500\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":"baml_language/crates/bridge_wasm/src/wasm_io_fs.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"e113f53d5650d8dd3228d4abe4f4c441aaa686a3938b57f54f50c482503f3093"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs:1710-1722 | baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs:1801-1813 \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 \u0060baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs:1710\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs"},"region":{"startLine":1710}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8708e6926ad4185d28e0280637e7a22a151b0a5ad31ad2b17c12391430f668b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): baml_language/sdks/csharp/sdkgen_csharp/src/names.rs:352-364 | baml_language/sdks/csharp/sdkgen_csharp/src/routing.rs:264-274 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdks/csharp/sdkgen_csharp/src/names.rs:352\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/sdkgen_csharp/src/names.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"604b4b281f026af9871cf435281af1378447fdd1ea1aaccd4fc5d340e91bcb5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:730-742 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:743-755 \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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a91ef78757c1d5341afc0f414687dc77cf58c6f28ae446d4a2f2e36f1aeadb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:2500-2512 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:2928-2940 \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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":2500}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8dfe8643f241dc8eb3b1d51684763d2790a099eb15999727d7b5b43da951c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:3981-3990 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:4096-4108 \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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":3981}}}],"partialFingerprints":{"codehealthFindingId/v1":"212fb02845c7f538a3b26d0d171680d8d14529aa5b981944e1219a6bd924da35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/sdks/go/sdkgen_go/src/names.rs:753-765 | baml_language/sdks/go/sdkgen_go/src/names.rs:769-781 \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 \u0060baml_language/sdks/go/sdkgen_go/src/names.rs:753\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":"baml_language/sdks/go/sdkgen_go/src/names.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9976e6b1a990fdbaf47a430da27212e868e14033b3fa1419598cb126f8f0651"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/sdks/rust/bridge_rust/src/outbound.rs:228-240 | baml_language/sdks/rust/bridge_rust/src/outbound.rs:278-290 \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 \u0060baml_language/sdks/rust/bridge_rust/src/outbound.rs:228\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":"baml_language/sdks/rust/bridge_rust/src/outbound.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b80053246fc9228bedb0983a6bf3309c72b71bf4abd2e14e4e588f9aa66dcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/sdks/swift/rust/sdkgen_swift/src/emit.rs:160-172 | baml_language/sdks/swift/rust/sdkgen_swift/src/emit.rs:442-454 \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":"baml_language/sdks/swift/rust/sdkgen_swift/src/emit.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e17b0cd5d540ec08284ff96ac434303c4b072e67766c0446e9227ca81595d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/baml-compiler/src/thir.rs:345-357 | engine/baml-lib/baml-types/src/expr.rs:312-324 \u2014 before extracting anything, compare \u0060engine/baml-compiler/src/thir.rs\u0060 and \u0060engine/baml-lib/baml-types/src/expr.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-compiler/src/thir.rs:345\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":"engine/baml-compiler/src/thir.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee273c2a2d9361b7c48fbbcb432acaf3aa7ca7e6682ec8e45af909c86bdeae4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/baml-lib/baml-core/src/ir/repr.rs:2580-2592 | engine/baml-lib/baml-core/src/ir/repr.rs:2632-2644 \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 \u0060engine/baml-lib/baml-core/src/ir/repr.rs:2580\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":"engine/baml-lib/baml-core/src/ir/repr.rs"},"region":{"startLine":2580}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e5253a2c87337fc228f915330a7c5fe34d8fe3d955614e2409b5d95c44a9a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/baml-lib/baml-types/src/baml_value.rs:1034-1046 | engine/baml-lib/baml-types/src/baml_value.rs:1049-1061 \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":"engine/baml-lib/baml-types/src/baml_value.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9150d41ae957320e1a716b484f3f375f857966fb8ce25c34a886d38c708ffa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/baml-lib/jinja/src/evaluate_type/expr.rs:145-157 | engine/baml-lib/jinja/src/evaluate_type/expr.rs:159-171 \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 \u0060engine/baml-lib/jinja/src/evaluate_type/expr.rs:145\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":"engine/baml-lib/jinja/src/evaluate_type/expr.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"096b269e165cdbccb42b2c066a56b99cacab26741160a9fecd20ca69b2ce2a8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/baml-lib/llm-client/src/clients/fallback.rs:30-42 | engine/baml-lib/llm-client/src/clients/round_robin.rs:33-45 \u2014 before extracting anything, compare \u0060engine/baml-lib/llm-client/src/clients/fallback.rs\u0060 and \u0060engine/baml-lib/llm-client/src/clients/round_robin.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"engine/baml-lib/llm-client/src/clients/fallback.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0552c0afb865f978a0fb9a518e1bcfe31becfded7f088c77aec1b2345d9e8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/baml-runtime/src/cli/repl.rs:482-494 | engine/baml-runtime/src/cli/repl.rs:645-657 \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 \u0060engine/baml-runtime/src/cli/repl.rs:482\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":"engine/baml-runtime/src/cli/repl.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7346f49b3c7d9e1d5d9b0e0d52ceb72ae7c7c34a462c989257d38896422b63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/baml-runtime/src/cli/repl.rs:1286-1298 | engine/baml-runtime/src/cli/repl.rs:1534-1546 \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 \u0060engine/baml-runtime/src/cli/repl.rs:1286\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":"engine/baml-runtime/src/cli/repl.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa094ecd7e40bb7d1030152b3704602a52673cc521be29dfbf074ce8b3bbb09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs:923-934 | engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs:940-952 \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 \u0060engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs:923\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71110e6ae1e8d20235a303295df5bc2e7ddb3afc00e4eda425ab999a6dff5aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/openai/types.rs:470-482 | engine/llm-response-parser/src/openai.rs:23-35 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"engine/baml-runtime/src/internal/llm_client/primitive/openai/types.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"417fd1ade1d04b9e3d1ff1b7e50740a7906ac050ee390dff05bfd2e91918ef0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs:130-142 | engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs:194-205 \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 \u0060engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs:130\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs:143\u0060 calls \u0060from\u0060, \u0060get\u0060 and \u0060engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs:206\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70937e23584dd749bc2bee9ceafb109637bab01ec55feeba1ebd86f84d71cbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): engine/baml-runtime/src/lib.rs:283-303 | engine/baml-runtime/src/lib.rs:318-338 \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 \u0060engine/baml-runtime/src/lib.rs:283\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":"engine/baml-runtime/src/lib.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"3965e2cf86a594ab5304c2ca0725d0477a8956d71a0638fcd12e1fc8476c7030"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): engine/baml-runtime/src/request/aws.rs:189-200 | engine/baml-runtime/src/request/aws.rs:231-243 \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 \u0060engine/baml-runtime/src/request/aws.rs:189\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/baml-runtime/src/request/aws.rs:202\u0060 calls \u0060Some\u0060, \u0060timeout\u0060 and \u0060engine/baml-runtime/src/request/aws.rs:245\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":"engine/baml-runtime/src/request/aws.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08a87192844d75789600c9bcebe7464c21ac161f486f06c173a817b2bd43e6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/baml-runtime/src/runtime/publisher/mod.rs:173-185 | engine/baml-runtime/src/runtime/publisher/mod.rs:200-212 \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 \u0060engine/baml-runtime/src/runtime/publisher/mod.rs:173\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/runtime/publisher/mod.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"9001437be92fe61e758b4d3af7649ced1562fdebc0a4cf5828db0ab96e3b7f6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/baml-runtime/src/tracing/mod.rs:1111-1123 | engine/baml-runtime/src/tracing/mod.rs:1125-1137 \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":"engine/baml-runtime/src/tracing/mod.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"da52fe5b2444770424ee6ebeeba9dedfee9717a02959e06d225c607a7ad69d0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1175-1187 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1229-1240 \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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f771ffef08c3b9b5e52f4d7a6ed72d4771b4ffefe4048a61777d7b1a189fc2aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/baml_cffi_macros/src/lib.rs:106-118 | engine/baml_cffi_macros/src/lib.rs:1780-1792 \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 \u0060engine/baml_cffi_macros/src/lib.rs:106\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":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc897af29924dd3ab6ff380869cc4a5c567d6ea015c70a8ee60ae5de1c9905ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/generators/languages/go/src/ir_to_go/mod.rs:263-275 | engine/generators/languages/rust/src/ir_to_rust/mod.rs:293-305 \u2014 before extracting anything, compare \u0060engine/generators/languages/go/src/ir_to_go/mod.rs\u0060 and \u0060engine/generators/languages/rust/src/ir_to_rust/mod.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 208 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/generators/languages/go/src/ir_to_go/mod.rs:263\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":"engine/generators/languages/go/src/ir_to_go/mod.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"2221de3d24bcd6b2cd900ff6beaf2506ba47351be5efdc89a78c9b6ad9df71ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/generators/languages/go/src/ir_to_go/mod.rs:282-294 | engine/generators/languages/rust/src/ir_to_rust/mod.rs:312-324 \u2014 before extracting anything, compare \u0060engine/generators/languages/go/src/ir_to_go/mod.rs\u0060 and \u0060engine/generators/languages/rust/src/ir_to_rust/mod.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 208 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/generators/languages/go/src/ir_to_go/mod.rs:282\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":"engine/generators/languages/go/src/ir_to_go/mod.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b650a771e161607e45a62402b787292673fdf2dcb7771a0d063fbcb6c11788"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/generators/languages/python/src/ir_to_py/classes.rs:64-76 | engine/generators/languages/python/src/ir_to_py/classes.rs:82-94 \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 \u0060engine/generators/languages/python/src/ir_to_py/classes.rs:64\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":"engine/generators/languages/python/src/ir_to_py/classes.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14980dfb1fba001b68f97bdc17b568f6d8ee1cbe7b499b2bee511a3dc6b9f89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/generators/languages/python/src/watchers.rs:274-286 | engine/generators/languages/typescript/src/watchers.rs:262-274 \u2014 before extracting anything, compare \u0060engine/generators/languages/python/src/watchers.rs\u0060 and \u0060engine/generators/languages/typescript/src/watchers.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/python/src/watchers.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e3631876d72da58e00c515541cbe8adfbeabbbb3172a89227aa4530c580c90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/generators/languages/rust/src/ir_to_rust/mod.rs:68-82 | engine/generators/languages/rust/src/ir_to_rust/mod.rs:252-266 \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 \u0060engine/generators/languages/rust/src/ir_to_rust/mod.rs:68\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":"engine/generators/languages/rust/src/ir_to_rust/mod.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5811cd9d28ea0a59909e3c428a14cdaf5252fd6639783c8f51abe98ce9f7b32d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/language_client_ruby/ext/ruby_ffi/src/types/log_collector.rs:406-418 | engine/language_client_typescript/src/types/log_collector.rs:327-339 \u2014 before extracting anything, compare \u0060engine/language_client_ruby/ext/ruby_ffi/src/types/log_collector.rs\u0060 and \u0060engine/language_client_typescript/src/types/log_collector.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_ruby/ext/ruby_ffi/src/types/log_collector.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcc1753262af49243415d59a75bfc11b00d9f548ca2e554d493ab9316a869e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/language_server/src/server/api/notifications/did_save_text_document.rs:114-126 | engine/language_server/src/server/api/notifications/did_save_text_document.rs:211-223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/language_server/src/server/api/notifications/did_save_text_document.rs:114\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":"engine/language_server/src/server/api/notifications/did_save_text_document.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b93a050dfa94f772cd3da592f5a0b6f401bf8ab3a9091b9424c96f1685f9149"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:747-758 | baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:775-786 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:781-792 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:813-824 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 586 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:747\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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef9f06782dfe0162f1d2293313d55c2ceb40e4c8774efa9ca1fa5637f89d0cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): engine/baml-lib/llm-client/src/clients/anthropic.rs:86-97 | engine/baml-lib/llm-client/src/clients/aws_bedrock.rs:152-163 | engine/baml-lib/llm-client/src/clients/google_ai.rs:85-96 | engine/baml-lib/llm-client/src/clients/vertex.rs:225-236 \u2014 before extracting anything, compare \u0060engine/baml-lib/llm-client/src/clients/anthropic.rs\u0060 and \u0060engine/baml-lib/llm-client/src/clients/google_ai.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"engine/baml-lib/llm-client/src/clients/anthropic.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb54cc966ec37805f785b0e9d7597bd46a6a97b81518495acc68352376fccfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): engine/baml-vm/src/vm.rs:754-765 | engine/baml-vm/src/vm.rs:833-844 | engine/baml-vm/src/vm.rs:1308-1319 | engine/baml-vm/src/vm.rs:1363-1374 \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 \u0060engine/baml-vm/src/vm.rs:754\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":"engine/baml-vm/src/vm.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f2dfb3fbc6f8a9233f3434382bdba1ec3633c8982fd8a367e30766fe61de4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): engine/generators/languages/go/src/ir_to_go/classes.rs:10-21 | engine/generators/languages/go/src/ir_to_go/classes.rs:29-40 | engine/generators/languages/ruby/src/ir_to_rb/classes.rs:10-21 | engine/generators/languages/ruby/src/ir_to_rb/classes.rs:29-40 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/go/src/ir_to_go/classes.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08273598a8aba7e0f47c23cd278e10cce046c799bdf7b9b0503ca862d516d1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): engine/language_client_cffi/src/ffi/functions.rs:80-91 | engine/language_client_cffi/src/ffi/functions.rs:144-155 | engine/language_client_cffi/src/ffi/functions.rs:255-266 | engine/language_client_cffi/src/ffi/functions.rs:359-370 \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 \u0060engine/language_client_cffi/src/ffi/functions.rs:80\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":"engine/language_client_cffi/src/ffi/functions.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"4567c9aacdbd6853a51904ddcc88886f0f7a08b245f221ed23c6140067ddc066"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:390-401 | baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:426-437 | engine/baml-runtime/src/control_flow.rs:681-692 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs\u0060 and \u0060engine/baml-runtime/src/control_flow.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:390\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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff4c1dcd8e8dde966a87e5d6f16c2e5b27a846de90e7b8466f3a9e7dab7b3ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 3): baml_language/crates/baml_fmt/src/ast/attributes.rs:184-195 | baml_language/crates/baml_fmt/src/ast/declarations.rs:366-375 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1524-1533 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_fmt/src/ast/attributes.rs\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/declarations.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_fmt/src/ast/attributes.rs:184\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":"baml_language/crates/baml_fmt/src/ast/attributes.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d1161b4c991bceac96c6f3b0bd579e46d3b66ae0bee573f2755e6151dbcfcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): baml_language/crates/baml_ide/src/describe.rs:864-874 | baml_language/crates/baml_ide/src/describe.rs:975-985 | baml_language/crates/baml_ide/src/describe.rs:2363-2374 \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 \u0060baml_language/crates/baml_ide/src/describe.rs:864\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/describe.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d1be9ec92d5c859a934e973f74a496eb5268be9dcd01232add16e97175ee91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): baml_language/crates/bex_vm/src/vm.rs:11463-11474 | baml_language/crates/bex_vm/src/vm.rs:11497-11508 | baml_language/crates/bex_vm/src/vm.rs:11530-11541 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/crates/bex_vm/src/vm.rs:11496\u0060 calls \u0060ensure_pop\u0060 and \u0060baml_language/crates/bex_vm/src/vm.rs:11462\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":11463}}}],"partialFingerprints":{"codehealthFindingId/v1":"825a7f4ffdeff1201352328b72b3dd6e95764fb5300893d4fe7a4a9b3bf3e6b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:164-175 | engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs:197-208 | engine/baml-runtime/src/internal/llm_client/primitive/vertex/vertex_client.rs:221-232 \u2014 before extracting anything, compare \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs\u0060 and \u0060engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:164\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":"engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"973d12132992aea639e5fa99cda22dd8dad637dc92b2bc693efe4a3fab2e68cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): languages/rust/baml-macros/src/shared.rs:61-72 | languages/rust/baml-macros/src/shared.rs:92-103 | languages/rust/baml-macros/src/shared.rs:127-138 \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 \u0060languages/rust/baml-macros/src/shared.rs:61\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":"languages/rust/baml-macros/src/shared.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"269d4b4a4a4a3bab3ea642f015769fe4dd1c3596dc89ba9b47e1ce12c760c840"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1616-1627 | baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1952-1960 \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 \u0060baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1616\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":"baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a2c68bfcec3bc73bfc9aa038579471023ddc219399547553941e7641d1849b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/baml_cli/src/describe_command.rs:808-819 | baml_language/crates/baml_cli/src/describe_command.rs:834-845 \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":"baml_language/crates/baml_cli/src/describe_command.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7879dec6a0a6bbab352b956d5eaa36c52943d635860b92c099fa9025a11658"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/baml_compiler2_hir/src/item_tree/builder.rs:67-78 | baml_language/crates/baml_compiler2_hir/src/item_tree/builder.rs:267-278 \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 \u0060baml_language/crates/baml_compiler2_hir/src/item_tree/builder.rs:67\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":"baml_language/crates/baml_compiler2_hir/src/item_tree/builder.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"65636a5598cefa78d6e989f94d459034a20a3523cf01eb4e3d2ccd801dd86a00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:169-180 | baml_language/crates/baml_type/src/unify.rs:505-516 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs\u0060 and \u0060baml_language/crates/baml_type/src/unify.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 452 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa418e56475a626b2f3095b826ea53c407d1cff93c6ccaf19b2ac6126286c801"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:689-700 | baml_language/crates/baml_type/src/unify.rs:1217-1228 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs\u0060 and \u0060baml_language/crates/baml_type/src/unify.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 452 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"69deeeb834dfd8f15a74c0fc35f7036775af39df924790fae9387c8b159909f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:6981-6992 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:7075-7086 \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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":6981}}}],"partialFingerprints":{"codehealthFindingId/v1":"61be13e8fb1b49193dff7a979eddbaec90cef8eede84ffb972b4e30c4150a4a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:7010-7020 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:7090-7101 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:7090\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":7010}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7452723e5d3244daaa272f21830ff8ae0d5b3fbed0c201fe65442767edc8dc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:7102-7113 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:10173-10184 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:7102\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":7102}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebaecb48939e3a8bd2f5ad777b9dfa915d5fe17146ec0f69ddd14bec37cdbcf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:7118-7129 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:10189-10200 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:7118\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":7118}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa96b5a4aacbab531c8ef1885b46625dc7dce523aa3e685cb841227d62486ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:1234-1245 | baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:1373-1383 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:1234\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":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00bf5117e6666c1f64c4537f64fd566744512790723dd738aef687b17502bbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:13237-13248 | baml_language/crates/baml_compiler2_mir/src/lower.rs:14545-14556 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:13237\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":13237}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eaebfad5f2267cb44aa348743a4465c3ad947d36c4436cd24533064bb71dc95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:14339-14350 | baml_language/crates/baml_compiler2_mir/src/lower.rs:14689-14699 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:14339\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":14339}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4e8023231a2b6c4a84b91608384986f9c51d7a6af0939ad8bd999b728f0932"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/optimize/values.rs:295-306 | baml_language/crates/baml_compiler2_mir/src/optimize/values.rs:342-353 \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 \u0060baml_language/crates/baml_compiler2_mir/src/optimize/values.rs:295\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":"baml_language/crates/baml_compiler2_mir/src/optimize/values.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8370f201b47d041a6e1bab90264d8dd0410e854a0819f9c5f36a26f820ce4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:673-684 | engine/baml-runtime/src/control_flow/flatten/step3_inline_implicit_nodes.rs:142-153 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs\u0060 and \u0060engine/baml-runtime/src/control_flow/flatten/step3_inline_implicit_nodes.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 132 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:673\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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed7f434353fe724512c071f75977611a6820feb25457960b431b70b5ab23752"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:528-539 | engine/baml-runtime/src/control_flow.rs:718-729 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs\u0060 and \u0060engine/baml-runtime/src/control_flow.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:528\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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bece8ebacce149b3a4e7e82f8e0bfc00b5daabb286e3548dcfcbdd11959dbb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/declarations.rs:727-738 | baml_language/crates/baml_fmt/src/ast/declarations.rs:786-797 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/crates/baml_fmt/src/ast/declarations.rs:783\u0060 calls \u0060present\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/declarations.rs:725\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":"baml_language/crates/baml_fmt/src/ast/declarations.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ea1c1feac268676290683fa684a07a0c7f67433730f44713f050b7a56542dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/pattern.rs:475-486 | baml_language/crates/baml_fmt/src/ast/types.rs:188-199 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_fmt/src/ast/pattern.rs\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/types.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_fmt/src/ast/pattern.rs:475\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060id\u0060 to \u0060Id\u003CUnionPattern\u003E\u0060 in one and \u0060Id\u003CUnionType\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":"baml_language/crates/baml_fmt/src/ast/pattern.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48ef0a678cfe7865c1340a5a25654b66b6d52b61d2f382730f9150674732ddb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/statements.rs:473-484 | baml_language/crates/baml_fmt/src/ast/types.rs:392-403 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_fmt/src/ast/statements.rs:473\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060shape\u0060 to \u0060\u0026Shape\u0060 in one and \u0060Shape\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":"baml_language/crates/baml_fmt/src/ast/statements.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8dac2453868cf50a5e9657e6463c005b3d8f4854310b4d1655bd16f0d2e78bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/baml_ide/src/info.rs:610-621 | baml_language/crates/baml_ide/src/info.rs:651-662 \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 \u0060baml_language/crates/baml_ide/src/info.rs:610\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":"baml_language/crates/baml_ide/src/info.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af261db275b1a3ba074a3dcbbb44d80acc81fd3f644b96ac99962a437d979aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/baml_ide/src/resolve.rs:980-991 | baml_language/crates/baml_ide/src/resolve.rs:1080-1091 \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 \u0060baml_language/crates/baml_ide/src/resolve.rs:980\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":"baml_language/crates/baml_ide/src/resolve.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6a36b4c0966783a035d190fd9a88feec44e8f6b61fe3cc94f809871fb1deac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/baml_parser/src/items.rs:1290-1301 | baml_language/crates/baml_parser/src/items.rs:1435-1446 \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 \u0060baml_language/crates/baml_parser/src/items.rs:1290\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":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed862861d9ddc73523ef4ee83e87d4ed213733d7b5343df8907d3e74795bd184"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/baml_query_btel/src/ingest.rs:587-598 | baml_language/crates/baml_query_btel/src/ingest.rs:828-839 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb2aff30642a845c6efc675d8da436955d9c5c2f0fabfb96a63e04fc75e07b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/bex_engine/src/conversion.rs:894-905 | baml_language/crates/bex_engine/src/conversion.rs:934-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 \u0060baml_language/crates/bex_engine/src/conversion.rs:894\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":"baml_language/crates/bex_engine/src/conversion.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf12a9edace42f14531aea7cc47bed6c0b5a9cc69668d4c9f7cc417ede7ebe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/bex_heap/src/accessor.rs:541-552 | baml_language/crates/bex_heap/src/accessor.rs:558-569 \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 \u0060baml_language/crates/bex_heap/src/accessor.rs:541\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":"baml_language/crates/bex_heap/src/accessor.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47fc84068328ce7c67a36d801ad3ee4490c27a83a55928514bf73f4e20e849c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/coercer/coerce_enum.rs:77-88 | baml_language/crates/bex_sap/src/deserializer/coercer/coerce_enum.rs:168-179 \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 \u0060baml_language/crates/bex_sap/src/deserializer/coercer/coerce_enum.rs:77\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_enum.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebdc8d34eeda530a31c37d1ded6b5633167353b703319d609d0ff2dc6789b260"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:828-839 | engine/baml-lib/jsonish/src/deserializer/coercer/coerce_primitive.rs:250-261 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"9423f12aaa582d3b01d40e9d88564989f29f5a46386ea7bcb6333278bcd29f64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:815-826 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:860-871 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 586 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:815\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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"4791e005add202363392f57ad3de81f9b08be9380af8689e44bd2796fb4d9702"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/bex_sap/src/sap_model/from_literal.rs:383-394 | baml_language/crates/bex_sap/src/sap_model/from_literal.rs:422-433 \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":"baml_language/crates/bex_sap/src/sap_model/from_literal.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d79f1b4e3b200c355c2664e75226495780deb22d07abc4a4323670174c3e5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/bex_vm/src/package_baml/array.rs:1022-1033 | baml_language/crates/bex_vm/src/package_baml/array.rs:1269-1280 \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":"baml_language/crates/bex_vm/src/package_baml/array.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c84a54735ccba6391c9ba9455b96fb076460ec3b305ae89ea19f36b1ba8f673"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/bex_vm/src/package_baml/sap.rs:931-942 | baml_language/crates/bex_vm/src/package_baml/sap.rs:1116-1127 \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 \u0060baml_language/crates/bex_vm/src/package_baml/sap.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":"baml_language/crates/bex_vm/src/package_baml/sap.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c19ea08a8c6758cb026ac640d35373cedf890f8f6a93774d2e11f63047544dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/bex_vm/src/package_reflect/reflect.rs:1584-1595 | baml_language/crates/bex_vm/src/package_reflect/reflect.rs:1933-1944 \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":"baml_language/crates/bex_vm/src/package_reflect/reflect.rs"},"region":{"startLine":1584}}}],"partialFingerprints":{"codehealthFindingId/v1":"191a62e7d3066f1b119d957e52ad7649d83d9c4877d686375a5e59f515a05f3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/bex_vm/src/vm.rs:7539-7550 | baml_language/crates/bex_vm/src/vm.rs:7555-7566 \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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":7539}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7738ddd2bd492b333fa949cc1c49b8af0cafef19a6e0eb271fe3b26be81602"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201312 lines \u00D7 2): baml_language/crates/bex_vm/src/vm.rs:9168-9173 | engine/baml-vm/src/vm.rs:979-990 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_vm/src/vm.rs:9168\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":9168}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f02ff8d9bb2ccc0930ff000efdd4b886dfa8d25c37ce6f4abdc8d0b85e1943f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/bex_vm/src/vm.rs:9792-9803 | baml_language/crates/bex_vm/src/vm.rs:9826-9837 \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 \u0060baml_language/crates/bex_vm/src/vm.rs:9792\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/crates/bex_vm/src/vm.rs:9825\u0060 calls \u0060ensure_pop\u0060 and \u0060baml_language/crates/bex_vm/src/vm.rs:9791\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":9792}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d61bc5a8268c9d8db89233c09464f03434c8bacd588e461613e5c668201aa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/bex_vm/src/vm/compiled_rt/heap.rs:161-172 | baml_language/crates/bex_vm/src/vm/compiled_rt/heap.rs:177-188 \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 \u0060baml_language/crates/bex_vm/src/vm/compiled_rt/heap.rs:177\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":"baml_language/crates/bex_vm/src/vm/compiled_rt/heap.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b49eb45a4e15e126b78848b600856438636a6be7a18aa62223e8876ad5cec2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/sys_native/src/io_impls.rs:706-717 | baml_language/crates/sys_native/src/io_impls.rs:1135-1146 \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":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"a459b97ac66630fe414933de9983b2af6c483ca7f86f1b0dcd79fd3d7da3fcc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/sys_native/src/io_impls.rs:3582-3593 | baml_language/crates/sys_native/src/io_impls.rs:3620-3631 \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":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":3582}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a7886b5861c5a3dbb3969aae2f7e9fa2476895878338102958c97595cd8555"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): baml_language/crates/sys_ops/src/output_format.rs:465-475 | baml_language/crates/sys_ops/src/output_format.rs:993-1004 \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":"baml_language/crates/sys_ops/src/output_format.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e4d1fba40bc4753b0df0d1321de30ad78edae70b93b4739021e4b235eb28d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): baml_language/crates/tools_size_gate/src/output.rs:138-165 | baml_language/crates/tools_size_gate/src/output.rs:204-231 \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 \u0060baml_language/crates/tools_size_gate/src/output.rs:138\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":"baml_language/crates/tools_size_gate/src/output.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f33d7c8617cdef930d454c91dfe3a8054669806fdc79ba46f89fdac584d4426"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): baml_language/sdks/go/sdkgen_go/src/lib.rs:1110-1121 | baml_language/sdks/go/sdkgen_go/src/lib.rs:2025-2035 \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 \u0060baml_language/sdks/go/sdkgen_go/src/lib.rs:1110\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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b7ca2f8fc8d3f678aa3a2300e87fe68ebdce13ccd0175f9737d3b61d5d742b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/sdks/go/sdkgen_go/src/names.rs:453-464 | baml_language/sdks/go/sdkgen_go/src/names.rs:552-563 \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 \u0060baml_language/sdks/go/sdkgen_go/src/names.rs:453\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":"baml_language/sdks/go/sdkgen_go/src/names.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f69b5b01e89ea85eb6f39dfbe468a957be57781b097ef9bb35399a096d56104"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/sdks/rust/sdkgen_rust/src/lib.rs:242-253 | baml_language/sdks/rust/sdkgen_rust/src/lib.rs:312-323 \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 \u0060baml_language/sdks/rust/sdkgen_rust/src/lib.rs:242\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":"baml_language/sdks/rust/sdkgen_rust/src/lib.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"05bf83a8b08a91054953ec0f5887f69bc40ab770ada9b659f27b967dcbf25c6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/baml-compiler/src/thir/interpret.rs:1601-1612 | engine/baml-runtime/src/async_interpreter_runtime.rs:906-917 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-compiler/src/thir/interpret.rs:1601\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":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70189a73c0408f9e088869200d6c146161304ac2e95592bd0b1aacbe8d5ed9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/baml-lib/ast/src/parser/parse_expression.rs:100-111 | engine/baml-lib/ast/src/parser/parse_expression.rs:114-125 \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":"engine/baml-lib/ast/src/parser/parse_expression.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bed1cc7cb3c78b87db51f794682f894e236e6a5f7dafe16b25d3e50dd5bc315"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs:599-610 | engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs:617-628 \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":"engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92ef73fa1fa9363d83ff7a9cdc61cedb8de9ded7d833cb743b75c96a9263730"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/baml-lib/baml-core/src/ir/repr.rs:954-965 | engine/baml-lib/baml-core/src/ir/repr.rs:968-979 \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 \u0060engine/baml-lib/baml-core/src/ir/repr.rs:954\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":"engine/baml-lib/baml-core/src/ir/repr.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"512f76cd89da5ac023ebc8dec0e27fe06546b3e5aa2bcd009e6ed1c7fe5bc49a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/functions.rs:19-30 | engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/template_strings.rs:10-21 \u2014 before extracting anything, compare \u0060engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/functions.rs\u0060 and \u0060engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/template_strings.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/functions.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0aea6ac5d95a4bce0cdd1a75bb0d0b7c3b71f61b1d13f74eb7b6730e37316b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/baml-lib/baml-types/src/expr.rs:639-650 | engine/baml-lib/baml-types/src/expr.rs:755-766 \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 \u0060engine/baml-lib/baml-types/src/expr.rs:639\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":"engine/baml-lib/baml-types/src/expr.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"decfa49275c4789c68213845c77dda11e15e4f25e6522019882aa0226c14c3ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/baml-lib/jsonish/src/deserializer/coercer/ir_ref/coerce_class.rs:422-433 | engine/baml-lib/jsonish/src/deserializer/coercer/ir_ref/coerce_class.rs:439-450 \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 \u0060engine/baml-lib/jsonish/src/deserializer/coercer/ir_ref/coerce_class.rs:422\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":"engine/baml-lib/jsonish/src/deserializer/coercer/ir_ref/coerce_class.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dabf730a2726b7c90e7b3fb6deb2e7abd30823954811efb888ff5278438c11b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): engine/baml-runtime/src/cli/repl.rs:1331-1342 | engine/baml-runtime/src/cli/repl.rs:1470-1480 \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. 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":"engine/baml-runtime/src/cli/repl.rs"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"b90d8d81a05f2d112b6d578da3e2eca4fabc8d6d4162ab3864d69e2bf06d5ad7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/baml-runtime/src/cli/serve/mod.rs:429-440 | engine/baml-runtime/src/cli/serve/mod.rs:574-585 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/cli/serve/mod.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d86941efc4813c90e649fcb48b7a6ce11120624b92839a5820026d5d4171309"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/llm_provider.rs:77-88 | engine/baml-runtime/src/internal/llm_client/llm_provider.rs:103-114 \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 \u0060engine/baml-runtime/src/internal/llm_client/llm_provider.rs:77\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":"engine/baml-runtime/src/internal/llm_client/llm_provider.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c840998d208a8fc5d1b00d2e97f6bbf6bce93c59690e46ba731e87315b775b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): engine/baml-runtime/src/lib.rs:715-726 | engine/baml-runtime/src/lib.rs:928-938 \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 \u0060engine/baml-runtime/src/lib.rs:715\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":"engine/baml-runtime/src/lib.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbd6814e3b55381821a40dfddd830c6bc4f395c9d7ef8ec4f8d5116567f884e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/baml-runtime/src/optimize/pareto.rs:33-44 | engine/baml-runtime/src/optimize/tui.rs:531-542 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/optimize/pareto.rs:33\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":"engine/baml-runtime/src/optimize/pareto.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1086de9642cc256733a472e16085a147dafceb19b71d7140df3a8894d275a648"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/baml-runtime/src/type_builder/mod.rs:223-234 | engine/baml-runtime/src/type_builder/mod.rs:258-269 \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 \u0060engine/baml-runtime/src/type_builder/mod.rs:223\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":"engine/baml-runtime/src/type_builder/mod.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a2945736f5a92ea0477f4d29241714d2b38224e5ca02f886f61c02ad691c74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:137-148 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:154-163 \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 \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:137\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4b86e5384b6395981583546e856139773ad3d3bc8d88ebc507c4befbcd444f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1151-1162 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1213-1224 \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 \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1151\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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"298bfd78833a4efbe93d4a9b405298e2306d7abf2e6de3505dd130efb7e45929"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1270-1280 | engine/language_server/src/baml_project/mod.rs:827-838 \u2014 before extracting anything, compare \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs\u0060 and \u0060engine/language_server/src/baml_project/mod.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 183 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1270\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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a402f476dc480cc5cdaf922e4ec7a0e2b1c6b70ab5b320876e0c4e6e780711e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/generators/languages/go/src/ir_to_go/mod.rs:250-261 | engine/generators/languages/rust/src/ir_to_rust/mod.rs:280-291 \u2014 before extracting anything, compare \u0060engine/generators/languages/go/src/ir_to_go/mod.rs\u0060 and \u0060engine/generators/languages/rust/src/ir_to_rust/mod.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 208 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/generators/languages/go/src/ir_to_go/mod.rs:250\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":"engine/generators/languages/go/src/ir_to_go/mod.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"790c0ad156f7391c2fcec5f61cd8c0ec7d3fa0499bda3c062c2ba4cfc9fbf873"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/generators/languages/go/src/package.rs:11-22 | engine/generators/languages/rust/src/package.rs:11-22 \u2014 before extracting anything, compare \u0060engine/generators/languages/go/src/package.rs\u0060 and \u0060engine/generators/languages/rust/src/package.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/go/src/package.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0605a9d26ecf47e5cc0711df98e92b2370509c752c3672104afd5e6cf3b37972"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): engine/generators/languages/python/src/ir_to_py/mod.rs:97-108 | engine/generators/languages/python/src/ir_to_py/mod.rs:182-190 \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 \u0060engine/generators/languages/python/src/ir_to_py/mod.rs:97\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":"engine/generators/languages/python/src/ir_to_py/mod.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"896def45600243426b80bf967699ce19aab678bb3c9cecb9edf6f7c4c0c1b211"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/generators/languages/python/src/watchers.rs:177-188 | engine/generators/languages/typescript/src/watchers.rs:173-184 \u2014 before extracting anything, compare \u0060engine/generators/languages/python/src/watchers.rs\u0060 and \u0060engine/generators/languages/typescript/src/watchers.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/generators/languages/python/src/watchers.rs:177\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":"engine/generators/languages/python/src/watchers.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"785452831e60028a83d38be200b2118ec6e1920d987d46d6b9d525afc5bd583f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/generators/languages/ruby/src/ir_to_rb/mod.rs:27-38 | engine/generators/languages/ruby/src/ir_to_rb/mod.rs:146-157 \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 \u0060engine/generators/languages/ruby/src/ir_to_rb/mod.rs:27\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":"engine/generators/languages/ruby/src/ir_to_rb/mod.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba82f5af8d25f8a7b60d6c035e469dae5cfc3f637cdbac47e6b8faba2522ae9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/generators/languages/typescript/src/type.rs:96-107 | engine/generators/languages/typescript/src/type.rs:152-163 \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 \u0060engine/generators/languages/typescript/src/type.rs:96\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":"engine/generators/languages/typescript/src/type.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"38627cc0d2bee0d29ea15fd54b6f25b4bc65dec313bf8bfee96ed52bdfb95c4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 5): baml_language/crates/baml_compiler2_mir/src/lower.rs:7724-7734 | baml_language/crates/baml_compiler2_mir/src/lower.rs:7904-7913 | baml_language/crates/baml_compiler2_mir/src/lower.rs:7952-7961 | baml_language/crates/baml_compiler2_mir/src/lower.rs:8036-8045 | baml_language/crates/baml_compiler2_mir/src/lower.rs:8287-8296 \u2014 all 5 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":7724}}}],"partialFingerprints":{"codehealthFindingId/v1":"6840374ec91d53227ea67fcc0840e32a8d8849f0ff330986fdab29434cb275bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): baml_language/crates/baml_fmt/src/ast/attributes.rs:157-167 | baml_language/crates/baml_fmt/src/ast/declarations.rs:343-353 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1498-1508 | baml_language/crates/baml_fmt/src/ast/expressions.rs:2075-2085 | baml_language/crates/baml_fmt/src/ast/types.rs:500-510 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_fmt/src/ast/attributes.rs\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/declarations.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/attributes.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c3e5085f00f718fb579eed1e5bf1472607c555063b337ea15925de2e2861a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:758-768 | baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:811-821 | baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:896-906 | baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:1007-1017 \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 \u0060baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:758\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":"baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc1ee4988bc5d16d365336f18a93d68cbe971a91a8bae2469b5511bbe1d3fdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): engine/baml-lib/baml-core/src/ir/ir_hasher/mod.rs:449-460 | engine/baml-lib/baml-core/src/ir/ir_hasher/mod.rs:464-474 | engine/baml-lib/baml-core/src/ir/ir_hasher/mod.rs:478-488 | engine/baml-lib/baml-core/src/ir/ir_hasher/mod.rs:492-504 \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 \u0060engine/baml-lib/baml-core/src/ir/ir_hasher/mod.rs:449\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":"engine/baml-lib/baml-core/src/ir/ir_hasher/mod.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"79450e7604b320749c5cc4bb0f50708e0554c63feb1f5645c0ea0ee8450d6c59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): engine/baml-lib/baml-types/src/baml_value.rs:143-153 | engine/baml-lib/baml-types/src/baml_value.rs:167-177 | engine/baml-lib/baml-types/src/baml_value.rs:940-950 | engine/baml-lib/baml-types/src/baml_value.rs:966-976 \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 \u0060engine/baml-lib/baml-types/src/baml_value.rs:143\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":"engine/baml-lib/baml-types/src/baml_value.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58e6aa4b006102a4fd238186f06051aabc110feef1fb812ab5c5ceb0e3860d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 4): engine/baml-runtime/src/internal/llm_client/primitive/request.rs:262-272 | engine/baml-runtime/src/internal/llm_client/primitive/request.rs:289-298 | engine/baml-runtime/src/internal/llm_client/primitive/request.rs:318-328 | engine/baml-runtime/src/internal/llm_client/primitive/request.rs:347-356 \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 \u0060engine/baml-runtime/src/internal/llm_client/primitive/request.rs:262\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/request.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a281706e3f73fc929ab312c82e468a8299edc6ea48ca7d33fad94f9e9521c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1288-1299 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1380-1391 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1877-1887 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1951-1961 \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 \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1288\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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6c805ca7df7174fddfe8f21bef3e75acbb1892bb356142f4234a72809a9f04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): engine/generators/languages/rust/src/ir_to_rust/classes.rs:21-31 | engine/generators/languages/rust/src/ir_to_rust/classes.rs:47-57 | engine/generators/languages/typescript/src/ir_to_ts/classes.rs:10-20 | engine/generators/languages/typescript/src/ir_to_ts/classes.rs:28-38 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/rust/src/ir_to_rust/classes.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8cbaec4833d0a1b4f76b5b388f4af2780ebbf696a6d45d658c4005809f903b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): baml_language/crates/baml_builtins2_codegen/src/extract.rs:332-342 | baml_language/crates/baml_builtins2_codegen/src/extract.rs:514-524 | baml_language/crates/baml_builtins2_codegen/src/extract.rs:682-692 \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 \u0060baml_language/crates/baml_builtins2_codegen/src/extract.rs:332\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":"baml_language/crates/baml_builtins2_codegen/src/extract.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf37f6f5ab8a3b3427acfea73b5e1469b535eea79475241f13f8583a46d7acb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:805-815 | baml_language/crates/baml_type/src/unify.rs:390-400 | baml_language/crates/baml_type_runtime/src/lib.rs:885-895 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs\u0060 and \u0060baml_language/crates/baml_type/src/unify.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 452 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:805\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":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ac797d7dbb61b18bd6a947cfdc9a8ab01b16ef234d7d6bc9680057648af9f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:7010-7020 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:7050-7060 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:7091-7101 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":7010}}}],"partialFingerprints":{"codehealthFindingId/v1":"19369e44b247c929a9a58796297872433a573648e207089aac200ba9aa57e0ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 3): baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:1813-1820 | baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:1845-1852 | baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:1894-1904 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:1813\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs"},"region":{"startLine":1813}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8990374b56fcccb0d17ae6a6c68d6db3e313f9b7e20aeea328b5bfd89343d3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): baml_language/crates/baml_compiler2_mir/src/lower.rs:6732-6742 | baml_language/crates/baml_compiler2_mir/src/lower.rs:6986-6996 | baml_language/crates/baml_compiler2_mir/src/lower.rs:10620-10630 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":6732}}}],"partialFingerprints":{"codehealthFindingId/v1":"30cecc280b1b30b45e510174ac9ae841f5f792370b023f530a48a1bd1c697ede"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): baml_language/crates/baml_parser/src/items.rs:1157-1167 | baml_language/crates/baml_parser/src/items.rs:1291-1301 | baml_language/crates/baml_parser/src/items.rs:1436-1446 \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 \u0060baml_language/crates/baml_parser/src/items.rs:1157\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":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c1dd341fcee2b41b6fe1699cf2e2cf014564549f0e2966503c0403f46d5b26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): engine/baml-compiler/src/thir.rs:226-236 | engine/baml-compiler/src/thir.rs:247-257 | engine/baml-compiler/src/thir.rs:271-281 \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 \u0060engine/baml-compiler/src/thir.rs:226\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":"engine/baml-compiler/src/thir.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b3a5c91738596055679a33adc2234a5be340a34590bf600c98b4b2ea3659d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): engine/baml-lib/baml-core/src/ir/repr.rs:2584-2594 | engine/baml-lib/baml-core/src/ir/repr.rs:2603-2612 | engine/baml-lib/baml-core/src/ir/repr.rs:2636-2646 \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 \u0060engine/baml-lib/baml-core/src/ir/repr.rs:2584\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/baml-lib/baml-core/src/ir/repr.rs:2596\u0060 calls \u0060clone\u0060 and \u0060engine/baml-lib/baml-core/src/ir/repr.rs:2614\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/ir/repr.rs"},"region":{"startLine":2584}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf16b95022032bc7747738135db7993f9ba9e7958c1dd4e1dfe55ee8102291a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): engine/baml-lib/jsonish/src/deserializer/coercer/coerce_union.rs:96-106 | engine/baml-lib/jsonish/src/deserializer/coercer/ir_ref/coerce_alias.rs:35-45 | engine/baml-lib/jsonish/src/deserializer/coercer/ir_ref/coerce_enum.rs:60-70 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/deserializer/coercer/coerce_union.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"8968bac7396528dbad2af4236a059760eff57ea132c06b147942d4e7a994cc8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): engine/baml-runtime/src/optimize/tui.rs:134-144 | engine/baml-runtime/src/optimize/tui.rs:247-257 | engine/baml-runtime/src/optimize/tui.rs:323-333 \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 \u0060engine/baml-runtime/src/optimize/tui.rs:134\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":"engine/baml-runtime/src/optimize/tui.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"3043546486601d835d514c68607ffbabe06e828e1f59816e7cbdec73f631f193"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2069-2079 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2651-2661 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2926-2936 \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 \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2069\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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":2069}}}],"partialFingerprints":{"codehealthFindingId/v1":"5715f13b03a4593d4550ae2978641f3f06989337ad7a1b2a08a30d0e355fa280"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1607-1617 | baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:2007-2017 \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 \u0060baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1607\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":"baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"bced95ec186bd8a5badb0f6c41cdf65e99154c497334138e71131c680adaa9e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1805-1815 | baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1850-1860 \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 \u0060baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1805\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":"baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"d384a133a5c5c638af5bc187cf004099ffbc070e90b64931d8572af053deb31c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/baml_compiler2_ast/src/ast.rs:544-554 | baml_language/crates/baml_compiler2_ast/src/ast.rs:562-572 \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 \u0060baml_language/crates/baml_compiler2_ast/src/ast.rs:544\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":"baml_language/crates/baml_compiler2_ast/src/ast.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"b202167124ec812a81d888eddcecbe7c112c5d7f88d21e20388368f77c3f5c21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs:493-504 | baml_language/crates/baml_compiler2_ast/src/lower_tree/templates.rs:175-186 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e4708dc797b84333e96c7ddf58524bf7ac21cd2fca632347ee155514bbe698"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/diagnostics.rs:2169-2179 | baml_language/crates/baml_compiler2_hir_ty/src/diagnostics.rs:2191-2201 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/diagnostics.rs:2169\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":"baml_language/crates/baml_compiler2_hir_ty/src/diagnostics.rs"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9a2b4f16763d121f21e1a23c042cb7abcc7f80f35378f90820705e3ad31bdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:5129-5139 | baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs:1018-1026 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":5129}}}],"partialFingerprints":{"codehealthFindingId/v1":"350876e6df33d733d4954e961e4b329e5a031ef820a9a6589ee7ffa6138fe9bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs:1323-1333 | baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs:1366-1375 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs:1323\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. 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":"baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fd88d9d6534ab1f303c76e026bdeb0481313e583f43e404b26a1594beb76a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:13254-13264 | baml_language/crates/baml_compiler2_mir/src/lower.rs:13285-13295 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:13254\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":13254}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b25d71d9c06d4a41f3a0c0bae4d74f10b395cb9c39d19bc14a212247c103a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:13838-13848 | baml_language/crates/baml_compiler2_mir/src/lower.rs:13884-13894 \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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":13838}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd7745e26dd7c93f4e64f643039fd4585860f64b81441bcc4e3b131e9acd4ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:99-109 | baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:481-490 \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 \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:99\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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4e910915f47f13f9b9a69ea40512fb2dc94234d20f9c18d80e89b624fc0a81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:523-533 | engine/baml-runtime/src/control_flow/flatten/step3_inline_implicit_nodes.rs:14-24 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs\u0060 and \u0060engine/baml-runtime/src/control_flow/flatten/step3_inline_implicit_nodes.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 132 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:523\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/baml-runtime/src/control_flow/flatten/step3_inline_implicit_nodes.rs:26\u0060 calls \u0060build_children_map\u0060 and \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:535\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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"956bce65a4e5d4e2a047dd1582ddb9652885713edd7d9382c11481a22ae251f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:610-620 | engine/baml-runtime/src/control_flow/flatten/step3_inline_implicit_nodes.rs:98-108 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs\u0060 and \u0060engine/baml-runtime/src/control_flow/flatten/step3_inline_implicit_nodes.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 132 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa73e4f7df4221aab176c04e4dd7f82523627bc85a19f9d63e852f63907e209"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:1154-1164 | baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:1168-1178 \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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"150f38f5fa0453deb74b7eafd8063a5e95350adaac82ff04c58d321a40e2b88e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/declarations.rs:123-133 | baml_language/crates/baml_fmt/src/ast/declarations.rs:136-146 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060id\u0060 to \u0060Id\u003CFunctionDef\u003E\u0060 in one and \u0060Id\u003CMethodSig\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":"baml_language/crates/baml_fmt/src/ast/declarations.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8fc19fca42a83db920e564320b0309c2898d13458cfc10bd76090617c183f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/expressions.rs:1120-1130 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1250-1260 \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 \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs:1120\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":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"4494b46625df5ed582bae9192740e26f18b1c57ccca710d7fc7e598d5fb4adfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/baml_ide/src/cursor_context.rs:294-304 | baml_language/crates/baml_ide/src/cursor_context.rs:416-426 \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 \u0060baml_language/crates/baml_ide/src/cursor_context.rs:294\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":"baml_language/crates/baml_ide/src/cursor_context.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffa7792d7d372549609672c867db3bc143f859cd3d5a678b0361654da7eed6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/baml_ide/src/describe.rs:2106-2116 | baml_language/crates/baml_ide/src/describe.rs:2168-2178 \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 \u0060baml_language/crates/baml_ide/src/describe.rs:2106\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":"baml_language/crates/baml_ide/src/describe.rs"},"region":{"startLine":2106}}}],"partialFingerprints":{"codehealthFindingId/v1":"a224df71f47471af6f0a02818023f6b648acd3c816476cf0e4c9b913adea55d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): baml_language/crates/baml_ide/src/resolve.rs:463-472 | baml_language/crates/baml_ide/src/usages.rs:399-409 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/resolve.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0a6883fbe81d7e1e2386e305704be9d21ced4a8a568495cb3a700e73ce3c20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/baml_ide/src/usages.rs:130-140 | baml_language/crates/baml_ide/src/usages.rs:369-379 \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 \u0060baml_language/crates/baml_ide/src/usages.rs:130\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/usages.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"78586e8cdc655fe86d444f05c5572aae2eb389eb7856b74bdbc01fa9c0b9af98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/baml_parser/src/expr.rs:974-984 | baml_language/crates/baml_parser/src/expr.rs:1078-1088 \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 \u0060baml_language/crates/baml_parser/src/expr.rs:974\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":"baml_language/crates/baml_parser/src/expr.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02f4b169b9aa83c052a2ec2f61d026d97b6550070b3e81f3c2d8584d6761f86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/bex_engine/src/hydrate.rs:229-239 | baml_language/crates/bex_vm/src/type_match.rs:99-109 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/crates/bex_vm/src/type_match.rs:110\u0060 calls \u0060TypeAlias\u0060, \u0060TypeVar\u0060 and \u0060baml_language/crates/bex_engine/src/hydrate.rs:240\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":"baml_language/crates/bex_engine/src/hydrate.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"223fc2963fa9b4e22ce5b7d0a56a29614ea75402228c13b91cb0db7291dc5793"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/bex_engine/src/lib.rs:2041-2051 | baml_language/crates/bex_vm/src/vm.rs:4985-4995 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":2041}}}],"partialFingerprints":{"codehealthFindingId/v1":"02471576a2f7b5885e8e5d26ae9eda83f0255a431433eb66114ff860dbe8b21d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs:257-267 | engine/baml-lib/jsonish/src/deserializer/coercer/array_helper.rs:220-229 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs\u0060 and \u0060engine/baml-lib/jsonish/src/deserializer/coercer/array_helper.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 98 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs:257\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fbf15d2b853e66a781e4956309d4bb683d87e6acc26b9ea99faeb2536177844"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs:283-293 | engine/baml-lib/jsonish/src/deserializer/coercer/mod.rs:97-107 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs:283\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":"baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d8cd8796f90f914b02ec0f68a7a1e2c1805bd8b4f0193bceec2ca6992ecd33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs:459-469 | engine/baml-lib/jsonish/src/deserializer/coercer/mod.rs:211-221 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs:459\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":"baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba41c7f8760b1eaf107dafe2aa75ef2eeae2d08536b2c0c3d72841aa3fb2f70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs:128-138 | engine/baml-lib/jsonish/src/deserializer/deserialize_flags.rs:143-153 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs\u0060 and \u0060engine/baml-lib/jsonish/src/deserializer/deserialize_flags.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 127 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03303e30dcb7eeaf32936b1fd3123c1b480e903466b28bedefb4e9672b89205"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/entry.rs:147-157 | engine/baml-lib/jsonish/src/jsonish/parser/entry.rs:156-166 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/entry.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/entry.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/entry.rs:147\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":"baml_language/crates/bex_sap/src/jsonish/parser/entry.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"faaa70398381528f1f1659a33bbd48f01508e4db44a7246a89e867b8b57c296d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser.rs:84-94 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser.rs:81-91 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser.rs\u0060 as WHOLE FILES: 84% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser.rs:84\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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0a0692ee44a8bf8269a080e625a8b0ac19e51d115a61e9e3fa10b9f8e65d9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:137-147 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:142-152 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 586 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:137\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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"3faef3ac3a36fe071ea5bd7d25bbcdc3f31e01da47ecf6965761f6ba7eddec06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/bex_vm/src/package_baml/csv.rs:376-386 | baml_language/crates/bex_vm/src/package_baml/csv.rs:499-509 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b5f4b71024355c185fa5ab8258a01b9f0a0dd19f05ec566d02a11a33ecd804"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/bex_vm/src/package_reflect/graft.rs:1263-1273 | baml_language/crates/bex_vm/src/package_reflect/graft.rs:1374-1384 \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 \u0060baml_language/crates/bex_vm/src/package_reflect/graft.rs:1263\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":"baml_language/crates/bex_vm/src/package_reflect/graft.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7a0af9d5356e6db5ba257ac1a3570c6487a59492836b878c3fc7657db6419d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/bex_vm/src/package_reflect/reflect.rs:1183-1193 | baml_language/crates/bex_vm/src/package_reflect/reflect.rs:1844-1854 \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 \u0060baml_language/crates/bex_vm/src/package_reflect/reflect.rs:1183\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":"baml_language/crates/bex_vm/src/package_reflect/reflect.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6c968224047128ff25f494e342974c2959ff216d26bdcd1d3b56f535a196ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/bex_vm/src/vm.rs:6080-6090 | baml_language/crates/bex_vm/src/vm.rs:6094-6104 \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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":6080}}}],"partialFingerprints":{"codehealthFindingId/v1":"1865d3062b2832c2fcaf18b881b2a8f47157f59cf144b229ca6962323310a4b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): baml_language/crates/bex_vm/src/vm.rs:9081-9090 | baml_language/crates/bex_vm/src/vm.rs:9094-9104 \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 \u0060baml_language/crates/bex_vm/src/vm.rs:9094\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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":9081}}}],"partialFingerprints":{"codehealthFindingId/v1":"8355641092d3cfe29e948a8adee39d49ac8f232474612ad543e82fb89643eadb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): baml_language/crates/bex_vm/src/vm.rs:11588-11597 | baml_language/crates/bex_vm/src/vm.rs:11661-11671 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/crates/bex_vm/src/vm.rs:11660\u0060 calls \u0060ensure_pop\u0060 and \u0060baml_language/crates/bex_vm/src/vm.rs:11587\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":11588}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba06ae9057703f32173e83a8f2ce394bdfe8df97ebf6819afb4790f8dd710a64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/bridge_ctypes/src/value_encode.rs:78-88 | baml_language/crates/bridge_ctypes/src/value_encode.rs:96-106 \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 \u0060baml_language/crates/bridge_ctypes/src/value_encode.rs:78\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":"baml_language/crates/bridge_ctypes/src/value_encode.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9f9a42b8f1ddb332338794c79ad733d4c8a9d7e1466a1e7c413eee1bf65854"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/bridge_ctypes/src/value_encode.rs:117-127 | baml_language/crates/bridge_ctypes/src/value_encode.rs:307-317 \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 \u0060baml_language/crates/bridge_ctypes/src/value_encode.rs:117\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":"baml_language/crates/bridge_ctypes/src/value_encode.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e79415e22dcbd0bc5977a93a77a22ef2df6117afdec86f3a551017b2af56c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/bridge_wasm/src/wasm_io_glob.rs:283-293 | baml_language/crates/bridge_wasm/src/wasm_io_glob.rs:308-318 \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 \u0060baml_language/crates/bridge_wasm/src/wasm_io_glob.rs:283\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":"baml_language/crates/bridge_wasm/src/wasm_io_glob.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f72cea0e864e608ff386dfd5ebf141bc6dd7e771e1f5dd89b55ab66f9d588ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/sys_native/src/io_impls.rs:2404-2414 | baml_language/crates/sys_native/src/io_impls.rs:2443-2453 \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 \u0060baml_language/crates/sys_native/src/io_impls.rs:2404\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":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":2404}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26ae31ac4777ac58d191da633004cf3c70bf1fb76ced47d5cf2e4a059c31295"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/sys_native/src/io_impls.rs:2601-2611 | baml_language/crates/sys_native/src/io_impls.rs:2642-2652 \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 \u0060baml_language/crates/sys_native/src/io_impls.rs:2601\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":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":2601}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc1d0b35f9e69c01d0a496f4a68b9e42bfc69b1d617b663ba305afa9492b769"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:933-943 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:1016-1026 \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 \u0060baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:933\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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ad72d0e694ac191807025fe1012e1602395f04ce4567c4d6030a1a6322c794"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:3778-3787 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:3795-3805 \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 \u0060baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:3778\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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":3778}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d99762e69de8a0b7c36f51abfb7d600d7b4f7e5797db8575eafa99c3394aa3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/sdks/go/sdkgen_go/src/lib.rs:836-846 | baml_language/sdks/go/sdkgen_go/src/lib.rs:923-933 \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 \u0060baml_language/sdks/go/sdkgen_go/src/lib.rs:836\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/sdks/go/sdkgen_go/src/lib.rs:847\u0060 calls \u0060symbol\u0060 and \u0060baml_language/sdks/go/sdkgen_go/src/lib.rs:934\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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60e8693ce64c241a73e19761e96e757dd05c2a7d8a10bb2e487147dd5251ed3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/sdks/java/sdkgen_java/src/emit.rs:372-382 | baml_language/sdks/java/sdkgen_java/src/emit.rs:573-583 \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":"baml_language/sdks/java/sdkgen_java/src/emit.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"19cc063db71534e92eaf6cdc7fcedeff4c7d8e240760a1e6da3e82ba609c76ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/sdks/rust/bridge_rust/src/outbound.rs:105-115 | baml_language/sdks/rust/bridge_rust/src/outbound.rs:123-133 \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 \u0060baml_language/sdks/rust/bridge_rust/src/outbound.rs:105\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":"baml_language/sdks/rust/bridge_rust/src/outbound.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"2670ba601a1ea9f02e473c33ed3fa17fbb9429dfcf0517314fdd55f7a0d8e552"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/baml-compiler/src/thir.rs:503-513 | engine/baml-lib/baml-types/src/expr.rs:608-618 \u2014 before extracting anything, compare \u0060engine/baml-compiler/src/thir.rs\u0060 and \u0060engine/baml-lib/baml-types/src/expr.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-compiler/src/thir.rs:503\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/thir.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"b476753ed81f15758c5937913f4c7c64cc16a41604908f0072e5c7a5645ed2c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/baml-compiler/src/thir/typecheck.rs:1641-1651 | engine/baml-compiler/src/thir/typecheck.rs:2104-2114 \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 \u0060engine/baml-compiler/src/thir/typecheck.rs:1641\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":"engine/baml-compiler/src/thir/typecheck.rs"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca3b696b0e4e79383a598a9bc018e1e19a21611c99e9b4443cc42a1ef2f68a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:269-279 | engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:306-316 \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 \u0060engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:269\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":"engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"12af3b3acc0cc35c19ca444f67e3dae396047c0f54f832a39d88ff536448448d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/expr_fns.rs:126-136 | engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/expr_fns.rs:269-279 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/expr_fns.rs:269\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":"engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/expr_fns.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93f8b7b6f5e992f073ce86026a8417c9cc94881d9c9e0fbb45253df6266ca87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/baml-lib/baml-types/src/ir_type/converters/non_streaming.rs:67-77 | engine/baml-lib/baml-types/src/ir_type/converters/streaming.rs:111-121 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/baml-types/src/ir_type/converters/non_streaming.rs:67\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":"engine/baml-lib/baml-types/src/ir_type/converters/non_streaming.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"76598169ca35c8dc3551d5b7fab006f52c609f5a894f34d668cd8aab3e06e372"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/baml-lib/jinja/src/evaluate_type/expr.rs:175-185 | engine/baml-lib/jinja/src/evaluate_type/expr.rs:187-197 \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 \u0060engine/baml-lib/jinja/src/evaluate_type/expr.rs:175\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":"engine/baml-lib/jinja/src/evaluate_type/expr.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce27c1903ac9881d275e70bd3d03a80823e15e01369453006cf86c39f1c2b129"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/google/response_handler.rs:42-52 | engine/baml-runtime/src/internal/llm_client/primitive/vertex/response_handler.rs:41-51 \u2014 \u0060engine/baml-runtime/src/internal/llm_client/primitive/google/response_handler.rs\u0060 and \u0060engine/baml-runtime/src/internal/llm_client/primitive/vertex/response_handler.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 6 separate duplicated blocks between them, totalling at least 53 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/internal/llm_client/primitive/google/response_handler.rs:42\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":"engine/baml-runtime/src/internal/llm_client/primitive/google/response_handler.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc580625c91edd6d943b04e4716d1c34627926e6016b432727642ec08586649"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/baml-runtime/src/optimize/candidate.rs:243-253 | engine/baml-runtime/src/optimize/candidate.rs:271-281 \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 \u0060engine/baml-runtime/src/optimize/candidate.rs:243\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":"engine/baml-runtime/src/optimize/candidate.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f5243cbe4dd4f04df830d126f3e50210707805f8b4ef8706f4dc9cc7ae8d1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/baml-runtime/src/optimize/tui.rs:1044-1054 | engine/baml-runtime/src/optimize/tui.rs:1190-1200 \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 \u0060engine/baml-runtime/src/optimize/tui.rs:1044\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":"engine/baml-runtime/src/optimize/tui.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0c564e731556f485d06d01c4e79430bdf0ddd819e304ace1fa7253081dab06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/generators/languages/go/src/ir_to_go/mod.rs:23-33 | engine/generators/languages/rust/src/ir_to_rust/mod.rs:33-43 \u2014 before extracting anything, compare \u0060engine/generators/languages/go/src/ir_to_go/mod.rs\u0060 and \u0060engine/generators/languages/rust/src/ir_to_rust/mod.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 208 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/go/src/ir_to_go/mod.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa908531641e9f2bbce34b581476f0a55b690d2401ddfc69689fafe876ee162"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/language_client_cffi/src/ctypes/baml_value_encode.rs:185-195 | engine/language_client_cffi/src/ctypes/object_response_encode.rs:81-91 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/language_client_cffi/src/ctypes/baml_value_encode.rs:185\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":"engine/language_client_cffi/src/ctypes/baml_value_encode.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"56409258fd813912d6ad760afd42044655580519ace5bb9fa8eadb019fd74958"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/language_server/src/server/api/diagnostics.rs:229-239 | engine/language_server/src/server/api/diagnostics.rs:275-285 \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 \u0060engine/language_server/src/server/api/diagnostics.rs:229\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":"engine/language_server/src/server/api/diagnostics.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e65948583333c13a229d5fa75cb400644112522d5f9cc4fd870c01f8dae2703"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 8): baml_language/crates/baml_fmt/src/ast/attributes.rs:189-198 | baml_language/crates/baml_fmt/src/ast/declarations.rs:370-378 | baml_language/crates/baml_fmt/src/ast/expressions.rs:393-401 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1528-1536 | baml_language/crates/baml_fmt/src/ast/expressions.rs:2103-2111 | baml_language/crates/baml_fmt/src/ast/statements.rs:479-487 | baml_language/crates/baml_fmt/src/ast/types.rs:118-126 | baml_language/crates/baml_fmt/src/ast/types.rs:398-406 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_fmt/src/ast/attributes.rs\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/declarations.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_fmt/src/ast/attributes.rs:189\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060shape\u0060 to \u0060\u0026Shape\u0060 in one and \u0060Shape\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":"baml_language/crates/baml_fmt/src/ast/attributes.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86c312a77a83724b6c8fde0b2e60dc4c482e843a7bb4c048cf130c65dd8e610"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 6): baml_language/crates/baml_fmt/src/ast/attributes.rs:171-179 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1512-1520 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1572-1581 | baml_language/crates/baml_fmt/src/ast/expressions.rs:2415-2423 | baml_language/crates/baml_fmt/src/ast/expressions.rs:2678-2686 | baml_language/crates/baml_fmt/src/ast/types.rs:514-522 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_fmt/src/ast/attributes.rs\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 162 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_fmt/src/ast/attributes.rs:171\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/attributes.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b197c14b1496754afe7bcc026f4830f8f8f2ed33fe1458010a3cf16b94e9d7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): engine/baml-runtime/src/internal/llm_client/primitive/anthropic/response_handler.rs:45-54 | engine/baml-runtime/src/internal/llm_client/primitive/google/response_handler.rs:39-48 | engine/baml-runtime/src/internal/llm_client/primitive/openai/response_handler.rs:251-260 | engine/baml-runtime/src/internal/llm_client/primitive/openai/response_handler.rs:327-336 | engine/baml-runtime/src/internal/llm_client/primitive/vertex/response_handler.rs:38-47 \u2014 \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/response_handler.rs\u0060 and \u0060engine/baml-runtime/src/internal/llm_client/primitive/openai/response_handler.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 33 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/response_handler.rs:45\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":"engine/baml-runtime/src/internal/llm_client/primitive/anthropic/response_handler.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf07e5b2ae1c4464b2ae0c42c79b5d85bcdf594386109b1ce069f4ba824735f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): engine/baml_cffi_macros/src/lib.rs:922-931 | engine/baml_cffi_macros/src/lib.rs:985-994 | engine/baml_cffi_macros/src/lib.rs:1019-1028 | engine/baml_cffi_macros/src/lib.rs:1053-1062 | engine/baml_cffi_macros/src/lib.rs:1104-1113 \u2014 all 5 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 \u0060engine/baml_cffi_macros/src/lib.rs:922\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":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c8f80ef80fde57a3ed03533d2d2d525e6ba04911ae2cd6cc4ca9fd30143ef8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs:611-620 | baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs:635-644 | baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs:1019-1028 | baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs:1043-1052 \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 \u0060baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs:611\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":"baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa8a4b05990aada70edc4c98a504f2216cc0d2f87eae098759df294b6ceef05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): baml_language/crates/baml_compiler2_hir_ty/src/package_interface.rs:158-168 | baml_language/crates/baml_compiler2_hir_ty/src/package_interface.rs:171-181 | baml_language/crates/baml_compiler2_hir_ty/src/package_interface.rs:184-194 | baml_language/crates/baml_compiler2_hir_ty/src/package_interface.rs:204-214 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/package_interface.rs:158\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/crates/baml_compiler2_hir_ty/src/package_interface.rs:195\u0060 calls \u0060try_map_heads\u0060, \u0060clone\u0060 and \u0060baml_language/crates/baml_compiler2_hir_ty/src/package_interface.rs:169\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/package_interface.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"b248544efbae260ee35899cdfd3c8af896087fbcee9e8f15cf2d4e2e4d2cacf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): engine/baml-lib/baml-core/src/ir/repr.rs:2555-2564 | engine/baml-lib/baml-core/src/ir/repr.rs:2585-2594 | engine/baml-lib/baml-core/src/ir/repr.rs:2603-2612 | engine/baml-lib/baml-core/src/ir/repr.rs:2637-2646 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/baml-lib/baml-core/src/ir/repr.rs:2596\u0060 calls \u0060clone\u0060 and \u0060engine/baml-lib/baml-core/src/ir/repr.rs:2614\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/ir/repr.rs"},"region":{"startLine":2555}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd212318461403afb4065388a22660a785cada91ace0407e19a918f483809fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/classes.rs:51-60 | engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/enums.rs:27-36 | engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/functions.rs:91-100 | engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/template_strings.rs:61-70 \u2014 before extracting anything, compare \u0060engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/functions.rs\u0060 and \u0060engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/template_strings.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/classes.rs:51\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":"engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/classes.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"44649b4d965c391706c31b80ea38dabe27fa4dc6b9b2a37ae5c4a4e3fe29712e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): engine/generators/languages/go/src/ir_to_go/mod.rs:109-118 | engine/generators/languages/go/src/ir_to_go/mod.rs:270-279 | engine/generators/languages/rust/src/ir_to_rust/mod.rs:127-136 | engine/generators/languages/rust/src/ir_to_rust/mod.rs:300-309 \u2014 before extracting anything, compare \u0060engine/generators/languages/go/src/ir_to_go/mod.rs\u0060 and \u0060engine/generators/languages/rust/src/ir_to_rust/mod.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 208 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/generators/languages/go/src/ir_to_go/mod.rs:109\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":"engine/generators/languages/go/src/ir_to_go/mod.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c5b38e28c8119178d5198b99dcd38799d72d968d9d45e62d53eae2ba56a33a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): engine/generators/languages/go/src/ir_to_go/mod.rs:140-149 | engine/generators/languages/go/src/ir_to_go/mod.rs:288-297 | engine/generators/languages/rust/src/ir_to_rust/mod.rs:158-167 | engine/generators/languages/rust/src/ir_to_rust/mod.rs:318-327 \u2014 before extracting anything, compare \u0060engine/generators/languages/go/src/ir_to_go/mod.rs\u0060 and \u0060engine/generators/languages/rust/src/ir_to_rust/mod.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 208 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/generators/languages/go/src/ir_to_go/mod.rs:140\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":"engine/generators/languages/go/src/ir_to_go/mod.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"940ea5bd6767cd54bfb5187348d31fc2cdc1748a0e9df3368aa90f097359ac0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:1809-1817 | baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:1889-1898 | baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:2092-2100 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:1809\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs"},"region":{"startLine":1809}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e73fb1ecdea18d090d680b462d64d15604a69ed8d2834360b4203dc21b0928"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): baml_language/crates/baml_compiler2_mir/src/lower.rs:1100-1109 | baml_language/crates/baml_compiler2_mir/src/lower.rs:1473-1482 | baml_language/crates/baml_compiler2_mir/src/lower.rs:1488-1497 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:1100\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf21df85225655dce7a484883eb89d65a2f25303287caf97cedd509472ab412"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): baml_language/crates/baml_compiler2_mir/src/lower.rs:6127-6136 | baml_language/crates/baml_compiler2_mir/src/lower.rs:10328-10337 | baml_language/crates/baml_compiler2_mir/src/lower.rs:12658-12667 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:12656\u0060 calls \u0060tir_is_exhaustive_match\u0060 and \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:10327\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":6127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3225938565edb53d6a3396dbd728f67851ff1e586aef0f7de611648d26d575c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): baml_language/crates/baml_db/src/check.rs:702-711 | baml_language/crates/baml_db/src/check.rs:825-834 | baml_language/crates/baml_db/src/check.rs:856-865 \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 \u0060baml_language/crates/baml_db/src/check.rs:702\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":"baml_language/crates/baml_db/src/check.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d484a57f19edc23bb69e4e8b269493c7484cf4421b2634c474ded95c139067"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:182-191 | baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:363-372 | baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:484-493 \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 \u0060baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:182\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":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b15142e96794296f77621d58ecd388c75b0e9ac8c488412b713c4056dd567e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): baml_language/crates/bex_vm/src/vm.rs:6081-6090 | baml_language/crates/bex_vm/src/vm.rs:6095-6104 | baml_language/crates/bex_vm/src/vm.rs:6109-6118 \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 \u0060baml_language/crates/bex_vm/src/vm.rs:6081\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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":6081}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5c5d701cf8a1f251cc25f4f34db1022f7c7faad44105c94addd06489c1118a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): engine/baml-runtime/src/optimize/applier.rs:118-127 | engine/baml-runtime/src/optimize/applier.rs:235-242 | engine/baml-runtime/src/optimize/applier.rs:468-475 \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 \u0060engine/baml-runtime/src/optimize/applier.rs:118\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":"engine/baml-runtime/src/optimize/applier.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6052ad9db1840a5116e0db350c5ed23178838b97955217e16bfc8ad056c5e80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): engine/baml-runtime/src/runtime/publisher/mod.rs:147-154 | engine/baml-runtime/src/runtime/publisher/mod.rs:170-179 | engine/baml-runtime/src/runtime/publisher/mod.rs:197-206 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/runtime/publisher/mod.rs:147\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/runtime/publisher/mod.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c273f008b8f2487b7f26aa21e78e498bccc08f9abe7073de5bf006e720f3704"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): engine/baml_cffi_macros/src/lib.rs:1200-1209 | engine/baml_cffi_macros/src/lib.rs:1344-1353 | engine/baml_cffi_macros/src/lib.rs:1869-1878 \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 \u0060engine/baml_cffi_macros/src/lib.rs:1200\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d40ca52913bbfe87ca25f4610f6c5fe07be372d286ee30bf77fe6cb2fbb7091"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:268-277 | baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:656-665 \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 \u0060baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:268\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":"baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbbb8cda1e0716e663cc29d368b0ca9c9fab1ec7b499c232408251309512a561"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1464-1473 | baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1777-1786 \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 \u0060baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1464\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":"baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs"},"region":{"startLine":1464}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd27d995aa9c98e12e5a887b57a27dbd5cee56980677bbd1f45e084ac469e41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_builtins2_codegen/src/extract.rs:138-147 | baml_language/crates/baml_builtins2_codegen/src/extract.rs:157-166 \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 \u0060baml_language/crates/baml_builtins2_codegen/src/extract.rs:138\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":"baml_language/crates/baml_builtins2_codegen/src/extract.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e7a3aae470e664b24935fb5307920568b159b9b05cf6c3facc0be102bf3d1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_cli/src/paint.rs:275-284 | baml_language/crates/baml_compiler_diagnostics/src/render.rs:1026-1035 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/paint.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8bddab906c2f7e38d80d99f8d48268f068757a2d32f3f3bf25ade97d884021"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:520-529 | baml_language/crates/baml_type/src/unify.rs:1023-1032 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs\u0060 and \u0060baml_language/crates/baml_type/src/unify.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 452 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"526d490307a2fefe05f00851420c26f915fc093eb5926ca2721c24b7395c1433"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:7009-7018 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:10285-10294 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:7009\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":7009}}}],"partialFingerprints":{"codehealthFindingId/v1":"a061688dd58dc8f2d7653ac25f1cda847addf2cb1532d82ade6df6c37df3b457"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/escape.rs:1216-1225 | baml_language/crates/baml_compiler2_mir/src/escape.rs:1274-1280 \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 \u0060baml_language/crates/baml_compiler2_mir/src/escape.rs:1216\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/escape.rs"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeedb830295279d8760549ed0fea6d4bcd5c77039b40e0582f7f398d4aef249a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:3463-3472 | baml_language/crates/baml_compiler2_mir/src/lower.rs:8429-8438 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:3463\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":3463}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbc861226cb9eef3b11e2fa55417e3315c645c7f4702c5b01eb0887ef854038"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:11971-11979 | baml_language/crates/baml_compiler2_mir/src/lower.rs:12014-12023 \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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":11971}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8efffb9f99dd89ecd51c0050fbb9c00229fc8edaf441829c8ca654deb9b21b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:12468-12477 | baml_language/crates/baml_compiler2_mir/src/lower.rs:12555-12564 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:12468\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":12468}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6ef047c614f017cc9bc3322d77587a54afdfb5d941537bb35c5e1ade8615a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_db/src/check.rs:92-101 | baml_language/crates/baml_db/src/check.rs:286-301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/crates/baml_db/src/check.rs:302\u0060 calls \u0060clone\u0060, \u0060extend\u0060 and \u0060baml_language/crates/baml_db/src/check.rs:102\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":"baml_language/crates/baml_db/src/check.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d09a469e3bcdb81495eaf4fb62a007df536e965910d5398572dcf7687ab00d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_db/src/check.rs:643-652 | baml_language/crates/baml_db/src/check.rs:773-782 \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":"baml_language/crates/baml_db/src/check.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f5685f6934c9b90a95a89f9f50ccccefa14289a2a38de905507a0014ec4701"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/expressions.rs:1149-1158 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1264-1273 \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 \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs:1149\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":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"56cb634f9488562f2ba7f17ef47a93be511b722f7bfb2d3302640a17c0ab1de9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/expressions.rs:1470-1479 | baml_language/crates/baml_fmt/src/ast/expressions.rs:2616-2625 \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 \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs:1470\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs:1482\u0060 calls \u0060get_for_range_split\u0060, \u0060present\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs:2626\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":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":1470}}}],"partialFingerprints":{"codehealthFindingId/v1":"02dcaf88d84c84adbe189872ba15fc9fc63c2d73787ea3f15eb5adb72d91d4ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/expressions.rs:2404-2413 | baml_language/crates/baml_fmt/src/ast/expressions.rs:2667-2676 \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 \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs:2404\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs:2666\u0060 calls \u0060get\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs:2403\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":2404}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d04dc255adb4b26230329d48d213c4286777dcea93953b3c2adcfcaafc7151f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_linker/src/resolve.rs:30-39 | baml_language/crates/baml_linker/src/resolve.rs:83-92 \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 \u0060baml_language/crates/baml_linker/src/resolve.rs:30\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":"baml_language/crates/baml_linker/src/resolve.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a038d7e3a2e03e64b2968348de9dc94053958ecc9d338eef8e6d1def2fa972ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_lsp_server/src/playground_env.rs:117-126 | baml_language/crates/baml_lsp_server/src/playground_io.rs:96-105 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_lsp_server/src/playground_env.rs:117\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/playground_env.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a2b6135a31f46766be912c1d5878da31bd220d332d2f68684155f93116d652"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_lsp_server/src/playground_env.rs:159-168 | baml_language/crates/baml_lsp_server/src/playground_io.rs:159-168 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/playground_env.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26f68a4cb55d7415f7f67f835602c6fc5794d78ce290422494ba68004edc9d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_lsp_server/src/playground_server.rs:1773-1785 | baml_language/crates/baml_lsp_server/src/playground_server.rs:2004-2013 \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 \u0060baml_language/crates/baml_lsp_server/src/playground_server.rs:1773\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. 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":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f578d215d921972b272e52fa807b5f35d7221817573c03a7e77cac9505b3483"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_type_macros/src/emit.rs:573-582 | baml_language/crates/baml_type_macros/src/emit.rs:826-835 \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 \u0060baml_language/crates/baml_type_macros/src/emit.rs:573\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":"baml_language/crates/baml_type_macros/src/emit.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"746480d7d2c109ccb25f5388fe4ccb18e9dacae4bce48966121464c27632cacc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_type_macros/src/emit.rs:584-593 | baml_language/crates/baml_type_macros/src/emit.rs:837-846 \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 \u0060baml_language/crates/baml_type_macros/src/emit.rs:584\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":"baml_language/crates/baml_type_macros/src/emit.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad3ee5f2c585beca41d00fd5137578f1b5aeb91a56c6f6f5d23eb118ec27ff4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/bex_chunkedringbuffer/src/lib.rs:487-496 | baml_language/crates/bex_chunkedringbuffer/src/lib.rs:533-542 \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":"baml_language/crates/bex_chunkedringbuffer/src/lib.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"b267aea569dc09697e664e768ce289015cf21597d1144d80ef7d4d483980850a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/bex_engine/src/lib.rs:7837-7846 | baml_language/crates/bex_engine/src/lib.rs:7855-7865 \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 \u0060baml_language/crates/bex_engine/src/lib.rs:7837\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":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":7837}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d2976bfc2603f0a99ab9c58c2415262e013294cc6d98ce225fbde65a7f6e13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/bex_engine/src/trace_value_encode.rs:469-478 | baml_language/crates/bridge_ctypes/src/value_encode.rs:291-300 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_engine/src/trace_value_encode.rs:469\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/crates/bex_engine/src/trace_value_encode.rs:467\u0060 calls \u0060Media\u0060, \u0060Some\u0060, \u0060MediaValue\u0060 and \u0060baml_language/crates/bridge_ctypes/src/value_encode.rs:289\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/trace_value_encode.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fd726eb6dd0be8800eae08a6afec89abe41cd4e3a526f82d97e4ecdf6e9d62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/bex_heap/src/gc.rs:271-280 | baml_language/crates/bex_heap/src/gc.rs:352-361 \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 \u0060baml_language/crates/bex_heap/src/gc.rs:271\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":"baml_language/crates/bex_heap/src/gc.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e959708635a41cf32729bca1c6a54cb59730a6eac755c380d60c5ca91e2165"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/coercer/coerce_class.rs:375-384 | baml_language/crates/bex_sap/src/deserializer/coercer/coerce_class.rs:390-399 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/deserializer/coercer/coerce_class.rs:375\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":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_class.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca605b7fc5fca44ef61e40d2f1fa5917f70e3f95177232638d90af3adf7f7aef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/coercer/coerce_enum.rs:103-112 | baml_language/crates/bex_sap/src/deserializer/coercer/coerce_enum.rs:192-201 \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":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_enum.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0e9625a5d69bae32736b25a056889b5b75635cf5e22c7fecb11bc49f6c9e8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs:143-152 | engine/baml-lib/jsonish/src/deserializer/deserialize_flags.rs:158-167 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs\u0060 and \u0060engine/baml-lib/jsonish/src/deserializer/deserialize_flags.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 127 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs:143\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs:153\u0060 calls \u0060DefaultFromInProgress\u0060 and \u0060engine/baml-lib/jsonish/src/deserializer/deserialize_flags.rs:168\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":"baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"317c0dc8d988a9bb3fb51acc0a056c10d157846414af43a1e97caab05f8dab9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/bex_vm/src/package_baml/array.rs:1029-1038 | baml_language/crates/bex_vm/src/package_baml/array.rs:1057-1066 \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 \u0060baml_language/crates/bex_vm/src/package_baml/array.rs:1029\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/crates/bex_vm/src/package_baml/array.rs:1028\u0060 calls \u0060map_result_element_ty\u0060 and \u0060baml_language/crates/bex_vm/src/package_baml/array.rs:1056\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/array.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"513ce600e4a350df9bbfe51941d30eec893230f450e2697c4ca86d3bf0b091ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/bex_vm/src/package_baml/root.rs:851-860 | baml_language/crates/bex_vm/src/package_baml/root.rs:883-892 \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 \u0060baml_language/crates/bex_vm/src/package_baml/root.rs:851\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":"baml_language/crates/bex_vm/src/package_baml/root.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d77d7c81907ebb133b9d8726e06004f685b5724335d4dfc7373fd2c2ab9c81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/bex_vm/src/package_baml/time.rs:298-307 | baml_language/crates/bex_vm/src/package_baml/time.rs:522-531 \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":"baml_language/crates/bex_vm/src/package_baml/time.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e18d29d3ff27276cfc3ea1e4edc22b690d8e0d28d67a4ce79ae9347664b6b5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/bex_vm/src/package_reflect/type_class.rs:1260-1269 | baml_language/crates/bex_vm/src/package_reflect/type_class.rs:1298-1307 \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 \u0060baml_language/crates/bex_vm/src/package_reflect/type_class.rs:1260\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":"baml_language/crates/bex_vm/src/package_reflect/type_class.rs"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca698ffef87f55ef06d7b9ba76c44bf6c39ce4438a5b49b2cd4c045a68744d61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/bex_vm/src/vm.rs:11012-11021 | baml_language/crates/bex_vm/src/vm.rs:11027-11036 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/crates/bex_vm/src/vm.rs:11026\u0060 calls \u0060read_u32_unchecked\u0060 and \u0060baml_language/crates/bex_vm/src/vm.rs:11011\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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":11012}}}],"partialFingerprints":{"codehealthFindingId/v1":"569dfb04bab019b21849fa19592e1a68f1c8b8867c6507926b065fcc8fe6ad68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/bridge_ctypes/src/value_decode.rs:655-664 | baml_language/crates/bridge_ctypes/src/value_decode.rs:689-698 \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 \u0060baml_language/crates/bridge_ctypes/src/value_decode.rs:655\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/crates/bridge_ctypes/src/value_decode.rs:700\u0060 calls \u0060to_string\u0060 and \u0060baml_language/crates/bridge_ctypes/src/value_decode.rs:666\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":"baml_language/crates/bridge_ctypes/src/value_decode.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b75ac67d44d357a1090141a685f31deea18bec1dbe1c0ba80c1cae84695e3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/bridge_encode/src/plan.rs:996-1005 | baml_language/crates/bridge_encode/src/plan.rs:1035-1044 \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 \u0060baml_language/crates/bridge_encode/src/plan.rs:996\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":"baml_language/crates/bridge_encode/src/plan.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"be03826e7bbbdb2e5a33fc77794bf9b118ac81a0e229732eed3b35a82a4ecfa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): baml_language/crates/btel_reader/src/value/span.rs:117-125 | baml_language/crates/btel_snapshot/src/decode.rs:1398-1407 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_reader/src/value/span.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fde3b5499d33599deae7077d147e11e353310f8fa67a04e62c1403b7948bda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/tools_size_gate/src/compare.rs:131-140 | baml_language/crates/tools_size_gate/src/output.rs:393-402 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/tools_size_gate/src/compare.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3051e4397a7d304a5f6483711d0d4c838e3c4419165ff99fef0585e3f54f1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/tools_stow/src/main.rs:709-718 | baml_language/crates/tools_stow/src/main.rs:721-730 \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 \u0060baml_language/crates/tools_stow/src/main.rs:709\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":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfa09eaeaa0e35152ee3aedd8e397d1cd555cf260522a5a7e84cc1a622a229f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:4018-4027 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:4135-4144 \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 \u0060baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:4018\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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":4018}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec7f98ac8f836b4296baa755862d9ecf349632a75bb90303e430b44689b4b41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/sdks/go/sdkgen_go/src/lib.rs:1372-1381 | baml_language/sdks/go/sdkgen_go/src/lib.rs:1460-1469 \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 \u0060baml_language/sdks/go/sdkgen_go/src/lib.rs:1372\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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fa33f321104bcb8e67ff5c2f930d319df5b2fab865c0a6b505f447ac198ec7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/sdks/go/sdkgen_go/src/lib.rs:2611-2620 | baml_language/sdks/go/sdkgen_go/src/lib.rs:2690-2699 \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 \u0060baml_language/sdks/go/sdkgen_go/src/lib.rs:2611\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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":2611}}}],"partialFingerprints":{"codehealthFindingId/v1":"53906e5022cfa2002c492126f36a8ae046f2d496637313005530f653711a7c02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/names.rs:718-727 | baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/routing.rs:63-72 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/names.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf9e77f75789193a868d5ee8a6d81109c3d02b61455eea75e22b5b0366d2ca7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/sdks/rust/bridge_rust/src/outbound.rs:53-62 | baml_language/sdks/rust/bridge_rust/src/outbound.rs:144-153 \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":"baml_language/sdks/rust/bridge_rust/src/outbound.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"830995852417004a5154a902a65a839c06bb3ef5ea764759bfa33d5136c3c174"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): engine/baml-compiler/src/thir/typecheck.rs:1503-1511 | engine/baml-compiler/src/thir/typecheck.rs:1517-1526 \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 \u0060engine/baml-compiler/src/thir/typecheck.rs:1503\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":"engine/baml-compiler/src/thir/typecheck.rs"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"92788bc435aab4cee1d83d18b073cc1fbd887d4876edca7723f8d99ed7435a90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/baml-lib/ast/src/parser/parse_expression.rs:565-574 | engine/baml-runtime/src/cli/dotenv/mod.rs:146-155 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/ast/src/parser/parse_expression.rs:565\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":"engine/baml-lib/ast/src/parser/parse_expression.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"0258d2f5365c25f963e5dfeef8c470effd795b0a3f0ddc7538f9564e0275870b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs:518-527 | engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs:563-572 \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":"engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d9a1ea238e758d73a7f55f1f784082b4fb08b72f3fbe5d1411cdf47aa3c922"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/baml-lib/baml-core/src/lib.rs:253-262 | engine/baml-lib/baml-core/src/lib.rs:278-287 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/lib.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d94fe53e6b0d4b799e33b9ab7eab58fe9391860f9314fa07612b93988d1e0bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/baml-lib/jsonish/src/helpers/mod.rs:178-187 | engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs:312-321 \u2014 before extracting anything, compare \u0060engine/baml-lib/jsonish/src/helpers/mod.rs\u0060 and \u0060engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/helpers/mod.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6c25115158cee1fa0fa24395abbeaabc5fca16856064eac43197cd0cd5b221"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/baml-lib/llm-client/src/clients/anthropic.rs:42-51 | engine/baml-lib/llm-client/src/clients/openai.rs:41-50 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/llm-client/src/clients/anthropic.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab6004590ff05582503c8d7e62ca70e8406a02926d1a74f5b840553874af960"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:283-292 | engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs:245-254 \u2014 before extracting anything, compare \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs\u0060 and \u0060engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b9d42adb6d1457b50df963f03ebd35de1665670634234fed5b7a4349179c5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:299-308 | engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs:261-270 \u2014 before extracting anything, compare \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs\u0060 and \u0060engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbb093a19cdf84ca2797820046e5f62bbef30bae75667af82d6df6aebf36618"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/google/response_handler.rs:56-65 | engine/baml-runtime/src/internal/llm_client/primitive/vertex/response_handler.rs:55-64 \u2014 \u0060engine/baml-runtime/src/internal/llm_client/primitive/google/response_handler.rs\u0060 and \u0060engine/baml-runtime/src/internal/llm_client/primitive/vertex/response_handler.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 6 separate duplicated blocks between them, totalling at least 53 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/internal/llm_client/primitive/google/response_handler.rs:56\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":"engine/baml-runtime/src/internal/llm_client/primitive/google/response_handler.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e7ee73c1bb430f6dcb7c6e7c0d14ee9c046020c752f9d924ec008960d1f686"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs:294-303 | engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs:397-406 \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":"engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"c849f6b490e53de04da2187c8ddd27f67abacc1e8396121d4e32e8993fd8af61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/baml-vm/src/native.rs:83-92 | engine/baml-vm/src/native.rs:100-109 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-vm/src/native.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e814563862ed3e6e55fcda345632b625803f6d438e45af06ae9308ff3cbb86ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/generators/languages/go/src/ir_to_go/mod.rs:207-216 | engine/generators/languages/rust/src/ir_to_rust/mod.rs:229-238 \u2014 before extracting anything, compare \u0060engine/generators/languages/go/src/ir_to_go/mod.rs\u0060 and \u0060engine/generators/languages/rust/src/ir_to_rust/mod.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 208 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/generators/languages/go/src/ir_to_go/mod.rs:207\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":"engine/generators/languages/go/src/ir_to_go/mod.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f40a9b4ea482b6dc64d34b07490934d49112607a8597831fa32403615072c21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/generators/languages/ruby/src/ir_to_rb/mod.rs:52-61 | engine/generators/languages/ruby/src/ir_to_rb/mod.rs:163-172 \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 \u0060engine/generators/languages/ruby/src/ir_to_rb/mod.rs:52\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":"engine/generators/languages/ruby/src/ir_to_rb/mod.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9121846c097a61aa2cb63639a34f43e1084d15002c962ce1e2d200ae40daacb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): engine/generators/languages/typescript/src/ir_to_ts/mod.rs:127-134 | engine/generators/languages/typescript/src/ir_to_ts/mod.rs:241-250 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"engine/generators/languages/typescript/src/ir_to_ts/mod.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ee45fc871ef2194d923041e2c47948ee02df6ae1842143f8bb615e70909e63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): engine/language_server/src/baml_project/mod.rs:1170-1179 | engine/language_server/src/baml_project/mod.rs:1233-1240 \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":"engine/language_server/src/baml_project/mod.rs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"635019fd32c75aa2ef153d91e6ffd8cd5c8f75ab2811b940f84166fc14c5ed3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): languages/rust/baml-macros/src/encode.rs:161-170 | languages/rust/baml-macros/src/encode.rs:174-183 \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 \u0060languages/rust/baml-macros/src/encode.rs:161\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":"languages/rust/baml-macros/src/encode.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c4ff81449f75aabda05fe68e733a9b8acfcb99b4ffda2c259d693c4bf206db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): languages/rust/baml-macros/src/encode.rs:218-227 | languages/rust/baml-macros/src/encode.rs:236-245 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060languages/rust/baml-macros/src/encode.rs:218\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060languages/rust/baml-macros/src/encode.rs:216\u0060 calls \u0060is_empty\u0060 and \u0060languages/rust/baml-macros/src/encode.rs:235\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":"languages/rust/baml-macros/src/encode.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70c8be47a88246276d18d969507d4f39b72aee093357bfb8d817c1da827061b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 14): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1490-1498 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1503-1511 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1516-1524 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1530-1538 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1544-1553 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1559-1567 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1572-1580 | engine/language_server/src/baml_project/mod.rs:890-898 | engine/language_server/src/baml_project/mod.rs:903-911 | engine/language_server/src/baml_project/mod.rs:916-924 | engine/language_server/src/baml_project/mod.rs:930-938 | engine/language_server/src/baml_project/mod.rs:944-953 | engine/language_server/src/baml_project/mod.rs:959-967 | engine/language_server/src/baml_project/mod.rs:972-980 \u2014 before extracting anything, compare \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs\u0060 and \u0060engine/language_server/src/baml_project/mod.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 183 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1490\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75612446b9c10d824659f23892649fe65e13bccbb68f67141d6a25f3dcb2fff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 6): baml_language/crates/bex_vm/src/vm.rs:7978-7986 | baml_language/crates/bex_vm/src/vm.rs:9728-9735 | baml_language/crates/bex_vm/src/vm.rs:9757-9765 | baml_language/crates/bex_vm/src/vm.rs:9799-9806 | baml_language/crates/bex_vm/src/vm.rs:9833-9840 | baml_language/crates/bex_vm/src/vm.rs:9857-9864 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_vm/src/vm.rs:7978\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/crates/bex_vm/src/vm.rs:9755\u0060 calls \u0060ensure_pop\u0060 and \u0060baml_language/crates/bex_vm/src/vm.rs:9726\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":7978}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4242861fc163ffee15f72132a191571abb5d43fb9244dcde090997c7ed05a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:321-329 | baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:394-402 | baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:472-480 | baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:532-540 \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 \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:321\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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4a8af346a83ff16a936ad02b532a387867c0348b5ec888277bd5cc0f7fd118"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): baml_language/crates/baml_db/src/check.rs:557-567 | baml_language/crates/baml_db/src/check.rs:702-710 | baml_language/crates/baml_db/src/check.rs:825-833 | baml_language/crates/baml_db/src/check.rs:856-864 \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 \u0060baml_language/crates/baml_db/src/check.rs:557\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":"baml_language/crates/baml_db/src/check.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f670cc75e07da7a3119b6bd7131f709c44920b3880d4260cbebae55bc51b94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 4): baml_language/crates/baml_fmt/src/ast/attributes.rs:182-190 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1522-1529 | baml_language/crates/baml_fmt/src/ast/expressions.rs:2425-2432 | baml_language/crates/baml_fmt/src/ast/types.rs:524-531 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_fmt/src/ast/attributes.rs\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 162 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_fmt/src/ast/attributes.rs:182\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs:2434\u0060 calls \u0060print_str\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/attributes.rs:191\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":"baml_language/crates/baml_fmt/src/ast/attributes.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1a883a199ceab848115f2862ecc43e7cf435cc20c285a8d166229d7112dc03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:193-201 | baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:374-382 | baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:495-503 | baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:605-613 \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 \u0060baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:193\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":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0cb5ae96d8f24279a870fe0cf8de410ecd6a3ecf6566ca1535dfe7a4c1612b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 4): engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:134-141 | engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs:471-479 | engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs:166-174 | engine/baml-runtime/src/internal/llm_client/primitive/vertex/vertex_client.rs:190-198 \u2014 before extracting anything, compare \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs\u0060 and \u0060engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:134\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":"engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"700770876388617fe7dc62dc986a965d1331f66d0e8c3add51eb7c60a095331c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): baml_language/crates/baml_compiler2_mir/src/lower.rs:3905-3912 | baml_language/crates/baml_compiler2_mir/src/lower.rs:8886-8893 | baml_language/crates/baml_compiler2_mir/src/lower.rs:9624-9632 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:3905\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":3905}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6b7fab47d9d970bf0a9186e22b12bf30e822ebbc1235211b3e6034ebb2b41e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): baml_language/crates/bex_vm/src/vm.rs:9565-9573 | baml_language/crates/bex_vm/src/vm.rs:9579-9587 | baml_language/crates/bex_vm/src/vm.rs:9594-9601 \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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":9565}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1eeed9e9c03f91f5a8629341c08e8a8ada67591343e40ec285a3772a5d23f37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): engine/baml-lib/baml-types/src/expr.rs:170-178 | engine/baml-lib/baml-types/src/expr.rs:193-201 | engine/baml-lib/baml-types/src/expr.rs:216-224 \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 \u0060engine/baml-lib/baml-types/src/expr.rs:170\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":"engine/baml-lib/baml-types/src/expr.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6402baceb1da82e9989af16071d3d89e17d8725742394185e30d1266c408e3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): engine/baml-vm/src/vm.rs:1034-1042 | engine/baml-vm/src/vm.rs:1052-1060 | engine/baml-vm/src/vm.rs:1076-1084 \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 \u0060engine/baml-vm/src/vm.rs:1034\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":"engine/baml-vm/src/vm.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c443d81f635c28a9825f88d6806b3bbadc2839b9dd2819b1b41405ffb5c959"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): engine/cli/src/commands.rs:149-157 | engine/cli/src/commands.rs:159-167 | engine/cli/src/commands.rs:186-194 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/cli/src/commands.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"56aa77f2e944679f22ef2cfc0ca87639db88ff7a8e369e32b1c08050aab8a7b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:249-257 | baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:637-645 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:249\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":"baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6eb404deffe0a6c80dc56bf4cea1af8b7c761602a9c8d9b53bfbe55fb05b4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1447-1455 | baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1761-1769 \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 \u0060baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1447\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":"baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b00358cfd41989c35e7711aca0b9321862a6047100222f78832a41aedd8731"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1653-1661 | baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1966-1972 \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 \u0060baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1653\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":"baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc046abbb0893ab26eb21c3293883c0e5f28ac94499e3f1d6190da41a30e8ca7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/baml_cli/src/commands.rs:271-279 | engine/cli/src/commands.rs:100-108 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/commands.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"877c9f8f9158e50b735d19f937c076a987a663570d20c2d7f9d36a30ba412bda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): baml_language/crates/baml_cli/src/run_command.rs:856-863 | baml_language/crates/baml_cli/src/run_command.rs:884-892 \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":"baml_language/crates/baml_cli/src/run_command.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b28445c4f5eb6b6c4f68d10f04da3f5444b7b9f0583604a35214cbd8cfc2c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/baml_compiler2_emit/src/lib.rs:1163-1173 | baml_language/crates/baml_compiler2_emit/src/package/bodies.rs:88-96 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_emit/src/lib.rs:1163\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. 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":"baml_language/crates/baml_compiler2_emit/src/lib.rs"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd7ae4a1af112122ebcaebb4db5cffbe7e7ae12734af6f91ddafac5bdea7ab3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:433-444 | baml_language/crates/baml_type/src/unify.rs:777-788 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs\u0060 and \u0060baml_language/crates/baml_type/src/unify.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 452 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cce5f2403241bbf659e8514ae14834090d1cd1eaa74b911e6722f5a68d41715"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:604-612 | baml_language/crates/baml_type/src/unify.rs:1123-1131 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs\u0060 and \u0060baml_language/crates/baml_type/src/unify.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 452 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a6b54c529e61199fab88e3f20f77ea8577daca87018945b937472e4b5b13bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:5421-5429 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:5440-5448 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:5421\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":5421}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8f1252ac42a899d3be0ece96427eb8bdd59aaf8a5dc4fa33072ab116555f9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:7010-7018 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:10162-10170 \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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":7010}}}],"partialFingerprints":{"codehealthFindingId/v1":"4273cdfa2ee9441b4967946b1284c3c7d3ab7086359d4b85fb749f3eef5dc82b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:7067-7076 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:10143-10151 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:7067\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":7067}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd047dccd8cdb0dfd0ed88c3794752afbdbcd66d61feb7aaa439897e90008632"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:1146-1153 | baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:1544-1552 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:1146\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":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"a729b10da00b72af8a56dd2afaa6395a340baf7d4928be1c7a6243eaec2df76e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:1962-1970 | baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:2048-2056 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:1962\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":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs"},"region":{"startLine":1962}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8a3ecb9a58f70ab35af7a9370b10727bfab795ffe3b99b7f763e652b64e017"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:1264-1273 | baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:1404-1412 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:1264\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":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b7c92b1fbcc03da777717355a2cbb743dbff09d848560f1e9927b44fdc3c8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:2369-2377 | baml_language/crates/baml_compiler2_mir/src/lower.rs:12192-12200 \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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":2369}}}],"partialFingerprints":{"codehealthFindingId/v1":"723827fbd4fedec65255b63f8d51d7b89156665eced54488b62eff7f8d5c0090"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:9410-9418 | baml_language/crates/baml_compiler2_mir/src/lower.rs:9449-9456 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:9410\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":9410}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9151f44958dc3a8773a49413281c90829bc04246ddd913d7efc664889562285"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:12501-12510 | baml_language/crates/baml_compiler2_mir/src/lower.rs:12618-12627 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:12501\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":12501}}}],"partialFingerprints":{"codehealthFindingId/v1":"237ee1de5c802416956665c27a3d9db8a207f4043f09bd861b361b7a18e62d13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:14435-14443 | baml_language/crates/baml_compiler2_mir/src/lower.rs:14609-14617 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:14435\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":14435}}}],"partialFingerprints":{"codehealthFindingId/v1":"e250b02f3da66869e88d730a2adee07200d38934fe3372d103aea9643d1d43b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/declarations.rs:692-700 | baml_language/crates/baml_fmt/src/ast/expressions.rs:2078-2086 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_fmt/src/ast/declarations.rs\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/declarations.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d5304e5e0ef8000144ddfaf2bc26f2a44189d3573a93a95d42edee23b05e4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/expressions.rs:852-860 | baml_language/crates/baml_fmt/src/ast/statements.rs:265-273 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/statements.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0caddceb5db2aa960fa52f6be31b2c0e946ffbdcc558a1f8549cf4c8d422bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/expressions.rs:2191-2199 | baml_language/crates/baml_fmt/src/ast/expressions.rs:2475-2483 \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 \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs:2191\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":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":2191}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a678c926eb61cf86d60d676911db14bff186a9922b554d200618571b52d246"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/baml_query_btel/src/ingest.rs:1132-1140 | baml_language/crates/baml_query_btel/src/ingest/bulk.rs:627-635 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_query_btel/src/ingest.rs:1132\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060super) fn apply(\u0026mut\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":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1c370374891c0a50aa665c9b44351571c0691acaa8044098358ea1166460cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/baml_sdkgen_types/src/output_writer.rs:604-612 | baml_language/crates/baml_sdkgen_types/src/output_writer.rs:1528-1536 \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 \u0060baml_language/crates/baml_sdkgen_types/src/output_writer.rs:604\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":"baml_language/crates/baml_sdkgen_types/src/output_writer.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92fa2e261c158e06094c82efccc9a6d17e7cba47fa43fb4bee25c2cac24848b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/baml_type_macros/src/convert.rs:215-227 | baml_language/crates/baml_type_macros/src/convert.rs:1002-1010 \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 \u0060baml_language/crates/baml_type_macros/src/convert.rs:215\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":"baml_language/crates/baml_type_macros/src/convert.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ad7415c3b5e8bfc0bfe65ef177edf2ea6cf78ba5c5b96e305c083fa5d6656b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/baml_type_macros/src/convert.rs:412-420 | baml_language/crates/baml_type_macros/src/convert.rs:769-777 \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 \u0060baml_language/crates/baml_type_macros/src/convert.rs:412\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":"baml_language/crates/baml_type_macros/src/convert.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"e805f10a581eb405f836fc6bada340fa75194c3123781991d12f2a48ea1ec387"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_type_macros/src/convert.rs:717-726 | baml_language/crates/baml_type_macros/src/convert.rs:1022-1031 \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 \u0060baml_language/crates/baml_type_macros/src/convert.rs:717\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":"baml_language/crates/baml_type_macros/src/convert.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d949bcac846dd36db5d3843c18904ec660fcc2f580776c9d261704b10d56d84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/bex_engine/src/lib.rs:7890-7898 | baml_language/crates/bex_engine/src/lib.rs:7912-7920 \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 \u0060baml_language/crates/bex_engine/src/lib.rs:7890\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":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":7890}}}],"partialFingerprints":{"codehealthFindingId/v1":"d063208d3ea6845722857daf6534e12077b6e8dbb5761b32635f418abb609d5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/coercer/coerce_class.rs:237-245 | baml_language/crates/bex_sap/src/deserializer/coercer/coerce_class.rs:305-313 \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":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_class.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"b246fa9379873893e25b5dde446a8abc84bae39611407030083b409a2114ecc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:158-166 | baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:348-356 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:158\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c4c814a5fb1d9cd45d899c606f614bc0bddacc44b0c6779a9c44e21494c17c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs:85-93 | baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs:96-104 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs:85\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":"baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"689d8608669e5d098de61e98032633e82ad733fd0a985a27e18640fb946addcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/score.rs:24-32 | engine/baml-lib/jsonish/src/deserializer/score.rs:44-52 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/crates/bex_sap/src/deserializer/score.rs:23\u0060 calls \u0060OptionalFieldError\u0060 and \u0060engine/baml-lib/jsonish/src/deserializer/score.rs:43\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/score.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcee3ee8ec887f986ad00b19931e1ac80468c3f1350daa7c3b21ade9390db65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/score.rs:35-43 | engine/baml-lib/jsonish/src/deserializer/score.rs:54-61 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/deserializer/score.rs:35\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/deserializer/score.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f383e6640df4a98da5e87891695a455a6991800d7a170081ff093064560de6ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/entry.rs:113-120 | engine/baml-lib/jsonish/src/jsonish/parser/entry.rs:121-129 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/entry.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/entry.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/entry.rs:113\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":"baml_language/crates/bex_sap/src/jsonish/parser/entry.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1176ddc01e5dad3133cbe0177d4fa2ddbba1f1765fcb0a18dbbbfac302e8722c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/entry.rs:136-144 | engine/baml-lib/jsonish/src/jsonish/parser/entry.rs:145-153 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/entry.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/entry.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/entry.rs:136\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/entry.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e1626631779f12d823920f524a5646fcb4a34bf65ffc31a066c0b4582ebd1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:384-392 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:411-419 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 586 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:384\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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15699f5189d77ac89a5c32e8beadd88013989ef0f09d7864a51b622b17d1e79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/bex_vm/src/package_baml/csv.rs:2628-2636 | baml_language/crates/bex_vm/src/package_baml/csv.rs:2655-2663 \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":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":2628}}}],"partialFingerprints":{"codehealthFindingId/v1":"5daf6532ab122652309ac91ab0e1896786f1e31ab9d5584291a9e1c849c76001"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): baml_language/crates/bex_vm/src/reachable.rs:63-71 | baml_language/crates/bex_vm/src/reachable.rs:135-142 \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 \u0060baml_language/crates/bex_vm/src/reachable.rs:63\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":"baml_language/crates/bex_vm/src/reachable.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"930a410dae7dbb15b7c729e0b51d1a69cd579911bfd400a156345e24c4ac3332"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/bex_vm/src/vm.rs:7058-7066 | baml_language/crates/bex_vm/src/vm.rs:7072-7080 \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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":7058}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c73b51fddfa4728e7ddd90a1239b807e5290c20b5aa4baa8245c150f748621b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/bex_vm/src/vm.rs:8984-8992 | baml_language/crates/bex_vm/src/vm.rs:9154-9162 \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 \u0060baml_language/crates/bex_vm/src/vm.rs:8984\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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":8984}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb99cdf2619044f6f9ade4586222b886c24003718782c417599aaeaa3def128"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/bex_vm/src/vm.rs:9424-9432 | baml_language/crates/bex_vm/src/vm.rs:9449-9457 \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 \u0060baml_language/crates/bex_vm/src/vm.rs:9424\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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":9424}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ef0dcd9ba95a1a148d69d90f72b54f642cf6482a9db46f4b8378f49958c629"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): baml_language/crates/bridge_wasm/src/wasm_http.rs:740-746 | baml_language/crates/sys_native/src/io_impls.rs:3471-3479 \u2014 before extracting anything, compare \u0060baml_language/crates/bridge_wasm/src/wasm_http.rs\u0060 and \u0060baml_language/crates/sys_native/src/io_impls.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"baml_language/crates/bridge_wasm/src/wasm_http.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b45cbf745b28e4e69b8864bbd6caadc2a6234aa0806f10421691a15b55985d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/btel_snapshot/src/encoding.rs:228-236 | baml_language/crates/btel_snapshot/src/shape.rs:643-651 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/btel_snapshot/src/encoding.rs:228\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_snapshot/src/encoding.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"016151ce9dad8edd7d6dcdeb256ef2b5831621b6af28b9f8cfff1b38026a35de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/sys_native/src/io_impls.rs:1897-1905 | baml_language/crates/sys_native/src/io_impls.rs:2154-2162 \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 \u0060baml_language/crates/sys_native/src/io_impls.rs:1897\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":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":1897}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae17cb1e23dfe83c7afc1f82971612dd61f113267d56217266031919395eacbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/tools_size_gate/src/output.rs:111-119 | baml_language/crates/tools_size_gate/src/output.rs:178-186 \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 \u0060baml_language/crates/tools_size_gate/src/output.rs:111\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":"baml_language/crates/tools_size_gate/src/output.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"523ad63ca1753740b53fa9062e96914db6fd35e775a4820a5efa6ce51c9fcccc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/forks/aws-config-systest/src/main.rs:56-64 | baml_language/forks/aws-config-systest/src/main.rs:142-150 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/forks/aws-config-systest/src/main.rs:141\u0060 calls \u0060body\u0060, \u0060to_vec\u0060 and \u0060baml_language/forks/aws-config-systest/src/main.rs:55\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/forks/aws-config-systest/src/main.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68cf588d8017565cc93e13f05140d9c760f78ebb45f70c5ec93c6f6c3979fa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:1225-1233 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:1627-1635 \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 \u0060baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:1225\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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"facf6b1ff1848bbd08d2c4badb08405a527d5b2cfd24563cd4132a73a4953641"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:2344-2352 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:2440-2448 \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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":2344}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c6dc08a4c008d5744562a65abd27352fdb3aa0330839b794e4cc2187652696"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/sdks/go/sdkgen_go/src/lib.rs:2656-2664 | baml_language/sdks/go/sdkgen_go/src/lib.rs:2838-2846 \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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":2656}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6794e106533a54a9dadbc5514656264bd3f7724f64cd8d9b6bfea966a37df43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/sdks/java/bridge_java/src/lib.rs:304-312 | baml_language/sdks/python/rust/bridge_python/src/runtime.rs:175-183 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdks/java/bridge_java/src/lib.rs:304\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060args_proto\u0060 to \u0060Vec\u003Cu8\u003E\u0060 in one and \u0060bytes\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":"baml_language/sdks/java/bridge_java/src/lib.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e30536adf7a7c36ac0b31fa5dac174e115541b999c8f9e3ab4dbdb45b94d462"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): baml_language/sdks/java/sdkgen_java/src/lib.rs:188-195 | baml_language/sdks/java/sdkgen_java/src/lib.rs:683-691 \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. 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":"baml_language/sdks/java/sdkgen_java/src/lib.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f95e04316a1456c2ec55acfe29781b137e8608149047b1d985ced68e3606fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20139 lines \u00D7 2): engine/baml-compiler/src/thir.rs:465-469 | engine/baml-lib/baml-types/src/expr.rs:505-513 \u2014 before extracting anything, compare \u0060engine/baml-compiler/src/thir.rs\u0060 and \u0060engine/baml-lib/baml-types/src/expr.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-compiler/src/thir.rs:465\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":"engine/baml-compiler/src/thir.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c489619ac177f29494a8b8022ed8ab0e8fff8c5771cdfeae04cda23924ed82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/functions.rs:34-42 | engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/template_strings.rs:28-36 \u2014 before extracting anything, compare \u0060engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/functions.rs\u0060 and \u0060engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/template_strings.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 102 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/functions.rs:34\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":"engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/functions.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"254079eb7c7a147d03f8026f6482a5397981d0d0e9b10902c757e274d44b9da3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/baml-lib/jsonish/src/deserializer/coercer/array_helper.rs:159-167 | engine/baml-lib/jsonish/src/deserializer/coercer/array_helper.rs:169-177 \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":"engine/baml-lib/jsonish/src/deserializer/coercer/array_helper.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a59711429e18c3c48e0c62d709028abb9a6dfb598139d501506b183abcf601"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/baml-lib/parser-database/src/lib.rs:354-362 | engine/baml-lib/parser-database/src/lib.rs:371-379 \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":"engine/baml-lib/parser-database/src/lib.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b3e6554cb0b0138c7191d711affe65f46eb499b82dc84267ea08ba449e4ffe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): engine/baml-lib/parser-database/src/names/mod.rs:45-52 | engine/baml-lib/parser-database/src/names/mod.rs:66-74 \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 \u0060engine/baml-lib/parser-database/src/names/mod.rs:45\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/parser-database/src/names/mod.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"63996dbb807dea93be2f1a4d946d95d47258fc3ea5946dae06ebabe83c870f12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/baml-runtime/src/control_flow.rs:433-441 | engine/baml-runtime/src/control_flow.rs:444-452 \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":"engine/baml-runtime/src/control_flow.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ad05f98d6b0f9eac2b715c3cdfc039bd540a04bdedbed6580a9ac6e16d8e18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/anthropic/response_handler.rs:126-134 | engine/baml-runtime/src/internal/llm_client/primitive/openai/response_handler.rs:405-413 \u2014 \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/response_handler.rs\u0060 and \u0060engine/baml-runtime/src/internal/llm_client/primitive/openai/response_handler.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 33 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/response_handler.rs:126\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":"engine/baml-runtime/src/internal/llm_client/primitive/anthropic/response_handler.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f5f2950c9b9a98de7c33b0e84894061bc509a78382f7ec51b258abeb522b1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs:279-287 | engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs:371-381 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs:279\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/prompt_renderer/render_output_format.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e2ff005be216407c3cf60e13069c342eddf3b2a15a816dbd031b6577c35982"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/baml-runtime/src/redaction.rs:100-108 | engine/baml-runtime/src/redaction.rs:141-149 \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":"engine/baml-runtime/src/redaction.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"26523a421fd07d9c181595317c985c0e8d58419c0d44a00ad239d995194b1355"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/baml-runtime/src/tracing/mod.rs:1140-1148 | engine/baml-runtime/src/tracing/mod.rs:1164-1172 \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":"engine/baml-runtime/src/tracing/mod.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ad17ac5b02e2c4dc3341cf99ad74adb4ea8da1ebccc0d2a6abea25fcc6e762"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/baml-runtime/src/tracingv2/publisher/rpc_converters/types.rs:38-46 | engine/baml-runtime/src/tracingv2/publisher/rpc_converters/types.rs:89-97 \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 \u0060engine/baml-runtime/src/tracingv2/publisher/rpc_converters/types.rs:38\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":"engine/baml-runtime/src/tracingv2/publisher/rpc_converters/types.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9178c28c30b920fa27748dcdbfb64945a8dfdff92116734d28aea876091bd5a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1689-1697 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1710-1717 \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 \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1689\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. 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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05dbf0faa54294d618fee8d5736ba23eb6d9006d19896b27c536e3d1935a244"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/baml-vm/src/native.rs:46-54 | engine/baml-vm/src/native.rs:87-95 \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 \u0060engine/baml-vm/src/native.rs:46\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":"engine/baml-vm/src/native.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbfc5135daf9e71ab019389c19e0805b87cc32c50e29017fd4faf71e59c448d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/baml-vm/src/vm.rs:783-791 | engine/baml-vm/src/vm.rs:1099-1107 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-vm/src/vm.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1eff45cfa95e2379360e4471a1367a7a5d484d5bde252fdbd1ce281232e06e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/baml_cffi_macros/src/lib.rs:657-665 | engine/baml_cffi_macros/src/lib.rs:955-967 \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 \u0060engine/baml_cffi_macros/src/lib.rs:657\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":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"642809ce028b7abacc80b2f8de9e08a683ac1008f3778263a3af4f3c3fe3a182"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/baml_cffi_macros/src/lib.rs:1189-1197 | engine/baml_cffi_macros/src/lib.rs:1353-1361 \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":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d2258de5594576addd0918fef65f57c9c918e6c832349deea4ff259c14d3b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/generators/languages/go/src/ir_to_go/mod.rs:89-97 | engine/generators/languages/rust/src/ir_to_rust/mod.rs:107-115 \u2014 before extracting anything, compare \u0060engine/generators/languages/go/src/ir_to_go/mod.rs\u0060 and \u0060engine/generators/languages/rust/src/ir_to_rust/mod.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 208 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/generators/languages/go/src/ir_to_go/mod.rs:89\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/go/src/ir_to_go/mod.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"1720fbb3e5781414da82c3237956b5302fb4a2f0340829788c13542847b1ac81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/generators/languages/go/src/ir_to_go/mod.rs:97-105 | engine/generators/languages/go/src/ir_to_go/mod.rs:261-269 \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 \u0060engine/generators/languages/go/src/ir_to_go/mod.rs:97\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/generators/languages/go/src/ir_to_go/mod.rs:107\u0060 calls \u0060make_stream_state\u0060 and \u0060engine/generators/languages/go/src/ir_to_go/mod.rs:270\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":"engine/generators/languages/go/src/ir_to_go/mod.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d652760202670f94314e5b7d4dfb695ee01499b11b16a2c184890638813d68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/generators/languages/rust/src/ir_to_rust/mod.rs:115-123 | engine/generators/languages/rust/src/ir_to_rust/mod.rs:291-299 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/generators/languages/rust/src/ir_to_rust/mod.rs:115\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/generators/languages/rust/src/ir_to_rust/mod.rs:125\u0060 calls \u0060make_stream_state\u0060 and \u0060engine/generators/languages/rust/src/ir_to_rust/mod.rs:300\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":"engine/generators/languages/rust/src/ir_to_rust/mod.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b60dc93cbdc2fbcea9277d3ee0a0f86b11b0ff11c084081dba30d02a7887f6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/language_client_cffi/src/ctypes/object_args_decode.rs:28-37 | engine/language_client_cffi/src/ctypes/object_args_decode.rs:52-61 \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 \u0060engine/language_client_cffi/src/ctypes/object_args_decode.rs:28\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_cffi/src/ctypes/object_args_decode.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5225a1a78b21019cde5d5c687901099e4ae4bfd2aba2e7aa4cb7e35b003a7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/language_client_cffi/src/ffi/objects.rs:94-102 | engine/language_client_cffi/src/ffi/objects.rs:153-161 \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 \u0060engine/language_client_cffi/src/ffi/objects.rs:94\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":"engine/language_client_cffi/src/ffi/objects.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"9077765b7d419e171c8454d160da7d755082d0445c7b591eb9bac79bdc2bfdf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/language_client_ruby/ext/ruby_ffi/src/lib.rs:121-129 | engine/language_client_ruby/ext/ruby_ffi/src/lib.rs:223-231 \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":"engine/language_client_ruby/ext/ruby_ffi/src/lib.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c3a7dc1c36db804cda3968f9f2fb0c01b7a9a0f50c9c810aaf7178013b2a4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/language_server/src/server/api/notifications/did_open.rs:90-98 | engine/language_server/src/server/api/notifications/did_save_text_document.rs:63-83 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/server/api/notifications/did_open.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"251ffbd0c3c8f0853cde5d564291494647dd4f9ce059956153fb53cc1b43bd93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): languages/rust/baml-macros/src/decode.rs:10-18 | languages/rust/baml-macros/src/encode.rs:10-18 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060languages/rust/baml-macros/src/decode.rs:10\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":"languages/rust/baml-macros/src/decode.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"43237512dde642036bef833f92384b5eb8849f67850d227bf0b986fdc0b78189"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 18): baml_language/crates/btel_recorder/src/lib.rs:535-542 | baml_language/crates/btel_recorder/src/lib.rs:560-567 | baml_language/crates/btel_recorder/src/lib.rs:585-592 | baml_language/crates/btel_recorder/src/lib.rs:610-617 | baml_language/crates/btel_recorder/src/lib.rs:635-642 | baml_language/crates/btel_recorder/src/lib.rs:660-667 | baml_language/crates/btel_recorder/src/lib.rs:685-692 | baml_language/crates/btel_recorder/src/lib.rs:710-717 | baml_language/crates/btel_recorder/src/lib.rs:735-742 | baml_language/crates/btel_recorder/src/lib.rs:786-793 | baml_language/crates/btel_recorder/src/lib.rs:836-843 | baml_language/crates/btel_recorder/src/lib.rs:887-894 | baml_language/crates/btel_recorder/src/lib.rs:937-944 | baml_language/crates/btel_recorder/src/lib.rs:962-969 | baml_language/crates/btel_recorder/src/lib.rs:987-994 | baml_language/crates/btel_recorder/src/lib.rs:1012-1019 | baml_language/crates/btel_recorder/src/lib.rs:1037-1044 | baml_language/crates/btel_recorder/src/lib.rs:1088-1095 \u2014 all 18 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 \u0060baml_language/crates/btel_recorder/src/lib.rs:535\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":"baml_language/crates/btel_recorder/src/lib.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff336681054ce010e119ea6188dc016eed0a4be3705f627a4ed5de0f1c25f055"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 7): baml_language/crates/bex_events/src/run.rs:1075-1082 | baml_language/crates/bex_events/src/run.rs:1114-1121 | baml_language/crates/bex_events/src/run.rs:1150-1157 | baml_language/crates/bex_events/src/run.rs:1182-1189 | baml_language/crates/bex_events/src/run.rs:1212-1219 | baml_language/crates/bex_events/src/run.rs:1239-1246 | baml_language/crates/bex_events/src/run.rs:1272-1279 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/crates/bex_events/src/run.rs:1190\u0060 calls \u0060insert\u0060 and \u0060baml_language/crates/bex_events/src/run.rs:1122\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_events/src/run.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aaa7be5f94aea901aa25ba7a85b00b9e62c5e048e39b392b0c88c52f3953f89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): baml_language/crates/btel_recorder/src/lib.rs:761-768 | baml_language/crates/btel_recorder/src/lib.rs:811-818 | baml_language/crates/btel_recorder/src/lib.rs:862-869 | baml_language/crates/btel_recorder/src/lib.rs:912-919 | baml_language/crates/btel_recorder/src/lib.rs:1063-1070 | baml_language/crates/btel_recorder/src/lib.rs:1113-1120 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/btel_recorder/src/lib.rs:761\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":"baml_language/crates/btel_recorder/src/lib.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7fee1185e1e7a227f517a9f0dc134a49347bde776aa9946d05962fb13240312"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): engine/baml-runtime/src/internal/llm_client/primitive/anthropic/response_handler.rs:125-132 | engine/baml-runtime/src/internal/llm_client/primitive/google/response_handler.rs:147-154 | engine/baml-runtime/src/internal/llm_client/primitive/openai/response_handler.rs:404-411 | engine/baml-runtime/src/internal/llm_client/primitive/openai/response_handler.rs:458-465 | engine/baml-runtime/src/internal/llm_client/primitive/vertex/response_handler.rs:145-152 \u2014 \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/response_handler.rs\u0060 and \u0060engine/baml-runtime/src/internal/llm_client/primitive/openai/response_handler.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 33 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/response_handler.rs:125\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":"engine/baml-runtime/src/internal/llm_client/primitive/anthropic/response_handler.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"346c376899991aaee3552e62d2db44b7227abe6d943ad9c3894b52952de77dc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1268-1275 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1360-1367 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1858-1865 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1933-1940 | engine/language_server/src/baml_project/mod.rs:825-832 \u2014 before extracting anything, compare \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs\u0060 and \u0060engine/language_server/src/baml_project/mod.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 183 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1268\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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"981d41c89c85efdba39652a1ac7bd905b9bc36f9872dcbf7f5facc3130f3dd87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): baml_language/crates/baml_compiler2_mir/src/lower.rs:7894-7902 | baml_language/crates/baml_compiler2_mir/src/lower.rs:7943-7950 | baml_language/crates/baml_compiler2_mir/src/lower.rs:8027-8034 | baml_language/crates/baml_compiler2_mir/src/lower.rs:8278-8285 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:7894\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":7894}}}],"partialFingerprints":{"codehealthFindingId/v1":"693000b44671f93ee7b44bf82d343d88ae2cc9cad4e5bab71ca812c575eef24e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): baml_language/crates/bex_vm/src/package_baml/array.rs:1124-1131 | baml_language/crates/bex_vm/src/package_baml/array.rs:1147-1154 | baml_language/crates/bex_vm/src/package_baml/array.rs:1170-1177 | baml_language/crates/bex_vm/src/package_baml/array.rs:1198-1205 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/array.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46dabf741ebb1dbfff3352429d970d4e9107785c16b6f1fc4dbc1130b3f51ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 4): engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:178-184 | engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs:515-522 | engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs:122-128 | engine/baml-runtime/src/internal/llm_client/primitive/vertex/vertex_client.rs:146-152 \u2014 before extracting anything, compare \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs\u0060 and \u0060engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:178\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":"engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda91b1bdb2a1e6f9f0e2820467a89be6b84c1e811f37c137ebf75a3f415013c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): baml_language/crates/baml_compiler2_mir/src/lower.rs:8941-8948 | baml_language/crates/baml_compiler2_mir/src/lower.rs:9022-9028 | baml_language/crates/baml_compiler2_mir/src/lower.rs:9056-9063 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:8941\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":8941}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a0d07f9ffde33b776d3ce097e47ca68b2bed8f06930b6dec052d717613b41d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): baml_language/crates/bex_vm/src/package_reflect/reflect.rs:1187-1194 | baml_language/crates/bex_vm/src/package_reflect/reflect.rs:1848-1855 | baml_language/crates/bex_vm_types/src/types/package.rs:301-308 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_vm/src/package_reflect/reflect.rs:1187\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":"baml_language/crates/bex_vm/src/package_reflect/reflect.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"768ce5b4bd77d613cfe635606610e0c0a70e2075c23a8b55226ab1d602d52ea2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): baml_language/crates/bex_vm/src/vm.rs:7059-7066 | baml_language/crates/bex_vm/src/vm.rs:7073-7080 | baml_language/crates/bex_vm/src/vm.rs:7087-7094 \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 \u0060baml_language/crates/bex_vm/src/vm.rs:7059\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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":7059}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07275eeb65f6183a86512628fc1b9739986695df67165cb97ee2f483bd567e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): baml_language/crates/bex_vm/src/vm.rs:9593-9600 | baml_language/crates/bex_vm/src/vm.rs:9646-9653 | baml_language/crates/bex_vm/src/vm.rs:9663-9670 \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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":9593}}}],"partialFingerprints":{"codehealthFindingId/v1":"17832f01403b738c210568a9c27d988a5ce7dbe04aaecfe5dd7816c729d8565a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): baml_language/crates/bex_vm/src/vm.rs:10010-10017 | baml_language/crates/bex_vm/src/vm.rs:10960-10967 | baml_language/crates/bex_vm/src/vm.rs:11051-11058 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/crates/bex_vm/src/vm.rs:10959\u0060 calls \u0060read_i32_unchecked\u0060 and \u0060baml_language/crates/bex_vm/src/vm.rs:11050\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":10010}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf540a749f181f3e7b0508deaec4dc002c7051cab960f799ab746903dbab65e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): engine/baml-lib/baml-types/src/baml_value.rs:518-525 | engine/baml-lib/baml-types/src/baml_value.rs:655-662 | engine/baml-lib/baml-types/src/baml_value.rs:792-799 \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 \u0060engine/baml-lib/baml-types/src/baml_value.rs:518\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":"engine/baml-lib/baml-types/src/baml_value.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd7b40d0afd6c702bf6f3eb7b753c8995894b9a16c777d60c473d06f581eaea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): engine/baml-lib/baml-types/src/expr.rs:160-167 | engine/baml-lib/baml-types/src/expr.rs:183-190 | engine/baml-lib/baml-types/src/expr.rs:206-213 \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":"engine/baml-lib/baml-types/src/expr.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3d90872642b49680fab71c62b9a284268bb30624eaaab22f96146ca6326773"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): engine/baml-runtime/src/cli/repl.rs:288-295 | engine/baml-runtime/src/cli/repl.rs:481-493 | engine/baml-runtime/src/cli/repl.rs:644-656 \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":"engine/baml-runtime/src/cli/repl.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdaa063fc492ab9248ba676f79f70a04616796b71ba361cda3b728c5ce9e36f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): engine/baml-runtime/src/optimize/applier.rs:368-375 | engine/baml-runtime/src/optimize/applier.rs:411-418 | engine/baml-runtime/src/optimize/applier.rs:508-515 \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 \u0060engine/baml-runtime/src/optimize/applier.rs:368\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":"engine/baml-runtime/src/optimize/applier.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"355c7010f142428bdb72ff2070fb9e585b62408dab410fc601d43ecd16450997"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): languages/rust/baml/src/runtime.rs:83-90 | languages/rust/baml/src/runtime.rs:352-359 | languages/rust/baml/src/runtime.rs:452-459 \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 \u0060languages/rust/baml/src/runtime.rs:83\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":"languages/rust/baml/src/runtime.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2494969ae8feb40af4a6695c35522260dc980c054119d92863b0e6c52be9297"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:2473-2480 | baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:2613-2620 \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 \u0060baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:2473\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":"baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs"},"region":{"startLine":2473}}}],"partialFingerprints":{"codehealthFindingId/v1":"3329955ebf0751afb5fbae4247a0acd5dfc4b096eb873e4770966be4d71dada0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_compiler2_ast/src/ast.rs:365-372 | baml_language/crates/baml_compiler2_hir/src/type_ref.rs:272-279 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_ast/src/ast.rs:365\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":"baml_language/crates/baml_compiler2_ast/src/ast.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a27553898e915e63a4f680e35555b7c58e65ed269f66e058e08234bedaa342"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:925-932 | baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:1032-1039 \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 \u0060baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:925\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":"baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"e116574893f0cd1e0db65a82815bd8cc8f252956d72f52fd25656feb6d232b19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs:202-209 | baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs:1620-1627 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"6151526046b314c7f47334dbc537a03d7fd868f53e04d6a894affb4cb39ff4c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs:781-788 | baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs:1347-1354 \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 \u0060baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs:781\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"206f7bd235718846135297d32de608b41a3044f3ff406c201a2dc4e35ae70055"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_compiler2_ast/src/traverse.rs:241-250 | baml_language/crates/baml_compiler2_metrics/src/calls.rs:79-88 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_ast/src/traverse.rs:241\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":"baml_language/crates/baml_compiler2_ast/src/traverse.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a77b7458383aee3abaebaaf4a7a3a1ade9c5234e1a54594652b72fc3adda57c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_compiler2_emit/src/emit.rs:945-952 | baml_language/crates/baml_compiler2_emit/src/items.rs:1024-1031 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/emit.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd95e4b4280dfcc757dcf4a73167d9d239fc0856adf3457f2b646bf9a84a9099"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_compiler2_emit/src/emit.rs:1435-1442 | baml_language/crates/baml_compiler2_emit/src/emit.rs:1955-1962 \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":"baml_language/crates/baml_compiler2_emit/src/emit.rs"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"016fabea58a0c2d287e06bc5c1f4b859e7797d6e190c3cb38c8934a3db547c70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_compiler2_emit/src/emit.rs:1898-1905 | baml_language/crates/baml_compiler2_emit/src/emit.rs:1932-1939 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/crates/baml_compiler2_emit/src/emit.rs:1930\u0060 calls \u0060emit_operand_pull\u0060 and \u0060baml_language/crates/baml_compiler2_emit/src/emit.rs:1896\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":"baml_language/crates/baml_compiler2_emit/src/emit.rs"},"region":{"startLine":1898}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e299ba27f18372ac0493fe400a4434fafe86b8d58187fcd760e46f8c48f7d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_compiler2_emit/src/items.rs:306-313 | baml_language/crates/baml_compiler2_hir_ty/src/method_resolution.rs:1056-1063 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_emit/src/items.rs:306\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":"baml_language/crates/baml_compiler2_emit/src/items.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"c130d335db49c4cadc73528d077b68f74361c5ef56011a6d4778c6e83f2125c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_compiler2_hir/src/contributions.rs:99-106 | baml_language/crates/baml_ide/src/search.rs:483-490 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_hir/src/contributions.rs:99\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":"baml_language/crates/baml_compiler2_hir/src/contributions.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7fe4003d585cc6cc494ad70c32a2d1778dd39ba8c5c707f6909609abf2476b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): baml_language/crates/baml_compiler2_hir/src/item_data/functions.rs:387-393 | baml_language/crates/baml_compiler2_hir/src/item_data/impls.rs:102-109 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_hir/src/item_data/functions.rs:387\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":"baml_language/crates/baml_compiler2_hir/src/item_data/functions.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ea5adb649fa14d2412996f3ae1d8434d31bdd089cedc7579f500067ff0897f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_compiler2_hir/src/item_tree/builder.rs:58-65 | baml_language/crates/baml_compiler2_hir/src/item_tree/builder.rs:258-265 \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 \u0060baml_language/crates/baml_compiler2_hir/src/item_tree/builder.rs:58\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":"baml_language/crates/baml_compiler2_hir/src/item_tree/builder.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9f3486d6f75a792e3e329a9c5f896cd90f46879f42365f86f794d713b48aca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:410-420 | baml_language/crates/baml_type/src/unify.rs:753-763 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs\u0060 and \u0060baml_language/crates/baml_type/src/unify.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 452 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c8da4b0fe3a67ab327c72be2c594744aac4ba99b8203a0e88cbbbaeb733fcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/exhaustiveness.rs:720-727 | baml_language/crates/baml_compiler2_hir_ty/src/exhaustiveness.rs:734-741 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/exhaustiveness.rs:720\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":"baml_language/crates/baml_compiler2_hir_ty/src/exhaustiveness.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"8544097cb74a0165a39f49b12a90edbd8136360d410f87e01269635b0a87af67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/infer/obligations.rs:809-817 | baml_language/crates/baml_compiler2_hir_ty/src/infer/obligations.rs:953-961 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/infer/obligations.rs:809\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer/obligations.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e84b33a8b4a8b516a49bc956d650a3146ba6b0c1639d3e11b19c1cf6f1888db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/package_interface.rs:1594-1601 | baml_language/crates/baml_ide/src/symbol_pool.rs:724-731 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_hir_ty/src/package_interface.rs:1594\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060ty\u0060 to \u0060\u0026Ty\u0060 in one and \u0060\u0026TirTy\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":"baml_language/crates/baml_compiler2_hir_ty/src/package_interface.rs"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f3442b4b44ec89286620eb78d2ae218b31d5a8bf7603e06c76b11b1c359e81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:2329-2336 | baml_language/crates/baml_compiler2_mir/src/lower.rs:12151-12161 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:2329\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":2329}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78a130e28e2e9cfc83de293641021c2ef0bb16162c74bff4dafd170c6de1232"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:13426-13433 | baml_language/crates/baml_compiler2_mir/src/lower.rs:13487-13494 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:13426\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":13426}}}],"partialFingerprints":{"codehealthFindingId/v1":"8661ed9cb04379c473e954c80ea9ec9d717713be58e827bb03f9803ab90c9245"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_compiler2_visualization/src/control_flow/mod.rs:445-452 | engine/baml-runtime/src/control_flow/flatten/mod.rs:49-56 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/mod.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d414078b31c2702042179e6f254f3a7c6e932cc09db027bef1c906f1076c44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/declarations.rs:320-327 | baml_language/crates/baml_fmt/src/ast/statements.rs:407-414 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_fmt/src/ast/declarations.rs:320\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/declarations.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"f819e4960526d89b37405e77bbc6034b02c9806a3f0e3e13cd605f4528b79846"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/expressions.rs:354-361 | baml_language/crates/baml_fmt/src/ast/types.rs:446-453 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/types.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62299acaf08476084e72782d4512efad7f2d67ec3a5fe925a3313fb458fd6e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/expressions.rs:1447-1454 | baml_language/crates/baml_fmt/src/ast/expressions.rs:2593-2600 \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 \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs:1447\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":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e93ee602ea4bdc4002491baefc7db67d1807f33cb0834c0d6200a47b6e58d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/expressions.rs:2292-2299 | baml_language/crates/baml_fmt/src/ast/expressions.rs:2508-2515 \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":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":2292}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe19ff58c9a677675c331fc4e90e3d555c8e15e4d61a5c3d26b48de029594c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/expressions.rs:3260-3267 | baml_language/crates/baml_fmt/src/ast/expressions.rs:3401-3408 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060printer\u0060 to \u0060\u0026mut Printer\u0060 in one and \u0060\u0026Printer\u003C\u0027_\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":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":3260}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c29949b06d2c8aea34cc64ef310f21b763e8a11dd7890cc308f79eae8112dde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/pattern.rs:225-232 | baml_language/crates/baml_fmt/src/ast/pattern.rs:382-389 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/crates/baml_fmt/src/ast/pattern.rs:223\u0060 calls \u0060destructure_print_path\u0060, \u0060print_str\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/pattern.rs:381\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/pattern.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6e9d01bda9ac5c4bc8261c6dd183090202a3c294ac35712a01a79356907f9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/statements.rs:172-179 | baml_language/crates/baml_fmt/src/ast/statements.rs:214-221 \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":"baml_language/crates/baml_fmt/src/ast/statements.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"5856920504becf19bbf835e7f4d41473c3aefdd711c67c7badc9e22fdf23b237"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_ide/src/completion/completions.rs:243-250 | baml_language/crates/baml_ide/src/completion/completions.rs:272-279 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_ide/src/completion/completions.rs:243\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn add_declaration(\u0026mut\u0060 in one and \u0060super) fn add_keyword(\u0026mut\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":"baml_language/crates/baml_ide/src/completion/completions.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"925c4b138b371d4e80d95cdd146b32182633bc67603ec5e142c5733c857fef5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_lsp_server/src/playground_server.rs:244-251 | baml_language/crates/baml_lsp_server/src/playground_server.rs:254-261 \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":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"3296f55d53a20f1326bb8c4d6b4f0054a0beb6fa3130a539a4e95666bb2a95de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): baml_language/crates/baml_parser/src/lookahead.rs:89-95 | baml_language/crates/baml_parser/src/lookahead.rs:340-347 \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":"baml_language/crates/baml_parser/src/lookahead.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8f7395e35f6d80f92dd31e62123625217957625e503934c718f2e0574bbceb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_query_btel/src/ingest/profile.rs:406-413 | baml_language/crates/baml_query_btel/src/ingest/profile.rs:459-466 \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 \u0060baml_language/crates/baml_query_btel/src/ingest/profile.rs:406\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":"baml_language/crates/baml_query_btel/src/ingest/profile.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79d3a9179e8f3ebab65a762612a9fb3e8701be1e0a72458638282e21b3a9e75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_type/src/normalize.rs:1507-1514 | baml_language/crates/baml_type/src/normalize.rs:2192-2199 \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 \u0060baml_language/crates/baml_type/src/normalize.rs:1507\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":"baml_language/crates/baml_type/src/normalize.rs"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f6b6e04b160daa638a60a173273dfcd03549efd1501b979201d07a26cb6d43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_type_macros/src/emit.rs:131-138 | baml_language/crates/baml_type_macros/src/interned_member.rs:104-111 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_type_macros/src/emit.rs:131\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":"baml_language/crates/baml_type_macros/src/emit.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dfeef83faa4d9ed27f07b6675ea0233329bafa5ae9c1651a5b270aabc327dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_type_macros/src/emit.rs:389-396 | baml_language/crates/baml_type_macros/src/emit.rs:884-891 \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 \u0060baml_language/crates/baml_type_macros/src/emit.rs:389\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":"baml_language/crates/baml_type_macros/src/emit.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"08be6c813f87ee82d204b90a2bc795a39480bd4f93767978fa6ef315cab5de61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_type_macros/src/emit.rs:477-484 | baml_language/crates/baml_type_macros/src/emit.rs:498-505 \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":"baml_language/crates/baml_type_macros/src/emit.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"879e52f97ce02ea879d01859c0654faab97dda6baaad59a0b47d0b06d33e9b5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:335-342 | baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:458-465 \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 \u0060baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:335\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":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f4df8777276a3bee0a42efe1a3d94fcd32a768a830f52a9d9ffc3f4902294b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/value.rs:160-167 | engine/baml-lib/jsonish/src/jsonish/value.rs:150-157 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/value.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/value.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 164 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/value.rs:160\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":"baml_language/crates/bex_sap/src/jsonish/value.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c93299ce893251adb7e4b33a3a764947b965add249244bfae24d787c4dcb3d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/bex_str/src/bex_str.rs:877-884 | baml_language/crates/bex_str/src/bex_str.rs:892-899 \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 \u0060baml_language/crates/bex_str/src/bex_str.rs:877\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060s\u0060 to \u0060String\u0060 in one and \u0060\u0026str\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":"baml_language/crates/bex_str/src/bex_str.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d36a8784321b320d5e9fe0ae7940c3b5ac3a014779e714daaad6cce5d0375f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/bex_vm/src/debug.rs:703-710 | baml_language/crates/bex_vm/src/debug.rs:1288-1295 \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 \u0060baml_language/crates/bex_vm/src/debug.rs:703\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":"baml_language/crates/bex_vm/src/debug.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"e126bd337e6920908df9ff8db3b1b1be040d80f65d5489f519be061df1cd8483"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/bex_vm/src/package_baml/csv.rs:135-142 | baml_language/crates/bex_vm/src/package_baml/regex.rs:163-170 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_vm/src/package_baml/csv.rs:135\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":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f7b38943dc09ed5b04672e50182b0eee5e43973575349a626bfdf819c4619e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/bex_vm/src/package_baml/csv.rs:2363-2370 | baml_language/crates/bex_vm/src/package_baml/csv.rs:2396-2403 \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":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":2363}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff76e79b44729d9c7bcc4d7ea4ad1b9af217efb983cb4845ef18fef1f607981d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs:1313-1320 | baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs:1323-1330 \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":"baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"9447719052c1ab72e21da94fb5cf502ca0187247004d83907093e96a3af212c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs:1812-1819 | baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs:1852-1859 \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 \u0060baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs:1812\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":"baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs"},"region":{"startLine":1812}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c22a7f24c5862e728ae1215984f071a484e8252fb9ec73db70ab7e68a0013c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/bex_vm/src/vm.rs:5806-5813 | baml_language/crates/bex_vm/src/vm.rs:5818-5825 \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 \u0060baml_language/crates/bex_vm/src/vm.rs:5806\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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":5806}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22fccd7d1a790f3c567ee4d73b326845f899bf58d05c4cbcad4c22e18a1d4a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/bex_vm/src/vm.rs:11385-11392 | baml_language/crates/bex_vm/src/vm/compiled_rt/types.rs:226-233 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_vm/src/vm.rs:11385\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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":11385}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ac3336f8ac44766575d7291e15a5d05975559050ddbb077c607e3ad3968699"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): baml_language/crates/bridge_wasm/src/runs.rs:1030-1037 | baml_language/crates/bridge_wasm/src/runs.rs:1069-1075 \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 \u0060baml_language/crates/bridge_wasm/src/runs.rs:1030\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":"baml_language/crates/bridge_wasm/src/runs.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2efcf25b65f7a68455198db2f397e5f9aa7848e069a90021f62f50af63dd8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): baml_language/crates/bridge_wasm/src/wasm_env.rs:95-108 | baml_language/crates/bridge_wasm/src/wasm_io.rs:116-129 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bridge_wasm/src/wasm_env.rs:95\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_wasm/src/wasm_env.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af4d2388500fc5de78e088699fe67ebab73ad884539d347067df42e8fbc05e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/tools_stow/src/main.rs:758-766 | baml_language/crates/tools_stow/src/main.rs:774-781 \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 \u0060baml_language/crates/tools_stow/src/main.rs:758\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":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09744fc22046a48da91300ccb36e9208847f784d3da6ff2c1f51fdef696af95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/tools_stow/src/main.rs:1066-1073 | baml_language/crates/tools_stow/src/main.rs:1086-1093 \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 \u0060baml_language/crates/tools_stow/src/main.rs:1066\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":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be456187b0b006b693ce086c6fa8806083207a6fd4e8264194853da1da3ca5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/tools_stow/src/main.rs:2280-2287 | baml_language/crates/tools_stow/src/main.rs:2302-2309 \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 \u0060baml_language/crates/tools_stow/src/main.rs:2280\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":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":2280}}}],"partialFingerprints":{"codehealthFindingId/v1":"1970138c7367cf76891a8b1a0e5e125d585b54ac3a210baa4666d61a50e72e30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:1520-1527 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:1818-1825 \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 \u0060baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:1520\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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0c241580b2fd61854275f0c04a65145ab96fe13bfd996f3f0bbddb89ffcf16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:309-316 | baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:376-383 \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 \u0060baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:309\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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c7c331bfc825cb832a26c9551ef2bddeeae2bfcf8c1106fb3f8003d1423723"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:922-929 | baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:991-998 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060aliases\u0060 to \u0060Vec\u003CSortedSymbol\u003E\u0060 in one and \u0060Vec\u003C(EmittedSymbol, SortKey)\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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"905f8cb8b4424970ef8e8c2d23fd61d62b951e112e16ad10e11c2de331ba03e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:1316-1323 | baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:2219-2226 \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 \u0060baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs:1316\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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a746c429d60878435bb3cb3d697f832e3be5cf0a945897c9d93c88e5aa35a36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/lib.rs:315-322 | baml_language/sdks/typescript/sdkgen_typescript_shared/src/lib.rs:167-174 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/lib.rs:315\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/lib.rs:323\u0060 calls \u0060Some\u0060, \u0060clone\u0060 and \u0060baml_language/sdks/typescript/sdkgen_typescript_shared/src/lib.rs:175\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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/lib.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d12443b6d072e4a3b27aca13873833633accc69dcb23017c154ec3664f466a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/names.rs:378-385 | baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/names.rs:521-528 \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 \u0060baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/names.rs:378\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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/names.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"c335ff849c621840aee2b987fdefb3f90c404a8be20f8f47cab0ec0618838c0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/baml-compiler/src/hir/dump.rs:455-462 | engine/baml-compiler/src/hir/dump.rs:524-531 \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 \u0060engine/baml-compiler/src/hir/dump.rs:455\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":"engine/baml-compiler/src/hir/dump.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea261ad586a393b02f4c4835805ea99fcc51ff48f7e8ea6cd5ec111b9688c6ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/baml-lib/ast/src/ast/identifier.rs:30-37 | engine/baml-lib/ast/src/ast/identifier.rs:40-48 \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":"engine/baml-lib/ast/src/ast/identifier.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"eecca9d01865a3efeed45e6f395f479bc7812556f6a29154bd6a6920acab9f4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/baml-lib/ast/src/parser/parse.rs:234-241 | engine/baml-lib/ast/src/parser/parse_expr.rs:932-939 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/ast/src/parser/parse.rs:234\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060token\u0060 to \u0060pest::iterators::Pair\u003C\u0027_, Rule\u003E\u0060 in one and \u0060Pair\u003C\u0027_\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":"engine/baml-lib/ast/src/parser/parse.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a32aef7cb7a2cf654fa6476c2746fe6fe3ec602c4d472f61d99e1022af2001"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/cycle.rs:176-183 | engine/baml-lib/parser-database/src/lib.rs:178-185 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/cycle.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":"engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/cycle.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b077cfc2f9fe899225ffd496e905e8552ecf95f4fd84df89c0289a39ee3a617"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/baml-lib/diagnostics/src/collection.rs:124-132 | engine/baml-lib/diagnostics/src/collection.rs:139-147 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/diagnostics/src/collection.rs:124\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":"engine/baml-lib/diagnostics/src/collection.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3a01bea9965f6b35dc5e0d43968e3a095859b8f925b13b8d5c8bd68576ff5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/baml-lib/jsonish/src/deserializer/coercer/coerce_primitive.rs:204-211 | engine/baml-lib/jsonish/src/deserializer/coercer/coerce_primitive.rs:297-304 \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 \u0060engine/baml-lib/jsonish/src/deserializer/coercer/coerce_primitive.rs:204\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":"engine/baml-lib/jsonish/src/deserializer/coercer/coerce_primitive.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c89d77f0fe83af37b1dd969fc4843fbc3c1b1e1ca7f639f3ed575f9e822762a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/baml-lib/jsonish/src/deserializer/coercer/mod.rs:57-64 | engine/baml-lib/jsonish/src/deserializer/coercer/mod.rs:77-84 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/jsonish/src/deserializer/coercer/mod.rs:57\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":"engine/baml-lib/jsonish/src/deserializer/coercer/mod.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"616addc1b808db33b35778fad2e552ade1351869607005b30e82baf92894b429"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/orchestrator/call.rs:66-73 | engine/baml-runtime/src/internal/llm_client/orchestrator/stream.rs:178-185 \u2014 before extracting anything, compare \u0060engine/baml-runtime/src/internal/llm_client/orchestrator/call.rs\u0060 and \u0060engine/baml-runtime/src/internal/llm_client/orchestrator/stream.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/orchestrator/call.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1993ae585110fdbc1caf563310546f6c8b41c0e11752b0a0a7a56bda1f11696d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/anthropic/response_handler.rs:66-73 | engine/baml-runtime/src/internal/llm_client/primitive/vertex/response_handler.rs:71-78 \u2014 \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/response_handler.rs\u0060 and \u0060engine/baml-runtime/src/internal/llm_client/primitive/vertex/response_handler.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 39 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/response_handler.rs:66\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/anthropic/response_handler.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15390431805669719e6808c0c63a2d998f9863d954180570eb36857ef177e58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs:156-163 | engine/baml-runtime/src/internal/llm_client/primitive/vertex/vertex_client.rs:180-187 \u2014 before extracting anything, compare \u0060engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs\u0060 and \u0060engine/baml-runtime/src/internal/llm_client/primitive/vertex/vertex_client.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 119 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs:156\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":"engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4504a9955f49cef2c116e99d4d16a200c5c14eeac76f8a6b5432314860df75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs:395-402 | engine/baml-runtime/src/internal/llm_client/primitive/vertex/vertex_client.rs:507-514 \u2014 before extracting anything, compare \u0060engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs\u0060 and \u0060engine/baml-runtime/src/internal/llm_client/primitive/vertex/vertex_client.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 119 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ff81348604ce7f96b2dfdbb54baa6a45ce88a6dc09123a60eaf6f6935d83b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/request.rs:161-168 | engine/baml-runtime/src/internal/llm_client/primitive/request.rs:439-445 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/internal/llm_client/primitive/request.rs:161\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":"engine/baml-runtime/src/internal/llm_client/primitive/request.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"a557cf0cda19819f36c5ed6de355e08216c0bf75b01a801f438a4ed7c170b282"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/strategy/mod.rs:44-51 | engine/baml-runtime/src/internal/llm_client/strategy/mod.rs:64-71 \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":"engine/baml-runtime/src/internal/llm_client/strategy/mod.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"80219746848adf3ddd93bd61871193d256a2cbf1bbfe00b7d3822654b75da5e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): engine/baml-runtime/src/optimize/applier.rs:333-340 | engine/baml-runtime/src/optimize/applier.rs:399-405 \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 \u0060engine/baml-runtime/src/optimize/applier.rs:333\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":"engine/baml-runtime/src/optimize/applier.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"f988b17c387666fcd54aa938b16c6dff05883ef2aede7cd724e8047dbffe4db7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/baml-runtime/src/type_builder/mod.rs:392-399 | engine/baml-runtime/src/type_builder/mod.rs:418-425 \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 \u0060engine/baml-runtime/src/type_builder/mod.rs:392\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":"engine/baml-runtime/src/type_builder/mod.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24263e8d7a86a85037526a761bec1683cfe275b2e2dfa3d2924b92f2fa4a6f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2534-2542 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:3166-3173 \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 \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2534\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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":2534}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de496ad913b0d3072382127e58ded5426864f41be8c1a76fe7bcbe354fe1cb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2843-2859 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:3062-3077 \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 \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:2843\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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":2843}}}],"partialFingerprints":{"codehealthFindingId/v1":"100d692123637293826646675bb7ec6f7937733179a0f982754bfa1c4dce6d5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/baml_cffi_macros/src/lib.rs:406-413 | engine/baml_cffi_macros/src/lib.rs:462-469 \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 \u0060engine/baml_cffi_macros/src/lib.rs:406\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":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"047dc20f03630fa7c395f0c1db5966991f677b2ca4c15fac0d48b15ae4ff6784"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/baml_cffi_macros/src/lib.rs:406-413 | engine/baml_cffi_macros/src/lib.rs:430-437 \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 \u0060engine/baml_cffi_macros/src/lib.rs:406\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":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38aa9ff8c3ef9da3200145b7986b9c33b09464e5761d657f3c90d04f25f34fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/baml_cffi_macros/src/lib.rs:917-924 | engine/baml_cffi_macros/src/lib.rs:951-958 \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 \u0060engine/baml_cffi_macros/src/lib.rs:917\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":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"b298a17a93d68a3c7b684a8c1cf2f7e350975fcb8433835373187835f4b53617"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/generators/languages/go/src/ir_to_go/mod.rs:36-43 | engine/generators/languages/go/src/ir_to_go/mod.rs:216-223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/generators/languages/go/src/ir_to_go/mod.rs:36\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":"engine/generators/languages/go/src/ir_to_go/mod.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9380634c9b9b1df43d7d05d151f4f68442fbf6bf927decd4c72129592ec695e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/generators/languages/go/src/type.rs:137-145 | engine/generators/languages/go/src/type.rs:188-196 \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":"engine/generators/languages/go/src/type.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"80106182ff68788b0eb43f1eeff749d6ebbdd1d022043826f820fc09103ebf0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/generators/languages/python/src/watchers.rs:78-85 | engine/generators/languages/typescript/src/watchers.rs:82-89 \u2014 before extracting anything, compare \u0060engine/generators/languages/python/src/watchers.rs\u0060 and \u0060engine/generators/languages/typescript/src/watchers.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/generators/languages/python/src/watchers.rs:78\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":"engine/generators/languages/python/src/watchers.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6df99ba0dd1cbb18554c14018d4e0df52bbfccfd733851a2a825ed1ea2d64e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/generators/languages/rust/src/ir_to_rust/mod.rs:46-53 | engine/generators/languages/rust/src/ir_to_rust/mod.rs:238-245 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/generators/languages/rust/src/ir_to_rust/mod.rs:46\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":"engine/generators/languages/rust/src/ir_to_rust/mod.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfeeb9cc14b42a8e16569718764e78f95f02ee60509dd6a82d0252796ad84a17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): languages/rust/baml-macros/src/baml_serde.rs:48-55 | languages/rust/baml-macros/src/baml_serde.rs:65-72 | languages/rust/baml-macros/src/baml_serde.rs:81-90 \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 \u0060languages/rust/baml-macros/src/baml_serde.rs:48\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":"languages/rust/baml-macros/src/baml_serde.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7661bc6aa0a512ce2789a8827315d9e3079bbe07e477f6b967d6ede1031abf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): languages/rust/baml-macros/src/decode.rs:165-172 | languages/rust/baml-macros/src/encode.rs:113-120 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060languages/rust/baml-macros/src/decode.rs:165\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":"languages/rust/baml-macros/src/decode.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bf397df0b7d1f9064a92ccbf58521748d1b73cf87a56439318f3ef01bbdf1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): languages/rust/baml/src/raw_objects/mod.rs:227-234 | languages/rust/baml/src/raw_objects/mod.rs:478-485 \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 \u0060languages/rust/baml/src/raw_objects/mod.rs:227\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":"languages/rust/baml/src/raw_objects/mod.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a082035d77c63e51f7e5d153c10c6671dd5b48ff8e4bb0e3b5ab11a25321309"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): languages/rust/baml/src/runtime.rs:206-213 | languages/rust/baml/src/runtime.rs:498-505 \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 \u0060languages/rust/baml/src/runtime.rs:206\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":"languages/rust/baml/src/runtime.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c31c74ef7358415567735f04ed05da306811de2608b061976dd0cb2eb7344f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8): engine/generators/languages/go/src/ir_to_go/mod.rs:113-119 | engine/generators/languages/go/src/ir_to_go/mod.rs:144-150 | engine/generators/languages/go/src/ir_to_go/mod.rs:274-280 | engine/generators/languages/go/src/ir_to_go/mod.rs:292-298 | engine/generators/languages/rust/src/ir_to_rust/mod.rs:131-137 | engine/generators/languages/rust/src/ir_to_rust/mod.rs:162-168 | engine/generators/languages/rust/src/ir_to_rust/mod.rs:304-310 | engine/generators/languages/rust/src/ir_to_rust/mod.rs:322-328 \u2014 before extracting anything, compare \u0060engine/generators/languages/go/src/ir_to_go/mod.rs\u0060 and \u0060engine/generators/languages/rust/src/ir_to_rust/mod.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 208 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/go/src/ir_to_go/mod.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f3f3a1b29b726ba3770b2550187c96ca6443503b9329dcd60eb7927f56cf51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7): baml_language/crates/bex_vm/src/vm.rs:7981-7987 | baml_language/crates/bex_vm/src/vm.rs:7988-7994 | baml_language/crates/bex_vm/src/vm.rs:9730-9736 | baml_language/crates/bex_vm/src/vm.rs:9760-9766 | baml_language/crates/bex_vm/src/vm.rs:9801-9807 | baml_language/crates/bex_vm/src/vm.rs:9835-9841 | baml_language/crates/bex_vm/src/vm.rs:9859-9865 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":7981}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a68aa388ddedcf6390658face754e7fe8aa2debae1a4533fda2930b7c3b5f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): baml_language/crates/baml_compiler2_emit/src/emit.rs:1436-1442 | baml_language/crates/baml_compiler2_emit/src/emit.rs:1898-1904 | baml_language/crates/baml_compiler2_emit/src/emit.rs:1932-1938 | baml_language/crates/baml_compiler2_emit/src/emit.rs:1956-1962 | baml_language/crates/baml_compiler2_emit/src/emit.rs:2604-2610 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/crates/baml_compiler2_emit/src/emit.rs:1930\u0060 calls \u0060emit_operand_pull\u0060 and \u0060baml_language/crates/baml_compiler2_emit/src/emit.rs:1896\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":"baml_language/crates/baml_compiler2_emit/src/emit.rs"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"5830073312d4e9cfabd480306bf4b699a1ee8cb7ccdfbe9d315fed511f2de038"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): engine/generators/languages/go/src/ir_to_go/enums.rs:10-18 | engine/generators/languages/python/src/ir_to_py/enums.rs:7-15 | engine/generators/languages/ruby/src/ir_to_rb/enums.rs:7-15 | engine/generators/languages/rust/src/ir_to_rust/enums.rs:7-15 | engine/generators/languages/typescript/src/ir_to_ts/enums.rs:5-13 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/go/src/ir_to_go/enums.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f30699e6dd47b559a6865d5d4d7ecf7bbdc0eb34f63f2a306c0ae5ac178097"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs:792-798 | baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs:889-895 | baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs:932-938 | baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs:1203-1209 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060id\u0060 to \u0060Id\u003CClassDef\u003E\u0060 in one and \u0060Id\u003CEnumDef\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":"baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41907ae3f3645f31ad643b99414c78e968f8e539ed7789e6ffccb1e3807488c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): baml_language/crates/bex_vm/src/package_baml/csv.rs:2345-2351 | baml_language/crates/bex_vm/src/package_baml/csv.rs:2380-2386 | baml_language/crates/bex_vm/src/package_baml/csv.rs:2627-2633 | baml_language/crates/bex_vm/src/package_baml/csv.rs:2654-2660 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":2345}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca3016ee0bec4bc018152b189ae1ee71e53a46b1eee5204a9896296b25410e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): baml_language/crates/bex_vm/src/vm.rs:8020-8026 | baml_language/crates/bex_vm/src/vm.rs:9766-9772 | baml_language/crates/bex_vm/src/vm.rs:9841-9847 | baml_language/crates/bex_vm/src/vm.rs:9865-9871 \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 \u0060baml_language/crates/bex_vm/src/vm.rs:8020\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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":8020}}}],"partialFingerprints":{"codehealthFindingId/v1":"380fdc14b09e9bf0517d5aeab528a1617dc4aaf45e9ea46a569a56f74ad5bac2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): baml_language/sdks/go/sdkgen_go/src/names.rs:1261-1267 | baml_language/sdks/go/sdkgen_go/src/names.rs:1277-1283 | baml_language/sdks/go/sdkgen_go/src/names.rs:1296-1302 | baml_language/sdks/go/sdkgen_go/src/names.rs:1305-1311 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/sdks/go/sdkgen_go/src/names.rs:1284\u0060 calls \u0060push_str\u0060 and \u0060baml_language/sdks/go/sdkgen_go/src/names.rs:1268\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":"baml_language/sdks/go/sdkgen_go/src/names.rs"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ab50b59b082ddcbb7bfcc71e2864670f0a1edd444a0d9c6c946ac9a0a6634c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): engine/baml-lib/ast/src/ast/field.rs:210-216 | engine/baml-lib/ast/src/ast/field.rs:222-228 | engine/baml-lib/ast/src/ast/field.rs:234-240 | engine/baml-lib/ast/src/ast/field.rs:246-252 \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 \u0060engine/baml-lib/ast/src/ast/field.rs:210\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":"engine/baml-lib/ast/src/ast/field.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"84eaf2225e4490fabc0bb55ba9aa4ecff2265280fee9785626c900f333645de3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 4): engine/baml-runtime/src/runtime/publisher/mod.rs:123-128 | engine/baml-runtime/src/runtime/publisher/mod.rs:146-151 | engine/baml-runtime/src/runtime/publisher/mod.rs:169-175 | engine/baml-runtime/src/runtime/publisher/mod.rs:196-202 \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 \u0060engine/baml-runtime/src/runtime/publisher/mod.rs:123\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/runtime/publisher/mod.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"9433686c37c3d189aefe7faeb02c3b0915d32953c385a3cda3c2cac67524a3c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): baml_language/crates/baml_compiler2_emit/src/items.rs:1093-1099 | baml_language/crates/baml_compiler2_emit/src/lib.rs:1164-1173 | baml_language/crates/baml_compiler2_emit/src/package/bodies.rs:89-96 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_emit/src/items.rs:1093\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. 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":"baml_language/crates/baml_compiler2_emit/src/items.rs"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21d5d6aa5f2f5347090f0c507e97e79049da459ea554c0f35494d00bc258db9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:163-169 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:213-219 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:241-247 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:163\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4b79f9399cd9de0b9c5bc7a797aed8df0a786db5c4ca4047db8eeff103d39a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:161-167 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:211-217 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:257-263 \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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4672a8d0ee2cf31a40c0b8863df29af917d8ca3fefde9c7f309b5e1abcb74f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): baml_language/crates/baml_compiler2_mir/src/lower.rs:12526-12532 | baml_language/crates/baml_compiler2_mir/src/lower.rs:12594-12600 | baml_language/crates/baml_compiler2_mir/src/lower.rs:14043-14049 \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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":12526}}}],"partialFingerprints":{"codehealthFindingId/v1":"955a7abb2f8d2793b74f82f3fe78066471583f77ffde20e9ce6f74f4e98692ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): baml_language/crates/bex_vm/src/debug.rs:605-611 | baml_language/crates/bex_vm/src/debug.rs:1211-1217 | engine/baml-vm/src/debug.rs:309-315 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_vm/src/debug.rs\u0060 and \u0060engine/baml-vm/src/debug.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_vm/src/debug.rs:605\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":"baml_language/crates/bex_vm/src/debug.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f6c29c0e33fa76c1d5d3c5ef07da4e7bad1f3f42583ef9af8e00ef85dfa350"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): baml_language/crates/bridge_wasm/src/wasm_http.rs:738-744 | baml_language/crates/sys_native/src/io_impls.rs:3385-3391 | baml_language/crates/sys_native/src/io_impls.rs:3469-3475 \u2014 before extracting anything, compare \u0060baml_language/crates/bridge_wasm/src/wasm_http.rs\u0060 and \u0060baml_language/crates/sys_native/src/io_impls.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bridge_wasm/src/wasm_http.rs:738\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":"baml_language/crates/bridge_wasm/src/wasm_http.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91e0b858346da3d3ac9b4fc014d792f757fd30b6ed5984023364fec0bf7038d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): baml_language/sdks/rust/sdkgen_rust/src/emit/class.rs:541-547 | baml_language/sdks/rust/sdkgen_rust/src/emit/class.rs:574-579 | baml_language/sdks/rust/sdkgen_rust/src/emit/union.rs:322-328 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdks/rust/sdkgen_rust/src/emit/class.rs:541\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":"baml_language/sdks/rust/sdkgen_rust/src/emit/class.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8d6b21d61a8c31f8400de69b89de634c0393576780bd2ef94a3970a67393fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): engine/baml-lib/jsonish/src/deserializer/coercer/coerce_primitive.rs:237-243 | engine/baml-lib/jsonish/src/deserializer/coercer/coerce_primitive.rs:331-337 | engine/baml-lib/jsonish/src/deserializer/coercer/coerce_primitive.rs:393-399 \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 \u0060engine/baml-lib/jsonish/src/deserializer/coercer/coerce_primitive.rs:237\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":"engine/baml-lib/jsonish/src/deserializer/coercer/coerce_primitive.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d632d8a0fc59a777214aa02a4ccffe516332cdabb262a0988302bb61ed8cdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): engine/baml-runtime/src/internal/llm_client/primitive/anthropic/response_handler.rs:68-74 | engine/baml-runtime/src/internal/llm_client/primitive/vertex/response_handler.rs:50-56 | engine/baml-runtime/src/internal/llm_client/primitive/vertex/response_handler.rs:73-79 \u2014 \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/response_handler.rs\u0060 and \u0060engine/baml-runtime/src/internal/llm_client/primitive/vertex/response_handler.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 39 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/response_handler.rs:68\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/anthropic/response_handler.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1257c2c5fdde68d7192dad29402d2a1a609904ab03ea0a1a52e5075adf931637"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): engine/baml-runtime/src/lib.rs:291-297 | engine/baml-runtime/src/lib.rs:326-332 | engine/baml-runtime/src/types/stream.rs:160-166 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/lib.rs:291\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":"engine/baml-runtime/src/lib.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"43693c67246c56ea07a7cd53428936552957e603137bce778fd35a6ef9359c49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1150-1156 | engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1212-1218 | engine/language_server/src/baml_project/mod.rs:759-765 \u2014 before extracting anything, compare \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs\u0060 and \u0060engine/language_server/src/baml_project/mod.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 183 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs:1150\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":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"190c7639e472c9a49db4b6cf081b0c883a7c3cfd221f1d21de6c65c5d96a5a7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:287-293 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:641-647 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:839-845 \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 \u0060engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:287\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":"engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb002e19066267fae065e72125e229a4258d440a7ca1e141fef34b4fc2c127b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:308-314 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:659-665 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:817-823 \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 \u0060engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:308\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":"engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c5c5b3d34d9a28e80143bca5a9eb951838835f645d354e785676052de6fcda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1576-1582 | baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1999-2005 \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 \u0060baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1576\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":"baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"287bb4592f7c5ef48a4aa41f2aa510e6702b0ca94324116e4490cf7a2b6bf614"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/baml_cli/src/diagnostics_cache.rs:124-130 | baml_language/crates/baml_cli/src/diagnostics_cache.rs:160-166 \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 \u0060baml_language/crates/baml_cli/src/diagnostics_cache.rs:124\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":"baml_language/crates/baml_cli/src/diagnostics_cache.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"313ade040b0cd9a63d632e1361e2cf810454f445a3c71a7896358beb710757ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/baml_compiler2_hir/src/item_data/classes.rs:68-74 | baml_language/crates/baml_compiler2_hir/src/item_data/functions.rs:427-433 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir/src/item_data/classes.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ad6f7d5b017acb4f7566365b4c041b4b199ffdb52ceac41029af4b25fb1a3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:1033-1043 | baml_language/crates/baml_compiler2_hir_ty/src/interfaces/coherence.rs:249-259 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs\u0060 and \u0060baml_language/crates/baml_compiler2_hir_ty/src/interfaces/coherence.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"baca4cf3220522c8ce9dd5d7f9c0d79bf2d2f31241eb6d95a05c2f06c520fcce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:1050-1056 | baml_language/crates/baml_compiler2_hir_ty/src/interfaces/coherence.rs:273-281 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs\u0060 and \u0060baml_language/crates/baml_compiler2_hir_ty/src/interfaces/coherence.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:1050\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":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9e36204d7c0a80e3e76e3aa734967e2376c19bbee7270c09035752fdab576a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:1141-1147 | baml_language/crates/baml_compiler2_hir_ty/src/interfaces/coherence.rs:377-382 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs\u0060 and \u0060baml_language/crates/baml_compiler2_hir_ty/src/interfaces/coherence.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:1141\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060rule\u0060 to \u0060\u0026ImplFacts\u003C\u0027_\u003E\u0060 in one and \u0060\u0026ImplData\u003C\u0027_\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":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fff7b8db40045c6586dce38a4ed3775db971fe1237e2bb4cfd737e501b5cc2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/globals.rs:322-329 | baml_language/crates/baml_compiler2_mir/src/escape.rs:355-361 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_hir_ty/src/globals.rs:322\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":"baml_language/crates/baml_compiler2_hir_ty/src/globals.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55fcbb6bae93394913c681457d634bee083dfa31c8e83c8e651995982a4a740"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/impls.rs:2108-2114 | baml_language/crates/baml_type/src/normalize.rs:3162-3168 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_hir_ty/src/impls.rs:2108\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":"baml_language/crates/baml_compiler2_hir_ty/src/impls.rs"},"region":{"startLine":2108}}}],"partialFingerprints":{"codehealthFindingId/v1":"77464da1b8b319199c5335ec7d10cdd24f38cef57d152789e3d815ed2d2d9eea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:6851-6857 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:6865-6871 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:6851\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":6851}}}],"partialFingerprints":{"codehealthFindingId/v1":"54240869e7ea303e540a6c46b4a4105d57775968597079305dd59af365a3aafe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs:1264-1270 | baml_language/crates/baml_compiler2_hir_ty/src/layout.rs:526-531 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs:1264\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":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b8df966b3459e58e32833476ea2e5d9ce5cc899510809fc42c59617c742e55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:1942-1948 | baml_language/crates/baml_compiler2_mir/src/lower.rs:2029-2034 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:1942\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":1942}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f35ddaead354d9780fa5870a1bbc5f5861a3c5b8ffe4fbef00d69e952668b20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:2692-2698 | baml_language/crates/baml_compiler2_mir/src/lower.rs:2708-2714 \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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":2692}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb89950e7ff4ae6913840f4b3c83217af56bceab27a7dc0f8c2c176916d62598"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:7074-7081 | baml_language/crates/baml_compiler2_mir/src/lower.rs:8058-8065 \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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":7074}}}],"partialFingerprints":{"codehealthFindingId/v1":"97387c615939da58587e7549a3b6833216ee91ca2450789506fd0303e723f763"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:9333-9339 | baml_language/crates/baml_compiler2_mir/src/lower.rs:9385-9391 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:9333\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":9333}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac1adc71acc0508616c6b2ddc6d525ccb267004d41df77fed8673b74314a651"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:14459-14465 | baml_language/crates/baml_compiler2_mir/src/lower.rs:14631-14637 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:14459\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":14459}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a59ea98a77160b9990a1e8116fba19ee8e5993155c75d4f2afa55b38ac6c66b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/attributes.rs:80-86 | baml_language/crates/baml_fmt/src/ast/types.rs:46-52 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_fmt/src/ast/attributes.rs\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/types.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/attributes.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c2e60b0566cdcf2f3c52e083373c3388d79ca07e669e259e35f514aadcb331"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/expressions.rs:367-373 | baml_language/crates/baml_fmt/src/ast/types.rs:357-363 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/types.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs:367\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":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f01e38a53270efc3fedfe64eb461de24d946ac0018c690315b393ec9c512df2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/baml_ide/src/resolve.rs:582-588 | baml_language/crates/baml_ide/src/resolve.rs:626-632 \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 \u0060baml_language/crates/baml_ide/src/resolve.rs:582\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/resolve.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b147ba7ca147f8375ec3833b7eaafbf7ac41224680b9af11671c6ed1f9f240"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/baml_lsp_server/src/playground_seam.rs:1060-1071 | baml_language/crates/bridge_wasm/src/playground.rs:560-571 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_lsp_server/src/playground_seam.rs:1060\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":"baml_language/crates/baml_lsp_server/src/playground_seam.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"68501fc3aad39143e8e0444470eecb5a62a72161b4e549f2ee3c512ce0b2733b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/baml_parser/src/expr.rs:995-1001 | baml_language/crates/baml_parser/src/expr.rs:1100-1106 \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 \u0060baml_language/crates/baml_parser/src/expr.rs:995\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060kw\u0060 to \u0060Token![\u0022match\u0022]\u0060 in one and \u0060Self::Head\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":"baml_language/crates/baml_parser/src/expr.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b9ffb702687dfd86f6b2e6fbc7dead62de6d45d8b920fa031b953df8263afd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/baml_type/src/normalize.rs:1516-1522 | baml_language/crates/baml_type/src/normalize.rs:2201-2207 \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":"baml_language/crates/baml_type/src/normalize.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"374b063fec99110f71304020f557f55c0497a5ffa0b6740fee6db99e3764a453"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/baml_type/src/normalize/mu.rs:671-677 | baml_language/crates/baml_type/src/normalize/mu.rs:1401-1407 \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 \u0060baml_language/crates/baml_type/src/normalize/mu.rs:671\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":"baml_language/crates/baml_type/src/normalize/mu.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f3a92b51ea6b38f6db4b8756dca98aa3fc26934e33c69362854236b935f1dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/bex_project/src/runtime_compile.rs:1217-1223 | baml_language/crates/bex_project/src/runtime_compile.rs:1306-1312 \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 \u0060baml_language/crates/bex_project/src/runtime_compile.rs:1217\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/crates/bex_project/src/runtime_compile.rs:1216\u0060 calls \u0060filter\u0060 and \u0060baml_language/crates/bex_project/src/runtime_compile.rs:1305\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_project/src/runtime_compile.rs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0526bd0ce470de130675ba3e451b807dc6e87096ebadbdc59a5c2701b8d7a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs:296-306 | engine/baml-lib/jsonish/src/deserializer/coercer/array_helper.rs:237-247 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs\u0060 and \u0060engine/baml-lib/jsonish/src/deserializer/coercer/array_helper.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 98 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs:296\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":"baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f19a2943016a3ded179bbb0b907b8dbd5aac49aebbce70138ced3cd506ecb34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:121-127 | baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:309-315 \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 \u0060baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:121\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":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"692f5deeb6d0aba5b918ce9db6f099db2fa6043b8cafc5feeea84e0533c4e08b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/value.rs:113-119 | engine/baml-lib/jsonish/src/jsonish/value.rs:105-111 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/value.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/value.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 164 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/value.rs:113\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":"baml_language/crates/bex_sap/src/jsonish/value.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce0331634c930dcaf2fc74db1ec2b71c8cdd63cb414d6c6a4fe6bdfb7366b9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/value.rs:183-189 | engine/baml-lib/jsonish/src/jsonish/value.rs:173-179 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/value.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/value.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 164 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/value.rs:183\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":"baml_language/crates/bex_sap/src/jsonish/value.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afe1c0592823b10ef40ef1166633726778f94fd777103972fe3995a2eec9559"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/bex_vm/src/package_reflect/reflect.rs:1393-1401 | baml_language/crates/bex_vm_types/src/types/package.rs:306-312 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/reflect.rs"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"8923ae694fa24f1509aa75493cc3e15cafc616a853f643f15a06a0bc11768dd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs:805-811 | baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs:860-866 \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 \u0060baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs:805\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":"baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84071b3671ce61fdbf49c8985bcf56ffd87e04b4d30aecb013266f3fcda7b16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs:892-898 | baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs:1164-1170 \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":"baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd413222761cd1e2973367a30f95213f562785980c14785373334406221458c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs:1590-1596 | baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs:2046-2052 \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 \u0060baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs:1590\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":"baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"0303bb9ec3053ad61607e6e97722ed341c778fea8879a35f383f5403ac98e751"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/bex_vm/src/vm.rs:165-171 | baml_language/crates/bex_vm_types/src/types/containers.rs:317-323 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"64454540928ac1f7067c9062a933b0ae81cd3397e9a41329bc16509678184ff5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/bex_vm/src/vm.rs:8701-8707 | baml_language/crates/bex_vm/src/vm.rs:8733-8739 \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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":8701}}}],"partialFingerprints":{"codehealthFindingId/v1":"70058b14fbef3e0fd8c2bd708b78adf2d38015e0984a7699c257c4511ae7de4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/bridge_wasm/src/wasm_random.rs:57-63 | baml_language/crates/sys_native/src/io_impls.rs:256-262 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bridge_wasm/src/wasm_random.rs:57\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":"baml_language/crates/bridge_wasm/src/wasm_random.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a937d37ba93593b899f0775667676a224bf602e685912bf047d8f4a924980a92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/sys_native/src/io_impls.rs:1654-1660 | baml_language/crates/sys_native/src/io_impls.rs:2398-2404 \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 \u0060baml_language/crates/sys_native/src/io_impls.rs:1654\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":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"cedd169c81bc972631ae844316453ddd0c72c7fdc5f5c1090307c9db7ccf2a04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/sys_native/src/io_impls.rs:2074-2080 | baml_language/crates/sys_native/src/io_impls.rs:2097-2103 \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":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb76100902cb7003b5c4b1d8e4283ebb8e2329eeaca5da58424d26f19250a89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs:1147-1153 | baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs:1197-1203 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe6543ff2c9c6795c06892f51ff65e0893472a7d7efb836d855ebb51e1cca4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/sdks/csharp/sdkgen_csharp/src/model.rs:167-173 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:1323-1329 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdks/csharp/sdkgen_csharp/src/model.rs:167\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":"baml_language/sdks/csharp/sdkgen_csharp/src/model.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"74095a20ed77d8573aa6617b950b0aa842fb4afa1d4c17952cbc7a21dfcc1844"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:594-601 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:641-648 \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 \u0060baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:594\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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5e61899bd7fbf36a3627ee6bd1ceb29beafe529ebd60499baaf9a53bcc2736"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:2672-2678 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:3275-3281 \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 \u0060baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:2672\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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":2672}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5edaed36edc6c2e9eb27a6e57331c94fa93e3fb2565bd4d6634be0ce56f944"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/sdks/typescript/sdkgen_typescript_shared/src/emit/mod.rs:171-177 | baml_language/sdks/typescript/sdkgen_typescript_shared/src/emit/mod.rs:253-259 \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":"baml_language/sdks/typescript/sdkgen_typescript_shared/src/emit/mod.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4517acafa64a2f98fb8f41f5db97bfbae5779a9da42d79a5b819a9d30033ebdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/baml-compiler/src/hir/dump.rs:604-610 | engine/baml-compiler/src/hir/dump.rs:638-644 \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 \u0060engine/baml-compiler/src/hir/dump.rs:604\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":"engine/baml-compiler/src/hir/dump.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"f238e868daa3d469a89054041a52eaec832515dd7538404c98afbc8a29d57dc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/baml-compiler/src/thir.rs:457-463 | engine/baml-lib/baml-types/src/expr.rs:497-503 \u2014 before extracting anything, compare \u0060engine/baml-compiler/src/thir.rs\u0060 and \u0060engine/baml-lib/baml-types/src/expr.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-compiler/src/thir.rs:457\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":"engine/baml-compiler/src/thir.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"5588f39176190d55e0207db0aac439c14a23de64f9a83211faa122cc53644f6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/baml-lib/ast/src/ast/baml_vis/graph.rs:448-454 | engine/baml-lib/ast/src/ast/baml_vis/graph.rs:623-629 \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":"engine/baml-lib/ast/src/ast/baml_vis/graph.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee27319d97c3565183dce0709dca2e0e623fc74f7d9093d30abd761ff173facb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:261-267 | engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:298-304 \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 \u0060engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:261\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eedcc228877f54099ad84ec166739225b46fa9fae5b9ccddede3219dbbd4180"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/baml-lib/baml-types/src/expr.rs:501-507 | engine/baml-lib/baml-types/src/expr.rs:520-526 \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":"engine/baml-lib/baml-types/src/expr.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aca59dedba8858fc8bb49b4fa378fb5945876e2c2bfd139f7eb15577c123592"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/baml-lib/llm-client/src/clients/helpers.rs:491-497 | engine/baml-lib/llm-client/src/clients/helpers.rs:791-797 \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 \u0060engine/baml-lib/llm-client/src/clients/helpers.rs:491\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":"engine/baml-lib/llm-client/src/clients/helpers.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f410f87333a33b743e3bb93c0ab7c9d2d4c08f419dd6347d9dfbf949ba76f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/baml-lib/llm-client/src/clients/openai.rs:198-204 | engine/baml-lib/llm-client/src/clients/vertex.rs:305-311 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/llm-client/src/clients/openai.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f67187f63ab5da97d49d3262b1692087fcfaaa52c6e0f3b4d408c8e0acf5676"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/google/response_handler.rs:51-57 | engine/baml-runtime/src/internal/llm_client/primitive/request.rs:470-476 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/internal/llm_client/primitive/google/response_handler.rs:51\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/google/response_handler.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a131e6ce7d3365d5d79cffcb6e19d932ac2030282283c5c3d2c7858c0a7bc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/generators/utils/dir_writer/src/lib.rs:182-189 | engine/generators/utils/dir_writer/src/lib.rs:198-205 \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":"engine/generators/utils/dir_writer/src/lib.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"a944c2350047ed89924ff8354e64465e8991fcca9eeaa9e3f8a47089673647b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:246-252 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:693-699 \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 \u0060engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:246\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":"engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c170e2b6cd6fc1fe5f3166a36518347309965669d6b700b3b18b4ca9f08bef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 5): engine/baml-lib/llm-client/src/clients/helpers.rs:557-561 | engine/baml-lib/llm-client/src/clients/helpers.rs:581-585 | engine/baml-lib/llm-client/src/clients/helpers.rs:605-610 | engine/baml-lib/llm-client/src/clients/helpers.rs:628-632 | engine/baml-lib/llm-client/src/clients/helpers.rs:652-656 \u2014 all 5 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 \u0060engine/baml-lib/llm-client/src/clients/helpers.rs:557\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/llm-client/src/clients/helpers.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5aca22ef4b8fa6ca0246467808a58959958918c053bbc6ff651b98381fc1915"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:162-168 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:212-218 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:240-246 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:258-263 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:162\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"570ef0eb8d7536c54806049906e267ec2e41ec91980dc302c0a5a101a5dd6397"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): baml_language/crates/baml_compiler2_mir/src/lower.rs:8940-8945 | baml_language/crates/baml_compiler2_mir/src/lower.rs:8973-8978 | baml_language/crates/baml_compiler2_mir/src/lower.rs:9021-9026 | baml_language/crates/baml_compiler2_mir/src/lower.rs:9055-9060 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":8940}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea319e75689eb348ed82cf61469a6a210c38be94a47a8fe7ba93b3debef41ea7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): baml_language/crates/baml_compiler2_hir/src/item_data/classes.rs:67-72 | baml_language/crates/baml_compiler2_hir/src/item_data/functions.rs:426-431 | baml_language/crates/baml_compiler2_hir/src/item_data/type_aliases.rs:57-62 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir/src/item_data/classes.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e51f218027218ae3433d954f490610a6b42e0b296ede035b2bec3d86a6fcfa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): baml_language/crates/baml_compiler2_mir/src/lower.rs:9693-9698 | baml_language/crates/baml_compiler2_mir/src/lower.rs:11989-11997 | baml_language/crates/baml_compiler2_mir/src/lower.rs:12117-12122 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:9693\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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":9693}}}],"partialFingerprints":{"codehealthFindingId/v1":"4033453637514d4bf460696182d6bc4c0be0a15acde2bf009b6bba182c18d1ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): baml_language/crates/bex_vm/src/vm.rs:11853-11858 | baml_language/crates/bex_vm/src/vm.rs:11863-11868 | baml_language/crates/bex_vm/src/vm.rs:11873-11878 \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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":11853}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2e17b046bbcb8633f0f9399c19cc3b6c96222ed2a653aaf820c911ecc11bd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:920-925 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:998-1003 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:4674-4679 \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 \u0060baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:920\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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea3bfa88751e674f4281891dc88e9ad5f75e5ce3613e09a7ea01e2c7ef77e76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): engine/baml-compiler/src/thir/typecheck.rs:66-71 | engine/baml-compiler/src/thir/typecheck.rs:75-80 | engine/baml-compiler/src/thir/typecheck.rs:545-550 \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":"engine/baml-compiler/src/thir/typecheck.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"641512a3652103c9c69248e9701a826496215dde5891c05995828554b2699cbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1589-1594 | baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1947-1952 \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 \u0060baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1589\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":"baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs"},"region":{"startLine":1589}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bdd8bc621d238863d8844af66d8a9b051e7e686ee5362ba4155c608d3999a2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1948-1953 | baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:2001-2007 \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 \u0060baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs:1948\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":"baml_language/crates/baml_builtins2_codegen/src/codegen_io.rs"},"region":{"startLine":1948}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3c4b0ac6ca8f0daf4cbb915f7b9968a1adcb561e79369d68970899cd48543d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_builtins2_codegen/src/extract.rs:854-859 | baml_language/crates/baml_builtins2_codegen/src/extract.rs:1044-1049 \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 \u0060baml_language/crates/baml_builtins2_codegen/src/extract.rs:854\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_builtins2_codegen/src/extract.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"811775a2c6ef866add7050cc38d80b84228d7084e1afaa27a596537b2b48ba2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_cli/src/describe_command.rs:210-215 | baml_language/crates/baml_cli/src/describe_command.rs:232-237 \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 \u0060baml_language/crates/baml_cli/src/describe_command.rs:210\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":"baml_language/crates/baml_cli/src/describe_command.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41479b37b3d8dda65b8410a9ec40f129cb15f2b03770a1ab9cfee44e33ea12e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs:1103-1108 | baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs:1668-1673 \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 \u0060baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs:1103\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":"baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b86c5910bc109c90814fdbd6aa7160d090eff08d3921c9c5e7c54f8156562a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs:1595-1600 | baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs:1628-1633 \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 \u0060baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs:1595\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":"baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs"},"region":{"startLine":1595}}}],"partialFingerprints":{"codehealthFindingId/v1":"49380f08d0466056e576ee0c3896fc915c5afb4bad9549b3f215a426beb07412"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs:806-811 | baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs:965-970 \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 \u0060baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs:806\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":"baml_language/crates/baml_compiler2_ast/src/lower_tree/items.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dbb15d95b60d87e4d72a805f0f10ab03de88a8d2d425a2759d04a647ee1bd06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/baml_compiler2_hir/src/builder.rs:1178-1184 | baml_language/crates/baml_compiler2_hir/src/builder.rs:1355-1361 \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":"baml_language/crates/baml_compiler2_hir/src/builder.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b32447424d2858b1cef19a163fdae347522c99eb9678ad6af460a08db89bf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_compiler2_hir/src/builder.rs:1419-1424 | baml_language/crates/baml_compiler2_hir/src/builder.rs:1611-1616 \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 \u0060baml_language/crates/baml_compiler2_hir/src/builder.rs:1419\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":"baml_language/crates/baml_compiler2_hir/src/builder.rs"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c323d0572976ca78ef9f6a709d3ad82757b814c72b0eb0ce24555722a26871e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_compiler2_hir/src/contributions.rs:87-94 | baml_language/crates/baml_ide/src/export.rs:760-767 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_hir/src/contributions.rs:87\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060db\u0060 to \u0060\u0026\u0027db dyn crate::Db\u0060 in one and \u0060\u0026Db\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":"baml_language/crates/baml_compiler2_hir/src/contributions.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b25b674aa4b24a3566a65eeda71af61cef7960c29a094f8f099869968db50c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/impls.rs:2165-2170 | baml_language/crates/baml_compiler2_hir_ty/src/impls.rs:2173-2178 \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":"baml_language/crates/baml_compiler2_hir_ty/src/impls.rs"},"region":{"startLine":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb35105eaa2188e1ca2f68b98a36904fa959b827eb8519a5abcb23c08264f550"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:3191-3196 | baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:3212-3221 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:3191\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":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":3191}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f06cf77a2ff2ed6cd17908dd26a5e992eb0b93b07d09c8aeb5effa7d023fd66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 3): baml_language/crates/baml_compiler2_mir/src/lower.rs:9141-9146 | baml_language/crates/baml_compiler2_mir/src/lower.rs:9220-9223 | baml_language/crates/baml_compiler2_mir/src/lower.rs:9282-9287 \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 \u0060baml_language/crates/baml_compiler2_mir/src/lower.rs:9141\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":9141}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d181b43fc0a1bc8ca1d050b3d3a8fc00d2417e86479e115877c91b1e2125d0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): baml_language/crates/baml_db/src/check.rs:504-511 | baml_language/crates/baml_db/src/check.rs:631-637 \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":"baml_language/crates/baml_db/src/check.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2c8e0d9fa134980d2f4aeb35b46cb0aa79d9184bc11f5f4daf1ac062a9f7f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/declarations.rs:320-325 | baml_language/crates/baml_fmt/src/ast/types.rs:468-473 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_fmt/src/ast/declarations.rs\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/types.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_fmt/src/ast/declarations.rs:320\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":"baml_language/crates/baml_fmt/src/ast/declarations.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"3684a19d35e96f2932ebc982b3a8cbbdcb06b7ada06d98fab7fac6625ea734b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/declarations.rs:547-552 | baml_language/crates/baml_fmt/src/ast/declarations.rs:1088-1093 \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":"baml_language/crates/baml_fmt/src/ast/declarations.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89e00f8984ed6265316ea496765b067b485124ee0e8b82c2bc79a928cae258c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/declarations.rs:781-786 | baml_language/crates/baml_fmt/src/ast/declarations.rs:1130-1135 \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":"baml_language/crates/baml_fmt/src/ast/declarations.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b43318aeee3a18b0e874009dfcf22f0ffcb1173c877b6ac4fb4a1083c37fbed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/expressions.rs:362-367 | baml_language/crates/baml_fmt/src/ast/statements.rs:402-407 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/statements.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01bcbe6f6a883e1dfe3cfa90dc2372eaf937c348d8f33f9f3cc3a5a0f9931ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/expressions.rs:366-371 | baml_language/crates/baml_fmt/src/ast/types.rs:326-331 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/types.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"692cf80321b0fd9992f2a0c507a7d0edeae4d596f45cb06b1af4c56cd543522d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/expressions.rs:1989-1994 | baml_language/crates/baml_fmt/src/ast/pattern.rs:379-384 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":1989}}}],"partialFingerprints":{"codehealthFindingId/v1":"c016d0cab1563df53e1ff5818cd6eae1a158984002235d6a451efbb3b9766f3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/statements.rs:181-186 | baml_language/crates/baml_fmt/src/ast/statements.rs:223-228 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_fmt/src/ast/statements.rs:181\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":"baml_language/crates/baml_fmt/src/ast/statements.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"4979e58d417b55c3dea5e5a7d80094ac536ccf5a4cae1979d2a97ef2330a24af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_ide/src/annotations.rs:300-305 | baml_language/crates/baml_ide/src/annotations.rs:363-368 \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 \u0060baml_language/crates/baml_ide/src/annotations.rs:300\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/annotations.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc641728c29aefe30cb81769d3e10515509fd13211e2aae09a032361f05c870"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_ide/src/describe.rs:471-476 | baml_language/crates/baml_ide/src/describe.rs:527-532 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/describe.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8525eabc8023b402b76ad19fb06732d960ea638f402feed3388320f8b7e846"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_ide/src/describe.rs:1597-1602 | baml_language/crates/baml_ide/src/info.rs:1889-1894 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_ide/src/describe.rs:1597\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":"baml_language/crates/baml_ide/src/describe.rs"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9bd1944751b887e27c56d9398a0c246632ef04eaa2c4f9dcf11f11b942a9e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_ide/src/export.rs:1057-1062 | baml_language/crates/baml_ide/src/export.rs:1174-1179 \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 \u0060baml_language/crates/baml_ide/src/export.rs:1057\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":"baml_language/crates/baml_ide/src/export.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c870c6fd57aa6e592f73453dfc900728bdb36c0fbadfbb1f24d4d0ee24b912"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_ide/src/listing.rs:107-116 | baml_language/crates/baml_ide/src/listing.rs:126-131 \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 \u0060baml_language/crates/baml_ide/src/listing.rs:107\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":"baml_language/crates/baml_ide/src/listing.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60b312e0fe3e192cedd98d92daab266b36c3092199d3423e2159d9b13318ee9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_parser/src/items.rs:1283-1288 | baml_language/crates/baml_parser/src/items.rs:1427-1432 \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 \u0060baml_language/crates/baml_parser/src/items.rs:1283\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":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d26d39e0d9e4dccb497c34fd34e73270293d14b0be92a254700f379fd802b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_query_btel/src/functions.rs:1029-1034 | baml_language/crates/baml_query_btel/src/functions.rs:1521-1526 \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 \u0060baml_language/crates/baml_query_btel/src/functions.rs:1029\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":"baml_language/crates/baml_query_btel/src/functions.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"153f0a0fa83a277011ce44b3d66830ed046a699fcfe8b53f7f783b54ed12073c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_sdkgen_types/src/output_writer.rs:687-692 | baml_language/crates/baml_sdkgen_types/src/output_writer.rs:915-920 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_sdkgen_types/src/output_writer.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e119e6bee55e1aa0c7f59e2887208538fd52ac7f46ea476614ed6809ef2bd61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_type/src/decl_cycles.rs:290-295 | engine/baml-lib/parser-database/src/tarjan.rs:162-170 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_type/src/decl_cycles.rs:290\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":"baml_language/crates/baml_type/src/decl_cycles.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"240f612ddc4335850b2a2c12bb8cd996de42012eade37dbceb231bd98e3edf04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/baml_type/src/normalize/mu.rs:680-686 | baml_language/crates/baml_type/src/normalize/mu.rs:1410-1416 \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 \u0060baml_language/crates/baml_type/src/normalize/mu.rs:680\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":"baml_language/crates/baml_type/src/normalize/mu.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc0863a2feb001542e6f60bac633bcb15d34acf22400396643e41d08705546b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_type/src/normalize/mu.rs:1640-1649 | baml_language/crates/baml_type/src/normalize/mu.rs:1758-1767 \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 \u0060baml_language/crates/baml_type/src/normalize/mu.rs:1640\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":"baml_language/crates/baml_type/src/normalize/mu.rs"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fa07548ded4237f2056fe00939455e88a9317ec8476e8725a45754f1649548"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_type_macros/src/emit.rs:595-600 | baml_language/crates/baml_type_macros/src/emit.rs:848-853 \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 \u0060baml_language/crates/baml_type_macros/src/emit.rs:595\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":"baml_language/crates/baml_type_macros/src/emit.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"358b858680f9a85ca16aea3f21c61216c345f823e2fbf2555b0962cdd2d8a0fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): baml_language/crates/baml_type_macros/src/emit.rs:622-627 | baml_language/crates/baml_type_macros/src/emit.rs:636-642 \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 \u0060baml_language/crates/baml_type_macros/src/emit.rs:622\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. 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":"baml_language/crates/baml_type_macros/src/emit.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"511aae04f4777450e23da837c2e60a470261658e8d085a7d11e3fa60331d53d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_type_runtime/src/lib.rs:428-434 | baml_language/crates/baml_type_runtime/src/lib.rs:450-455 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_type_runtime/src/lib.rs:428\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":"baml_language/crates/baml_type_runtime/src/lib.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef82b6b71ef725f983a852dca1113e501152df24d5e9646397f41ffd55dc7238"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/bcs_api/src/api_keys.rs:85-90 | baml_language/crates/bcs_api/src/auth.rs:150-155 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bcs_api/src/api_keys.rs:85\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/crates/bcs_api/src/api_keys.rs:84\u0060 calls \u0060json\u0060 and \u0060baml_language/crates/bcs_api/src/auth.rs:149\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bcs_api/src/api_keys.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f36f37f35a685788771249de6af79f0a8e21b6630c9a977858d23400c034243"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/bex_events/src/history/mod.rs:245-250 | baml_language/crates/bridge_wasm/src/runs.rs:183-188 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_events/src/history/mod.rs:245\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":"baml_language/crates/bex_events/src/history/mod.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d979e1ee3183a4383998e1863be815bb7bfe07f7084a0d864c578921a0835a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs:71-76 | engine/baml-lib/jsonish/src/deserializer/coercer/array_helper.rs:41-46 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs\u0060 and \u0060engine/baml-lib/jsonish/src/deserializer/coercer/array_helper.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 98 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060res\u0060 to \u0060Vec\u003CResult\u003COption\u003CBamlValueWithFlags\u003C\u0027s, \u0027v, \u0027t, N\u003E\u003E, ParsingError\u003E\u003E\u0060 in one and \u0060\u0026[Result\u003CBamlValueWithFlags, ParsingError\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":"baml_language/crates/bex_sap/src/deserializer/coercer/array_helper.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f900b7a0ce10d8b33da02719ab1db858de6e5408efed281b071edc45565b39b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/entry.rs:175-180 | engine/baml-lib/jsonish/src/jsonish/parser/entry.rs:186-191 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/entry.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/entry.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/entry.rs:175\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/entry.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4683da5f3833bed51dee11fc2f224a15f2e390ac90673f0be313c3fd7672f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/value.rs:365-370 | engine/baml-lib/jsonish/src/jsonish/value.rs:305-310 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/value.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/value.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 164 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/value.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"151e21ba4d0b85061dde4234bf86d43b8abf98f4a39f3bd0914dcf80d9198514"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/bex_vm/src/package_baml/json/mod.rs:703-708 | baml_language/crates/bex_vm/src/package_baml/prompt.rs:109-114 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_vm/src/package_baml/json/mod.rs:703\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":"baml_language/crates/bex_vm/src/package_baml/json/mod.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d7d474b6ead0005109c1833815d693ea308bc239aada8d109d7684d29f62d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/bex_vm/src/vm/compiled_rt/heap.rs:81-86 | baml_language/crates/bex_vm/src/vm/compiled_rt/heap.rs:151-156 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm/compiled_rt/heap.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a39280485f3844daf1346259d5e442bb412cbe27ba1ac8108401fadf43ca21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/btel_processor/src/aggregate.rs:54-59 | baml_language/crates/btel_recorder/src/merge.rs:52-57 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/btel_processor/src/aggregate.rs:54\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":"baml_language/crates/btel_processor/src/aggregate.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfa4dedab63ac4b87d6f20a7c043a9caab2144a0b04a797fe31bb92af7b4715"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs:1474-1479 | baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs:1517-1522 \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 \u0060baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs:1474\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":"baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3273bb775d419ac5d759fa715b4b7bdea814fdf9a463a32b14abb861198809d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/sdks/cpp/sdkgen_cpp/src/naming.rs:545-552 | baml_language/sdks/go/sdkgen_go/src/names.rs:1399-1406 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdks/cpp/sdkgen_cpp/src/naming.rs:545\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":"baml_language/sdks/cpp/sdkgen_cpp/src/naming.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"60016629db5c76b9966cc88d8fe620ec7e16407fbae46368a5afef3c4f1506c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:2922-2927 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:3393-3398 \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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":2922}}}],"partialFingerprints":{"codehealthFindingId/v1":"1514215f1b620aee1a16d8d8d123711445abdd2bb3ee409cda4cfd4b5b2c6ead"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/sdks/java/sdkgen_java/src/emit.rs:628-633 | baml_language/sdks/java/sdkgen_java/src/emit.rs:646-655 \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 \u0060baml_language/sdks/java/sdkgen_java/src/emit.rs:628\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":"baml_language/sdks/java/sdkgen_java/src/emit.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"6934f30a6e2d48b0e6b85990bba928fef31a8bffcd4db6583233c23e1223b873"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/sdks/swift/rust/sdkgen_swift/src/lib.rs:508-513 | baml_language/sdks/swift/rust/sdkgen_swift/src/lib.rs:530-535 \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 \u0060baml_language/sdks/swift/rust/sdkgen_swift/src/lib.rs:508\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":"baml_language/sdks/swift/rust/sdkgen_swift/src/lib.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3539336ed35cfcbe697fef54f5e6a262591e2f74dacbb3e17898b926ef3a32e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/baml-lib/jsonish/src/deserializer/coercer/coerce_primitive.rs:228-233 | engine/baml-lib/jsonish/src/deserializer/coercer/coerce_primitive.rs:322-327 \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 \u0060engine/baml-lib/jsonish/src/deserializer/coercer/coerce_primitive.rs:228\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":"engine/baml-lib/jsonish/src/deserializer/coercer/coerce_primitive.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98230f52e03702064e01fc9211207544aef70445ad12146a642eed5cd2c7e48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/baml-lib/llm-client/src/clients/anthropic.rs:48-53 | engine/baml-lib/llm-client/src/clients/vertex.rs:284-289 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/baml-lib/llm-client/src/clients/vertex.rs:292\u0060 calls \u0060clone\u0060 and \u0060engine/baml-lib/llm-client/src/clients/anthropic.rs:56\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":"engine/baml-lib/llm-client/src/clients/anthropic.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2256907aac9c977ced97f943975fce750282e78a59590f5b58a1645fdfb877e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/baml-runtime/src/async_interpreter_runtime.rs:236-241 | engine/baml-runtime/src/async_vm_runtime.rs:456-465 \u2014 before extracting anything, compare \u0060engine/baml-runtime/src/async_interpreter_runtime.rs\u0060 and \u0060engine/baml-runtime/src/async_vm_runtime.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/async_interpreter_runtime.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26c33bd8a5e61526cf135efb428ebcb5c1b072eda1bc7f5c4305e62d5907ff9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/openai/response_handler.rs:304-309 | engine/baml-runtime/src/internal/llm_client/primitive/openai/response_handler.rs:766-771 \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 \u0060engine/baml-runtime/src/internal/llm_client/primitive/openai/response_handler.rs:304\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":"engine/baml-runtime/src/internal/llm_client/primitive/openai/response_handler.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"db19a80499817bd1a272243b44ee36ed8fc58c01cfd079d268a6bbfd7be13bbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): engine/baml-runtime/src/lib.rs:779-784 | engine/baml-runtime/src/lib.rs:787-791 \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 \u0060engine/baml-runtime/src/lib.rs:779\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/lib.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2f73e291ff7e3175b56b939f499eb05efa13e7fdae143e038f0b855c76d5f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/baml-runtime/src/type_builder/mod.rs:293-298 | engine/baml-runtime/src/type_builder/mod.rs:329-334 \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 \u0060engine/baml-runtime/src/type_builder/mod.rs:293\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":"engine/baml-runtime/src/type_builder/mod.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b219b987d09d17e89cb337831a92e906183284afadc387f86ddb90f6ed994c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/baml-schema-wasm/src/runtime_wasm/mod.rs:210-215 | engine/language_server/src/baml_project/mod.rs:410-415 \u2014 before extracting anything, compare \u0060engine/baml-schema-wasm/src/runtime_wasm/mod.rs\u0060 and \u0060engine/language_server/src/baml_project/mod.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 183 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-schema-wasm/src/runtime_wasm/mod.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac633dc4b4ffa41f6dabae600a37f8b30a032571eb78a16da30efbe52d2d645"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/baml_cffi_macros/src/lib.rs:1477-1482 | engine/baml_cffi_macros/src/lib.rs:1557-1566 \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 \u0060engine/baml_cffi_macros/src/lib.rs:1477\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":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5682ad3c9101f723686ae9908c2aaf3f22cd8e0131e7312ae3a80e14eb88903"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/cli/src/commands.rs:196-201 | engine/cli/src/commands.rs:203-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. 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":"engine/cli/src/commands.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5873ec6217de9bf5b663ce910518eecbe32d5729660200ca1bedf3f315617d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/generators/languages/go/src/ir_to_go/mod.rs:57-64 | engine/generators/languages/go/src/ir_to_go/mod.rs:229-236 \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 \u0060engine/generators/languages/go/src/ir_to_go/mod.rs:57\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":"engine/generators/languages/go/src/ir_to_go/mod.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa64a090c35f30e976681d78aead4d2b28bec1d0643d1bb6fdaa6953329a63e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/generators/languages/python/src/ir_to_py/mod.rs:66-73 | engine/generators/languages/python/src/ir_to_py/mod.rs:160-167 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/generators/languages/python/src/ir_to_py/mod.rs:66\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":"engine/generators/languages/python/src/ir_to_py/mod.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"080a5d591d5662fb1ecc86240289bcd3adc19bc5637377e321b2991849d376fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/generators/languages/python/src/watchers.rs:229-234 | engine/generators/languages/typescript/src/watchers.rs:217-222 \u2014 before extracting anything, compare \u0060engine/generators/languages/python/src/watchers.rs\u0060 and \u0060engine/generators/languages/typescript/src/watchers.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/generators/languages/python/src/watchers.rs:229\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":"engine/generators/languages/python/src/watchers.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd20ced10b1806e349fafdc4f75fdaf23086c07d0032682972c8f32a6c8afa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/generators/languages/typescript/src/ir_to_ts/mod.rs:51-58 | engine/generators/languages/typescript/src/ir_to_ts/mod.rs:148-155 \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 \u0060engine/generators/languages/typescript/src/ir_to_ts/mod.rs:51\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":"engine/generators/languages/typescript/src/ir_to_ts/mod.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"56cf3eca756162ca9fe1ae912b8b7698d6df86b75d3a253360e0d0d3f47af74b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): engine/language_client_cffi/src/ctypes/baml_value_encode.rs:176-180 | engine/language_client_cffi/src/ctypes/object_response_encode.rs:70-75 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/language_client_cffi/src/ctypes/baml_value_encode.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. 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":"engine/language_client_cffi/src/ctypes/baml_value_encode.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97589e026538887e1481208e2f4c5a81bda494b16439d0d1174198c973fd33d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/language_client_cffi/src/ffi/objects.rs:40-46 | engine/language_client_cffi/src/raw_ptr_wrapper.rs:37-43 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"engine/language_client_cffi/src/ffi/objects.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1e2957572c2f42061ed1f1bed5822afa7f4e77cb93884d415b00afc29369e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): languages/rust/baml/src/raw_objects/mod.rs:219-224 | languages/rust/baml/src/raw_objects/mod.rs:470-475 \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 \u0060languages/rust/baml/src/raw_objects/mod.rs:219\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":"languages/rust/baml/src/raw_objects/mod.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"482347b1e40da4fe044510385e41f8ec94d19b9b239a87767a99aa2938506c96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): languages/rust/baml/src/runtime.rs:124-129 | languages/rust/baml/src/runtime.rs:246-251 \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 \u0060languages/rust/baml/src/runtime.rs:124\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":"languages/rust/baml/src/runtime.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c280a20b0312aab3041a704820915ac632188bf4ef1e1a4b5b62666420eba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 10): engine/baml_cffi_macros/src/lib.rs:860-864 | engine/baml_cffi_macros/src/lib.rs:877-880 | engine/baml_cffi_macros/src/lib.rs:896-900 | engine/baml_cffi_macros/src/lib.rs:915-919 | engine/baml_cffi_macros/src/lib.rs:949-953 | engine/baml_cffi_macros/src/lib.rs:978-982 | engine/baml_cffi_macros/src/lib.rs:1012-1016 | engine/baml_cffi_macros/src/lib.rs:1046-1050 | engine/baml_cffi_macros/src/lib.rs:1097-1101 | engine/baml_cffi_macros/src/lib.rs:1131-1135 \u2014 all 10 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 \u0060engine/baml_cffi_macros/src/lib.rs:860\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd749aa24c10a2ba54e725a5403560c3d7ff22dec1d4c8d67ce4e1f90c98105"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): baml_language/crates/baml_lsp/src/dispatch/requests.rs:413-417 | baml_language/crates/baml_lsp/src/dispatch/requests.rs:592-596 | baml_language/crates/baml_lsp/src/dispatch/requests.rs:684-688 | baml_language/crates/baml_lsp/src/dispatch/requests.rs:787-791 | baml_language/crates/baml_lsp/src/dispatch/requests.rs:809-813 \u2014 all 5 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":"baml_language/crates/baml_lsp/src/dispatch/requests.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d72250d495b9562466942b968056c2737a833fb5739ed7b92beb40cf422d97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): baml_language/crates/baml_type_macros/src/emit.rs:322-326 | baml_language/crates/baml_type_macros/src/emit.rs:589-593 | baml_language/crates/baml_type_macros/src/emit.rs:803-807 | baml_language/crates/baml_type_macros/src/emit.rs:842-846 \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 \u0060baml_language/crates/baml_type_macros/src/emit.rs:322\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":"baml_language/crates/baml_type_macros/src/emit.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"6349fb3a2065a89796ced3464729255871e075c2248cb08fde33ca450bd6dc19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:188-192 | baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:386-390 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:216-220 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:413-417 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 586 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:188\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":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8c9b95034cb060865bb97970aa3774befe7a1064daf219ed6d005a66c7fbbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs:784-788 | baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs:1350-1354 | baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs:1778-1782 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/lower_tree/body.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac91a0387b6e64e3a6bddfa928cfab42474710db78de22ceed91b2078280db57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:5273-5286 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:5421-5425 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:5440-5444 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":5273}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc1dea4262a07b10e7144895efc37cc4d23786f766a802ccc08f7dae0d211f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:999-1003 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:4436-4440 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:4675-4679 \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 \u0060baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:999\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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"9929d709dce42153f8cf5d75d36a0b911bf436bdea16cb25181ea8a31d6eb835"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): engine/baml-lib/baml-types/src/baml_value.rs:548-552 | engine/baml-lib/baml-types/src/baml_value.rs:687-691 | engine/baml-lib/baml-types/src/baml_value.rs:823-827 \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 \u0060engine/baml-lib/baml-types/src/baml_value.rs:548\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":"engine/baml-lib/baml-types/src/baml_value.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e4c57ed5358ef186cf5b6cb0c1e4ff84115a0a35910a8c1fd4c9fa2997c036"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): engine/baml-lib/llm-client/src/clients/google_ai.rs:145-149 | engine/baml-lib/llm-client/src/clients/openai.rs:200-204 | engine/baml-lib/llm-client/src/clients/vertex.rs:307-311 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ctx\u0060 to \u0060\u0026EvaluationContext\u003C\u0027_\u003E\u0060 in one and \u0060\u0026impl GetEnvVar\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":"engine/baml-lib/llm-client/src/clients/google_ai.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb16c7554d5bb5904fa62b48b2040f624c4bd1f85c262680257ed70889193568"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): engine/baml-lib/parser-database/src/names/mod.rs:47-51 | engine/baml-lib/parser-database/src/names/mod.rs:68-72 | engine/baml-lib/parser-database/src/names/mod.rs:87-91 \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":"engine/baml-lib/parser-database/src/names/mod.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b430853d0998c92ca26a389713ec2ace7a77673d50a25e65e399a2ad73280efc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): engine/baml-runtime/src/internal/llm_client/primitive/openai/response_handler.rs:477-482 | engine/baml-runtime/src/internal/llm_client/primitive/openai/response_handler.rs:834-839 | engine/baml-runtime/src/internal/llm_client/primitive/openai/response_handler.rs:887-892 \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":"engine/baml-runtime/src/internal/llm_client/primitive/openai/response_handler.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2f4b84ffb8c00c16609224fb0ec6512712f49acff0e78a7a8cc24f1ff44f50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/baml_base/src/qualified_name.rs:225-229 | baml_language/crates/baml_base/src/qualified_name.rs:231-235 \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":"baml_language/crates/baml_base/src/qualified_name.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"948cd4b347a4ba8c71bdac474f3083ceb9636f72ee7cf6e86b292015f115f3a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/baml_compiler2_hir/src/semantic_index.rs:309-313 | baml_language/crates/baml_compiler2_hir/src/semantic_index.rs:335-339 \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 \u0060baml_language/crates/baml_compiler2_hir/src/semantic_index.rs:309\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":"baml_language/crates/baml_compiler2_hir/src/semantic_index.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"971acec3ed38431da8b07dcc92d4c199966436c98cc42c499b7238b258730092"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:66-71 | baml_language/crates/baml_type/src/unify.rs:159-164 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs\u0060 and \u0060baml_language/crates/baml_type/src/unify.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 452 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca9d8db0a7f5e59bdfff7c104a2bd301ad9e1ddcd3242035757156cd5dfede0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:591-600 | baml_language/crates/baml_type/src/unify.rs:1106-1115 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs\u0060 and \u0060baml_language/crates/baml_type/src/unify.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 452 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f8f89dc95955220c910db45cc995cd4b5ce92297cde853d66e9aeeded7665e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs:1006-1010 | baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs:1014-1018 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs:1006\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":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"968a8d377b4fe043b5fb6c62891125f4a3eb507ef05ab2142d6c68dbfe13a798"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:2695-2700 | baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:2707-2712 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/lower.rs:2695\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":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":2695}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3c5df9c6af3adb8f99dcd010fdc0789dd61bdcb23a98d614759fdd84bd19a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/escape.rs:1860-1865 | baml_language/crates/baml_compiler2_mir/src/escape.rs:1875-1879 \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 \u0060baml_language/crates/baml_compiler2_mir/src/escape.rs:1860\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":"baml_language/crates/baml_compiler2_mir/src/escape.rs"},"region":{"startLine":1860}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88716a05c7ab1a72fa636af16bcce82358b80e791c6530813a1e1db5c2c605f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/lower.rs:8600-8606 | baml_language/crates/baml_compiler2_mir/src/lower.rs:8623-8629 \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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":8600}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f889978fc6b2b89d82e9fb9a8c9bc744774b10c4f7beb7d67bcd55125037e19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/optimize/values.rs:289-293 | baml_language/crates/baml_compiler2_mir/src/optimize/values.rs:336-340 \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 \u0060baml_language/crates/baml_compiler2_mir/src/optimize/values.rs:289\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":"baml_language/crates/baml_compiler2_mir/src/optimize/values.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee2f10e176e86f92ed0567d80305109ddb48088f263f35b72b4f4ac25d28830"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/declarations.rs:646-651 | baml_language/crates/baml_fmt/src/ast/declarations.rs:1027-1032 \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 \u0060baml_language/crates/baml_fmt/src/ast/declarations.rs:646\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":"baml_language/crates/baml_fmt/src/ast/declarations.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c36bef75222676fa059db37d6f1b5b1d5c5a41303360680e959b97582851aeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/declarations.rs:1139-1143 | baml_language/crates/baml_fmt/src/ast/statements.rs:589-593 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/declarations.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"7987c6e38d6101ff775b02d307c4e84e707df9ffea738bb2911a5d63c25f0abd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/expressions.rs:379-383 | baml_language/crates/baml_fmt/src/ast/types.rs:104-108 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/types.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"f934d3ee2bcec6677bb06b602f4fafb398a30c39af3c853928d16f6500e5eb7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/expressions.rs:2067-2072 | baml_language/crates/baml_fmt/src/ast/pattern.rs:333-338 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060id\u0060 to \u0060Id\u003CArrayLiteral\u003E\u0060 in one and \u0060Id\u003CArrayPattern\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":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":2067}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d729c4aacf594ca1f2c19f71c11d04c78effc3f100efa4e6d05831822012d55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/pattern.rs:531-535 | baml_language/crates/baml_fmt/src/ast/types.rs:151-155 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_fmt/src/ast/pattern.rs\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/types.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/pattern.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3a058046eedcfcae3493b18bcb4701fd00f83ac7a485ace4beabc9270dbc64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/baml_lsp/src/dispatch/requests.rs:372-376 | baml_language/crates/baml_lsp/src/dispatch/requests.rs:860-864 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060params\u0060 to \u0060lsp_types::DocumentFormattingParams\u0060 in one and \u0060lsp_types::CodeLensParams\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":"baml_language/crates/baml_lsp/src/dispatch/requests.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48f0aa6f824d2ba3dad840aa16d4a8eb3412a9cbbf76224e9f9f702acbe197a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/baml_parser/src/items.rs:1309-1313 | baml_language/crates/baml_parser/src/items.rs:1453-1457 \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 \u0060baml_language/crates/baml_parser/src/items.rs:1309\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":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0ed2f7c29e9d1dd6e6adbb00208195d83955d53bbe52f53396cd50c798c89c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_query_btel/src/sql.rs:761-766 | baml_language/crates/baml_query_btel/src/sql.rs:782-787 \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 \u0060baml_language/crates/baml_query_btel/src/sql.rs:761\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":"baml_language/crates/baml_query_btel/src/sql.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a087207a6e3d293f9f7a15ccad93990be1b1a8e159324b091d75d834719cd50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/baml_type_macros/src/emit.rs:159-163 | baml_language/crates/baml_type_macros/src/emit.rs:199-203 \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 \u0060baml_language/crates/baml_type_macros/src/emit.rs:159\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":"baml_language/crates/baml_type_macros/src/emit.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"75cbca0e08ffda8ff63d9c216461eb718fb633b52e4eae219f1b16a2415f8770"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:146-150 | baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs:463-467 \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 \u0060baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.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":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_primitive.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"437127e5d8beac69336a07725fd10c0026896ada744e8fa925a92dc47e30922a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/bex_vm/src/package_baml/json/encode.rs:363-367 | baml_language/crates/bex_vm/src/package_baml/root.rs:331-335 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_vm/src/package_baml/json/encode.rs:363\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":"baml_language/crates/bex_vm/src/package_baml/json/encode.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90eb527737f89a3087c797d0f6cd18634320deb44bbcc647329bca4b9cd99bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/bex_vm/src/vm.rs:4640-4644 | baml_language/crates/bex_vm/src/vm.rs:10395-10399 \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 \u0060baml_language/crates/bex_vm/src/vm.rs:4640\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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":4640}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f91b1093c5828a02f9bfb9538343d92112610c1853c3d911fa0da56a8646a49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/bex_vm/src/vm.rs:11257-11264 | baml_language/crates/bex_vm/src/vm.rs:11293-11297 \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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":11257}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6c25423a3452ea0ab4eb832fe048a61d3424d0b44f90b4fe0ee68d478d69b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/bex_vm/src/vm/compiled_rt/heap.rs:256-261 | baml_language/crates/bex_vm/src/vm/compiled_rt/heap.rs:306-311 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm/compiled_rt/heap.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7cc2a276e92c40addc6982f683e4eee78889815e6b47a872f85a971d6b47d0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/bex_vm_types/src/bytecode.rs:2874-2880 | baml_language/crates/bex_vm_types/src/bytecode.rs:2892-2896 \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 \u0060baml_language/crates/bex_vm_types/src/bytecode.rs:2874\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":"baml_language/crates/bex_vm_types/src/bytecode.rs"},"region":{"startLine":2874}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f1e6b3a15fcd46868a3bae76214596c69966eb7487dd9015a8ba68cf82da91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/bex_vm_types/src/head_walk.rs:33-37 | baml_language/crates/bex_vm_types/src/head_walk.rs:107-111 \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 \u0060baml_language/crates/bex_vm_types/src/head_walk.rs:33\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":"baml_language/crates/bex_vm_types/src/head_walk.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"01261277972f4e982aee704d8f8321c30c16895b746073cb5cbc9414ac1c5e04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/bex_vm_types/src/type_head.rs:236-242 | baml_language/crates/bex_vm_types/src/type_head.rs:277-283 \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 \u0060baml_language/crates/bex_vm_types/src/type_head.rs:236\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":"baml_language/crates/bex_vm_types/src/type_head.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"020cfb5c1286bf4f7ebef244a6fbb06bdc16f1c2704f4915fd191c669a56f05a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/bex_vm_types/src/types/object.rs:572-577 | engine/baml-vm/src/types.rs:410-415 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_vm_types/src/types/object.rs:572\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":"baml_language/crates/bex_vm_types/src/types/object.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b52884683baec2ef5cb5aa4e49bb05d60b60fb94929eb86e15ee9177eb28347"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/bex_vm_types/src/types/value.rs:285-289 | baml_language/crates/bex_vm_types/src/types/value.rs:317-321 \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":"baml_language/crates/bex_vm_types/src/types/value.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ab199c83d08cae5e47ae7732d14539b89fdbd836981bf290afeebf557d816c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/bridge_ctypes/src/value_encode.rs:60-66 | baml_language/crates/bridge_ctypes/src/value_encode.rs:259-265 \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 \u0060baml_language/crates/bridge_ctypes/src/value_encode.rs:60\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":"baml_language/crates/bridge_ctypes/src/value_encode.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb997a15030bd34df72d71a0ac936e8ce2fa24b322977eceb6aebe54dadfbd6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/bridge_encode/src/plan.rs:358-362 | baml_language/crates/bridge_encode/src/plan.rs:369-373 \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":"baml_language/crates/bridge_encode/src/plan.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"5166a3fd59739c6713a1763e55122ae00672f6ece964f65184fb0f55a0c32681"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/tools_stow/src/main.rs:754-758 | baml_language/crates/tools_stow/src/main.rs:1064-1068 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/tools_stow/src/main.rs:754\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":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed18c2e1303ac0aa202bc1534fee426718d8fb2252408523d3a07e036bcf28fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/sdks/go/sdkgen_go/src/names.rs:739-744 | baml_language/sdks/go/sdkgen_go/src/names.rs:867-872 \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":"baml_language/sdks/go/sdkgen_go/src/names.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d82785bf54d5fd28232c15a930565aa31d9acd101793cc75025a04df55eccc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/sdks/rust/sdkgen_rust/src/emit/function.rs:713-717 | baml_language/sdks/typescript/sdkgen_typescript_shared/src/emit/mod.rs:210-214 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdks/rust/sdkgen_rust/src/emit/function.rs:713\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":"baml_language/sdks/rust/sdkgen_rust/src/emit/function.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"817e3f00144daff8fdaa7c9825c0c865112a976e1d66937bc866d82a9d82b805"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/sdks/rust/sdkgen_rust/src/lib.rs:352-357 | baml_language/sdks/swift/rust/sdkgen_swift/src/lib.rs:180-185 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/rust/sdkgen_rust/src/lib.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d14cf2d0a05d9b0ce7bba4bccd66088f2f31e751c8ea13ae3a8fdeb5cca699e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/baml-compiler/src/hir/dump.rs:222-226 | engine/baml-compiler/src/hir/dump.rs:240-244 \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 \u0060engine/baml-compiler/src/hir/dump.rs:222\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/baml-compiler/src/hir/dump.rs:245\u0060 calls \u0060Break\u0060, \u0060text\u0060, \u0060Continue\u0060 and \u0060engine/baml-compiler/src/hir/dump.rs:227\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/hir/dump.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"890931f83f61065386a3926285d872f64ff5dc3385164b293c82c47f53fec5d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/baml-compiler/src/hir/dump.rs:341-347 | engine/baml-compiler/src/hir/dump.rs:391-397 \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":"engine/baml-compiler/src/hir/dump.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6004dc4f4bf790d4b39b25449550ba9e50473fdc8c747499cd8a79bd410e4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/baml-compiler/src/thir/interpret.rs:421-425 | engine/baml-runtime/src/async_interpreter_runtime.rs:870-874 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-compiler/src/thir/interpret.rs:421\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":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0729c2984e0a9009356f4b43d6961b3fa1624eb959c7fe0dcbf63cbb3bfcdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:288-293 | engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:818-822 \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 \u0060engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:288\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":"engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c3adf51cc83215defeb0d5123af4291340d5d25427067993b17b2fb7c69528"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:651-655 | engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:665-669 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:651\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3e6433c2749de050f270ccc6a58242415fe9799b841f85c0e7f950d89831e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/baml-lib/baml-types/src/expr.rs:678-683 | engine/baml-lib/baml-types/src/expr.rs:796-801 \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 \u0060engine/baml-lib/baml-types/src/expr.rs:678\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":"engine/baml-lib/baml-types/src/expr.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a12647e8e4db98304f613f1babe30ff0029a618d1d675a27a3938e4506def8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/baml-lib/jsonish/src/deserializer/score.rs:15-19 | engine/baml-lib/jsonish/src/deserializer/types.rs:152-156 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/jsonish/src/deserializer/score.rs:15\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":"engine/baml-lib/jsonish/src/deserializer/score.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"08cdb06c2c2890600ac2d557e3cbb8eea9817f5275150f85fab5c03a0fe5381a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 3): engine/baml-lib/llm-client/src/clients/anthropic.rs:157-161 | engine/baml-lib/llm-client/src/clients/aws_bedrock.rs:403-404 | engine/baml-lib/llm-client/src/clients/openai.rs:206-210 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/llm-client/src/clients/anthropic.rs:157\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060ctx\u0060 to \u0060\u0026EvaluationContext\u003C\u0027_\u003E\u0060 in one and \u0060\u0026impl GetEnvVar\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/baml-lib/llm-client/src/clients/anthropic.rs:154\u0060 calls \u0060entry\u0060, \u0060to_string\u0060, \u0060or_insert_with\u0060 and \u0060engine/baml-lib/llm-client/src/clients/openai.rs:204\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":"engine/baml-lib/llm-client/src/clients/anthropic.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd87ac4102d549133fd6c12ea9c72bb401602fe2bb915e0307a9e91c288f5512"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/baml-lib/llm-client/src/clients/fallback.rs:55-62 | engine/baml-lib/llm-client/src/clients/round_robin.rs:57-64 \u2014 before extracting anything, compare \u0060engine/baml-lib/llm-client/src/clients/fallback.rs\u0060 and \u0060engine/baml-lib/llm-client/src/clients/round_robin.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/llm-client/src/clients/fallback.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2ac9d795ae71b2754a95c4de2a0fb43bdae4280b17d17daccf40a34868a7ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/baml-runtime/src/tracing/threaded_tracer.rs:330-334 | engine/baml-runtime/src/tracing/threaded_tracer.rs:338-342 \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 \u0060engine/baml-runtime/src/tracing/threaded_tracer.rs:330\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":"engine/baml-runtime/src/tracing/threaded_tracer.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"83154e7a3629aff2114cbaf77a618f0806f7dd59f728fc5084a65b62d370eef2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): engine/baml-runtime/src/tracingv2/storage/storage.rs:311-315 | engine/baml-runtime/src/tracingv2/storage/storage.rs:317-321 | engine/baml-runtime/src/tracingv2/storage/storage.rs:323-328 \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":"engine/baml-runtime/src/tracingv2/storage/storage.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"793182c23d6ac160aa9ee5ad2c5fcc5cfdac431ee7b7e400bacd8f491dc7ee0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): engine/baml-runtime/src/tracingv2/storage/storage.rs:771-775 | engine/baml-runtime/src/tracingv2/storage/storage.rs:777-781 | engine/baml-runtime/src/tracingv2/storage/storage.rs:783-788 \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":"engine/baml-runtime/src/tracingv2/storage/storage.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ce76718caccc89d76ee14cc895e7f0c8ac116e84cd0f2c0c3344ae5f4ff0eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/baml_cffi_macros/src/lib.rs:302-308 | engine/baml_cffi_macros/src/lib.rs:369-375 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml_cffi_macros/src/lib.rs:302\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":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"8329007141c2ec9bcb57dcd46290c4c71c90fdf3c4eb565655885065101ddaba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/baml_cffi_macros/src/lib.rs:821-826 | engine/baml_cffi_macros/src/lib.rs:1246-1251 \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 \u0060engine/baml_cffi_macros/src/lib.rs:821\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":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1f2451c8a49aaa766ec160deb85b1bfcecda30ebd3de1a427b67432a36c2d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/generators/languages/go/src/type.rs:129-134 | engine/generators/languages/go/src/type.rs:180-185 \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":"engine/generators/languages/go/src/type.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d75a0617683f4d7b91cfe681ac7749c5250a820f5cc0563530aaecc55afc7cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/language_server/src/server/api/diagnostics.rs:335-339 | engine/language_server/src/server/api/diagnostics.rs:351-355 \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 \u0060engine/language_server/src/server/api/diagnostics.rs:335\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":"engine/language_server/src/server/api/diagnostics.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7677f5243fbec682656f3dd1e12b75251f9716e90a7935fb585c27a77cbc3b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): baml_language/sdks/typescript/sdkgen_typescript_shared/src/sdkgen_typescript.rs:14-44 | baml_language/sdks/typescript/sdkgen_typescript_shared/src/sdkgen_typescript_web.rs:17-47 \u2014 before extracting anything, compare \u0060baml_language/sdks/typescript/sdkgen_typescript_shared/src/sdkgen_typescript.rs\u0060 and \u0060baml_language/sdks/typescript/sdkgen_typescript_shared/src/sdkgen_typescript_web.rs\u0060 as WHOLE FILES: 85% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdks/typescript/sdkgen_typescript_shared/src/sdkgen_typescript.rs:14\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":"baml_language/sdks/typescript/sdkgen_typescript_shared/src/sdkgen_typescript.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95617dad3e52441116861586ff899dc7d0bbc368c5c64b5616c9208b30df1d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/baml-lib/ast/src/ast/config.rs:44-58 | engine/baml-lib/ast/src/ast/template_string.rs:49-79 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/ast/src/ast/config.rs:44\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":"engine/baml-lib/ast/src/ast/config.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33a96447776cd0570ce3c9bc15c0cb75c6c38f88adcd5e73e14986fb1e75c4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/baml_compiler2_emit/src/analysis.rs:2091-2097 | baml_language/crates/baml_compiler2_emit/src/stack_carry.rs:1263-1269 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/analysis.rs"},"region":{"startLine":2091}}}],"partialFingerprints":{"codehealthFindingId/v1":"2875cb7958b476fbb3d58d4eedc919a02546682560a5531b7b946de53ba10652"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_compiler2_emit/src/analysis.rs:2099-2104 | baml_language/crates/baml_compiler2_emit/src/stack_carry.rs:1256-1261 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_emit/src/analysis.rs"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"386bf0f85ddef55ba55e59b9581822e539e5ea016c75e82cf55c77f269b10502"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_compiler2_hir/src/namespace.rs:171-176 | baml_language/crates/baml_compiler2_hir/src/package.rs:383-388 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir/src/namespace.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd4c984d2319a1280196a35f80100f5e6706895c7932dbaaae4f7837c274a7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:566-576 | baml_language/crates/baml_type/src/unify.rs:1077-1087 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs\u0060 and \u0060baml_language/crates/baml_type/src/unify.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 452 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:566\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":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16725ebc401c1a7bba0fd7eeefcec28be0bf40767bdd32f77132202f1020fdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:914-920 | baml_language/crates/baml_compiler2_hir_ty/src/interfaces/coherence.rs:27-33 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs\u0060 and \u0060baml_language/crates/baml_compiler2_hir_ty/src/interfaces/coherence.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"79dc2d5d3c2406b3b42e6ee68f8f613c670d62abc75f7a90f537a196a460ad7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs:1125-1130 | baml_language/crates/baml_compiler2_hir_ty/src/interfaces/coherence.rs:362-367 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs\u0060 and \u0060baml_language/crates/baml_compiler2_hir_ty/src/interfaces/coherence.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d5362d7c3883a9c495534618ab9e828834bfcb65d6ec5d206d8137b069b705"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/impls.rs:464-476 | baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs:1583-1597 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_hir_ty/src/impls.rs:464\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":"baml_language/crates/baml_compiler2_hir_ty/src/impls.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba0fef4c5c60c7ee87f5f8a9f27d4ec5f75a475b5a339241db818684ae69bd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/package_interface.rs:997-1003 | baml_language/crates/baml_lsp_server/src/playground_btel.rs:403-409 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/package_interface.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a3a41425886d4f2592cd004759b8d7ae2cde95bcd57c2e40817a5a06b0a577"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:594-602 | engine/baml-runtime/src/control_flow/flatten/step3_inline_implicit_nodes.rs:82-90 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs\u0060 and \u0060engine/baml-runtime/src/control_flow/flatten/step3_inline_implicit_nodes.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 132 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:594\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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8b2b672e597209376384c2239fe3ff447edc642018a238ea1f8a37d2669dd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:654-660 | engine/baml-runtime/src/control_flow/flatten/step3_inline_implicit_nodes.rs:119-125 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs\u0060 and \u0060engine/baml-runtime/src/control_flow/flatten/step3_inline_implicit_nodes.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 132 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:654\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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23cfc370dc1981bd0ca687e4c0dc87752015ecac9c9d8afcf8bdc4e164cc385"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs:662-670 | engine/baml-runtime/src/control_flow/flatten/step3_inline_implicit_nodes.rs:131-139 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs\u0060 and \u0060engine/baml-runtime/src/control_flow/flatten/step3_inline_implicit_nodes.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 132 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/control_flow/flatten/step3_inline_implicit_nodes.rs:131\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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/flatten.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd75a2b7b3ffe4767f4af265affd02e286221a962f089c8a6724046c67e71e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:111-119 | engine/baml-compiler/src/viz_builder.rs:161-169 | engine/baml-runtime/src/control_flow.rs:422-430 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs\u0060 and \u0060engine/baml-runtime/src/control_flow.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb0ce893de2508b5393ccbaba321bf7d36f442f79ec209890e8092ee27fa29e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:132-141 | engine/baml-runtime/src/control_flow.rs:793-802 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs\u0060 and \u0060engine/baml-runtime/src/control_flow.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"44abe9d55b3b1f33e37f4eb2c24d89e3149524dd9dae369363afcda168bfd2a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/baml_compiler2_visualization/src/control_flow/mod.rs:454-462 | engine/baml-runtime/src/control_flow/flatten/mod.rs:75-83 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_visualization/src/control_flow/mod.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d06bc96bea9e739769270ca3e968db10e633e571ff655c38ff5ee70473182d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_lsp_server/src/playground_http.rs:63-68 | baml_language/crates/bridge_wasm/src/wasm_http.rs:800-805 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_lsp_server/src/playground_http.rs:63\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":"baml_language/crates/baml_lsp_server/src/playground_http.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"09af1afe78af3cfe1ae05f465222d5b46dae0be98f6ac6f63bdb3311bc079da2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/bex_chunkedringbuffer/src/sync.rs:21-27 | baml_language/crates/btel_ringbuffer/src/sync.rs:33-40 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_chunkedringbuffer/src/sync.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3630fc08ff0dcea5373ace875816fb8a5a162c1c7c93749d0b3f284fbf0feb61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/bex_engine/src/trace_value_encode.rs:698-706 | baml_language/crates/bridge_ctypes/src/ty_encode.rs:252-260 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/trace_value_encode.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2014f85b2ec7ba449ba110ad2d2edebd36d31a0ce52a6d1f917784dd5a456a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/coercer/coerce_array.rs:21-31 | engine/baml-lib/jsonish/src/deserializer/coercer/coerce_array.rs:18-28 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/deserializer/coercer/coerce_array.rs:21\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":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_array.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6a9fc6f55a3f297a9d8b7d05b47d5b5353fb7085110a77f4f462c9209ddd4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs:334-340 | engine/baml-lib/jsonish/src/deserializer/coercer/mod.rs:139-145 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs:334\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":"baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb93ca6d38bc9071d393ce17aba7d59fd5eb7b388861549c1bf9028ba252ca9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs:67-83 | engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs:71-87 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs\u0060 as WHOLE FILES: this scan already matched 19 separate duplicated blocks between them, totalling at least 586 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"93183b1d51a533578bb899772ebf9e807796cf167c286a545856b10bc91f6155"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/bex_vm_types/src/indexable.rs:64-71 | engine/baml-vm/src/indexable.rs:39-46 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm_types/src/indexable.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ee9be0b3b0514c9ec3c9aca221a4c7824fe3d75565b7ab54060bc6ce2150d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/bridge_wasm/src/wasm_io_fs.rs:42-48 | baml_language/crates/bridge_wasm/src/wasm_io_glob.rs:252-258 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_wasm/src/wasm_io_fs.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca467354a9eb7f318814dcce9a7ff02a3cf639eb29bbd7c79bf60d48deadc11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/bridge_wasm/src/wasm_io_glob.rs:167-172 | baml_language/crates/sys_native/src/io_impls.rs:1361-1366 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bridge_wasm/src/wasm_io_glob.rs:167\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_wasm/src/wasm_io_glob.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"2841ade2938192e66f4757b985e470115b5ac1cd72387453c3197362f44d6d81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/btel_file/src/publisher.rs:88-92 | baml_language/crates/btel_recorder/src/recording.rs:615-619 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_file/src/publisher.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f32c54e1a1d3e16cc51d8a5ff1dea6111f4a0d693a0c47fe8f4da79f566de2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/btel_snapshot/src/decode.rs:1454-1461 | baml_language/crates/btel_snapshot/src/tags.rs:119-126 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/btel_snapshot/src/decode.rs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e8634b4801f91b55838298cb215ed1827c100735865550e76143a9791b307d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/sys_ops/src/output_format.rs:1196-1201 | engine/baml-lib/jinja-runtime/src/output_format/types.rs:816-821 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_ops/src/output_format.rs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b4c2d0378e8feba390cfe18ccf2e29f384b952c9af2e326cf96d1e5d54d306"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/tools_size_gate/src/compare.rs:120-128 | baml_language/crates/tools_size_gate/src/main.rs:573-581 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/tools_size_gate/src/compare.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d57c92f53d333364da867cf95fb5916b265e9738276ca68e009c0805db9c2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/forks/aws-config/src/lib.rs:40-47 | baml_language/forks/google-cloud-auth/src/lib.rs:83-90 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/forks/aws-config/src/lib.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"031b2ae3f6519e405aa40d50f58ebcd0db61d6f8d8b3b06b74a8351706405f0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/forks/aws-config/src/profile.rs:43-49 | baml_language/forks/aws-config/src/providers.rs:230-235 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/forks/aws-config/src/profile.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8eb8ff037732d0662606feb3e3fc107a7969ad8753f1a574981ccc4e6607545"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/emit/method.rs:105-112 | baml_language/sdks/typescript/sdkgen_typescript_shared/src/emit/method.rs:68-75 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/emit/method.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a235ae9896ab5ca044746adc357b7cdd0c20861267d42f48390099bcf53cc88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/translate_ty.rs:349-356 | baml_language/sdks/typescript/sdkgen_typescript_shared/src/translate_ty.rs:264-271 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/translate_ty.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"03858de1881342e27f916be85be9632d4d4ce42b8eb1912f4d1a9359f89e14c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/baml-lib/ast/src/ast.rs:81-86 | engine/baml-lib/prompt-parser/src/ast.rs:35-40 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e02b55e4390afe1870c327b28e23b2d9a9f50c9c97dafbcd5ebd35b7ceb34d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/baml-lib/ast/src/ast/type_expression_block.rs:103-108 | engine/baml-lib/ast/src/ast/value_expression_block.rs:196-201 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/ast/src/ast/value_expression_block.rs:196\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/type_expression_block.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"17fc3d683a89b292aaa5543194e49268c3c0f2079d092da2abbfc02bef864557"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/baml-lib/ast/src/parser/parse.rs:21-32 | engine/baml-lib/prompt-parser/src/parser/parse_prompt.rs:12-23 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/parser/parse.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa279677bf0be372224d59461a2a274478bbd844e0974369f14a3b22557d857"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/baml-lib/jsonish/src/deserializer/types.rs:286-290 | engine/baml-lib/jsonish/src/lib.rs:290-294 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/baml-lib/jsonish/src/lib.rs:286\u0060 calls \u0060score\u0060, \u0060iter\u0060, \u0060meta\u0060 and \u0060engine/baml-lib/jsonish/src/deserializer/types.rs:285\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":"engine/baml-lib/jsonish/src/deserializer/types.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d47a6bf9c42294e5724898accc321be9f6b688255632ff733dbb0de57bca05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): engine/baml-lib/llm-client/src/clients/anthropic.rs:75-83 | engine/baml-lib/llm-client/src/clients/aws_bedrock.rs:141-149 | engine/baml-lib/llm-client/src/clients/google_ai.rs:74-82 | engine/baml-lib/llm-client/src/clients/vertex.rs:214-222 \u2014 before extracting anything, compare \u0060engine/baml-lib/llm-client/src/clients/anthropic.rs\u0060 and \u0060engine/baml-lib/llm-client/src/clients/google_ai.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/llm-client/src/clients/anthropic.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e397ce27372adac4e2a51f61731d2a7b54de2b8bef9d33b732836580f422f94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/baml-lib/llm-client/src/clients/fallback.rs:44-52 | engine/baml-lib/llm-client/src/clients/round_robin.rs:46-54 \u2014 before extracting anything, compare \u0060engine/baml-lib/llm-client/src/clients/fallback.rs\u0060 and \u0060engine/baml-lib/llm-client/src/clients/round_robin.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/llm-client/src/clients/fallback.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"94969a86fb41c5114524d533b9d3ff6c0b375f022bd41ca732e7ef335784df75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/baml-runtime/src/async_interpreter_runtime.rs:524-537 | engine/baml-runtime/src/async_vm_runtime.rs:828-841 \u2014 before extracting anything, compare \u0060engine/baml-runtime/src/async_interpreter_runtime.rs\u0060 and \u0060engine/baml-runtime/src/async_vm_runtime.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/async_interpreter_runtime.rs:524\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":"engine/baml-runtime/src/async_interpreter_runtime.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"354eab37859672c0684dd4c116946a6ce630968150657473effe11165c4ab7b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): engine/baml-runtime/src/async_interpreter_runtime.rs:634-650 | engine/baml-runtime/src/async_vm_runtime.rs:938-954 | engine/baml-runtime/src/lib.rs:678-694 \u2014 before extracting anything, compare \u0060engine/baml-runtime/src/async_interpreter_runtime.rs\u0060 and \u0060engine/baml-runtime/src/async_vm_runtime.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/async_interpreter_runtime.rs:634\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":"engine/baml-runtime/src/async_interpreter_runtime.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d9a5ee9d9f50ebf0207b01aedd72384c6bd50f7fd96ef00f282db9c8cfd103"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): engine/baml-runtime/src/async_interpreter_runtime.rs:687-702 | engine/baml-runtime/src/async_vm_runtime.rs:994-1009 \u2014 before extracting anything, compare \u0060engine/baml-runtime/src/async_interpreter_runtime.rs\u0060 and \u0060engine/baml-runtime/src/async_vm_runtime.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/async_interpreter_runtime.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be8176aed32e754bff78ea0ac3fd43a8f7475128490d0ffb0e46ef1f6a61013"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/baml-runtime/src/async_interpreter_runtime.rs:723-739 | engine/baml-runtime/src/async_vm_runtime.rs:1035-1051 \u2014 before extracting anything, compare \u0060engine/baml-runtime/src/async_interpreter_runtime.rs\u0060 and \u0060engine/baml-runtime/src/async_vm_runtime.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/async_interpreter_runtime.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"92893b0a4c15723191a5c4b1f8da87b9249d87d91f5f3513de6453fed8653fa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:481-485 | engine/baml-runtime/src/internal/llm_client/primitive/openai/openai_client.rs:950-954 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:481\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":"engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"26039a6b467777c492acaa378b4d4a0e42fd2eb24d3cc100a3e5b3b65e24a5fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): engine/baml-runtime/src/internal/llm_client/primitive/anthropic/response_handler.rs:14-19 | engine/baml-runtime/src/internal/llm_client/primitive/google/response_handler.rs:13-18 | engine/baml-runtime/src/internal/llm_client/primitive/openai/response_handler.rs:17-22 | engine/baml-runtime/src/internal/llm_client/primitive/vertex/response_handler.rs:13-18 \u2014 \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/response_handler.rs\u0060 and \u0060engine/baml-runtime/src/internal/llm_client/primitive/openai/response_handler.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 4 separate duplicated blocks between them, totalling at least 33 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/response_handler.rs:14\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":"engine/baml-runtime/src/internal/llm_client/primitive/anthropic/response_handler.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"74117c56b91e7eb17e9e83ae8dc638dd1ae4d023df8481866c684334146d2df3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs:301-311 | engine/baml-runtime/src/internal/llm_client/primitive/vertex/vertex_client.rs:439-449 \u2014 before extracting anything, compare \u0060engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs\u0060 and \u0060engine/baml-runtime/src/internal/llm_client/primitive/vertex/vertex_client.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 119 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9d97973f730644fb883a68e7a2667d53773370f1398f4d1a5297b510d133ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/openai/properties/mod.rs:11-22 | engine/baml-runtime/src/internal/llm_client/primitive/openai/properties/openai.rs:14-25 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/internal/llm_client/primitive/openai/properties/mod.rs:11\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":"engine/baml-runtime/src/internal/llm_client/primitive/openai/properties/mod.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"36891e5c248e35ee14a7451e81858f9a022ea89d1855850bc4986d7c2b5f3308"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/cli/src/deploy.rs:42-50 | engine/generators/utils/dir_writer/src/lib.rs:43-51 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/cli/src/deploy.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"906a827b89fc9a25a2990df58771fd9c123a08839d73f8e4c06b16eb1cc91ee9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): engine/generators/languages/go/src/package.rs:24-32 | engine/generators/languages/python/src/package.rs:38-46 | engine/generators/languages/typescript/src/package.rs:24-32 \u2014 before extracting anything, compare \u0060engine/generators/languages/go/src/package.rs\u0060 and \u0060engine/generators/languages/typescript/src/package.rs\u0060 as WHOLE FILES: 94% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 3 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/generators/languages/go/src/package.rs:34\u0060 calls \u0060current\u0060, \u0060last\u0060, \u0060unwrap\u0060 and \u0060engine/generators/languages/python/src/package.rs:48\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":"engine/generators/languages/go/src/package.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ace18270e60d4cbb1b4748f8e22e80b9009a514ec1f353f2c880f3694de7829"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): engine/generators/languages/go/src/package.rs:76-83 | engine/generators/languages/rust/src/package.rs:77-84 | engine/generators/languages/typescript/src/package.rs:68-75 \u2014 before extracting anything, compare \u0060engine/generators/languages/go/src/package.rs\u0060 and \u0060engine/generators/languages/rust/src/package.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/go/src/package.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac2a6d059bd19cfb328145dc94972e926aa9acdb90a1461f7bf0d961dc98882"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): engine/generators/languages/go/src/package.rs:93-102 | engine/generators/languages/python/src/package.rs:115-124 | engine/generators/languages/ruby/src/package.rs:117-126 | engine/generators/languages/rust/src/package.rs:94-103 | engine/generators/languages/typescript/src/package.rs:85-94 \u2014 before extracting anything, compare \u0060engine/generators/languages/go/src/package.rs\u0060 and \u0060engine/generators/languages/rust/src/package.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/go/src/package.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4dd3ed8a5fcf576bc91621ebc13f5f3f3fd51efdd0130540117584b52c1932"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): engine/generators/languages/go/src/utils.rs:1-9 | engine/generators/languages/python/src/utils.rs:1-9 | engine/generators/languages/ruby/src/utils.rs:1-9 | engine/generators/languages/rust/src/utils.rs:1-9 | engine/generators/languages/typescript/src/utils.rs:1-9 \u2014 before extracting anything, compare \u0060engine/generators/languages/go/src/utils.rs\u0060 and \u0060engine/generators/languages/python/src/utils.rs\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/go/src/utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"807c8507a07e44e0415082147fe6633c52532fb98736d7d57b951c7d07709850"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/language_client_cffi/src/ffi/objects.rs:21-25 | engine/language_client_cffi/src/raw_ptr_wrapper.rs:15-19 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_cffi/src/ffi/objects.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"576e988306624ebc022114fd78518dc64c8096b28d5add3f56353e000acfd8ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): engine/language_client_python/src/types/log_collector.rs:65-71 | engine/language_client_ruby/ext/ruby_ffi/src/types/log_collector.rs:102-108 | engine/language_client_typescript/src/types/log_collector.rs:52-58 \u2014 before extracting anything, compare \u0060engine/language_client_ruby/ext/ruby_ffi/src/types/log_collector.rs\u0060 and \u0060engine/language_client_typescript/src/types/log_collector.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_ruby/ext/ruby_ffi/src/types/log_collector.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6eb92789ce06a5de00adb96da41fdc7cc442475e922a8663fdb1c4c3cd4ccdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): engine/language_client_python/src/types/log_collector.rs:73-79 | engine/language_client_ruby/ext/ruby_ffi/src/types/log_collector.rs:110-116 | engine/language_client_typescript/src/types/log_collector.rs:61-67 \u2014 before extracting anything, compare \u0060engine/language_client_ruby/ext/ruby_ffi/src/types/log_collector.rs\u0060 and \u0060engine/language_client_typescript/src/types/log_collector.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_ruby/ext/ruby_ffi/src/types/log_collector.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeedf3a9c49c755320eb2974d29d4bfc2f67ef678ef784cf22ae956f9ee7d338"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/language_client_ruby/ext/ruby_ffi/src/types/log_collector.rs:372-380 | engine/language_client_typescript/src/types/log_collector.rs:300-308 \u2014 before extracting anything, compare \u0060engine/language_client_ruby/ext/ruby_ffi/src/types/log_collector.rs\u0060 and \u0060engine/language_client_typescript/src/types/log_collector.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_ruby/ext/ruby_ffi/src/types/log_collector.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c7000724374c17182c712203f27c2952c53960b440fcd0cad66334d0ca120f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): languages/rust/baml/src/async_stream.rs:120-124 | languages/rust/baml/src/async_stream.rs:126-130 | languages/rust/baml/src/stream.rs:100-104 | languages/rust/baml/src/stream.rs:106-110 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"languages/rust/baml/src/async_stream.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"76398c49eaa813f699302fd47ff6d8a3705896bde49b661f61f56d15052f06e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_compiler2_visualization/src/control_flow/mod.rs:231-240 | engine/baml-runtime/src/control_flow.rs:153-163 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/mod.rs\u0060 and \u0060engine/baml-runtime/src/control_flow.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 94 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_visualization/src/control_flow/mod.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"85020c7b3fddf2f28af7c49b1d9681c43fab351de14d0fbff0b3fe7054a86966"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 13): baml_language/crates/baml_fmt/src/ast/attributes.rs:201-205 | baml_language/crates/baml_fmt/src/ast/declarations.rs:381-385 | baml_language/crates/baml_fmt/src/ast/declarations.rs:713-717 | baml_language/crates/baml_fmt/src/ast/declarations.rs:1079-1083 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1783-1787 | baml_language/crates/baml_fmt/src/ast/expressions.rs:3009-3013 | baml_language/crates/baml_fmt/src/ast/pattern.rs:261-265 | baml_language/crates/baml_fmt/src/ast/pattern.rs:421-425 | baml_language/crates/baml_fmt/src/ast/pattern.rs:554-558 | baml_language/crates/baml_fmt/src/ast/statements.rs:490-494 | baml_language/crates/baml_fmt/src/ast/types.rs:129-133 | baml_language/crates/baml_fmt/src/ast/types.rs:235-239 | baml_language/crates/baml_fmt/src/ast/types.rs:559-563 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_fmt/src/ast/attributes.rs\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/declarations.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/attributes.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35fc60de4ff529e686da5f45d7b07b673c89280cd9b2f3c6f6e007b5f03d480"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): baml_language/crates/baml_syntax_macros/src/lib.rs:56-61 | baml_language/crates/baml_syntax_macros/src/lib.rs:65-70 | baml_language/crates/baml_syntax_macros/src/lib.rs:74-79 | languages/rust/baml-macros/src/lib.rs:63-68 | languages/rust/baml-macros/src/lib.rs:93-98 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_syntax_macros/src/lib.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c9babfdcc5925e409dbdd839f0b3b15187eeab0401af3ebb50b620da1f856b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/bcs_api/src/error.rs:58-63 | baml_language/crates/bcs_api/src/telemetry.rs:159-164 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bcs_api/src/error.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b068e377312afe87404e94511b5d6d8ecf50a67ca77b6d5853f30cda568b58a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/bex_vm/src/indexable.rs:76-83 | baml_language/crates/bex_vm/src/vm/frame_stack.rs:161-168 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/indexable.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb394619184fb0d930031b87c5c54b6072face357d3ea9a339fcab39139d4c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): baml_language/crates/bex_vm/src/package_baml/array.rs:470-478 | baml_language/crates/bex_vm/src/package_baml/array.rs:511-519 | baml_language/crates/bex_vm/src/package_baml/array.rs:662-670 | baml_language/crates/bex_vm/src/package_baml/root.rs:380-388 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/array.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfecc10b688043427f8e030acf0866f5dc45a6249fa589f2f487fddc201bfbf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/bex_vm/src/package_baml/toml.rs:182-186 | baml_language/crates/bex_vm/src/package_baml/yaml.rs:115-119 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/toml.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1111505428da6a486d93618d0aa8e1edb8a162d89f36691651d2c563a7ec2f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): baml_language/crates/bex_vm/src/types.rs:64-73 | baml_language/crates/bex_vm/src/types.rs:75-84 | engine/baml-vm/src/types.rs:257-266 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/types.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b951f3f5ca8fcb129f61352510936023452f678d04ffec31ae9187cf3366e309"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/bridge_ctypes/src/handle_table.rs:252-258 | baml_language/crates/bridge_ctypes/src/host_value_registry.rs:32-38 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_ctypes/src/handle_table.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a45c79e0060cd6fe7c16185ce457eae7edac0bdc9a963c9279b277d87b72d6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7): baml_language/crates/bridge_wasm/src/wasm_io_glob.rs:59-67 | baml_language/crates/sys_native/src/io_impls.rs:442-450 | baml_language/crates/sys_native/src/io_impls.rs:1179-1187 | baml_language/crates/sys_native/src/io_impls.rs:1556-1565 | baml_language/crates/sys_native/src/io_impls.rs:2299-2308 | baml_language/crates/sys_native/src/io_impls.rs:2328-2337 | baml_language/crates/sys_native/src/io_impls.rs:2341-2350 \u2014 there are 7 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 7 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/sys_native/src/io_impls.rs:1556\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":"baml_language/crates/bridge_wasm/src/wasm_io_glob.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"214fea42846730247e808fe1f75239740d0314aad4ded46d96faea3162e95298"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/tools_size_gate/src/config.rs:225-229 | baml_language/crates/tools_size_gate/src/human_size.rs:58-62 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/tools_size_gate/src/config.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c1e4c3d41ba64d233cc8c5085ae238bb7efbd1fb74fe4cbb5d6b8b16e4ca12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/sdks/csharp/sdkgen_csharp/src/names.rs:504-510 | baml_language/sdks/go/sdkgen_go/src/names.rs:1465-1471 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/sdkgen_csharp/src/names.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"6508b84890a3e4ac3e9beab3903424c1455453e624dfd1f69ced591a19ba4270"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/sdks/rust/sdkgen_rust/src/effect_rename.rs:24-28 | baml_language/sdks/rust/sdkgen_rust/src/host_types.rs:3-7 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/rust/sdkgen_rust/src/effect_rename.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c79e337adb7bb7cb2fecf17d2b6e403a3ce6483f8e9717e00d82fe723bd7992"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/baml-lib/ast/src/ast/argument.rs:55-60 | engine/baml-lib/ast/src/ast/value_expression_block.rs:104-109 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/ast/src/ast/value_expression_block.rs:104\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":"engine/baml-lib/ast/src/ast/argument.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f453c4cecde14a975de0c4c9651613a46e1b98884fd0231d5c7b8b7c9dc29921"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): engine/generators/languages/go/src/ir_to_go/mod.rs:341-348 | engine/generators/languages/python/src/ir_to_py/mod.rs:238-245 | engine/generators/languages/ruby/src/ir_to_rb/mod.rs:307-314 | engine/generators/languages/rust/src/ir_to_rust/mod.rs:371-378 | engine/generators/languages/typescript/src/ir_to_ts/mod.rs:255-262 \u2014 before extracting anything, compare \u0060engine/generators/languages/go/src/ir_to_go/mod.rs\u0060 and \u0060engine/generators/languages/rust/src/ir_to_rust/mod.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 208 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/go/src/ir_to_go/mod.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4fc82793449aed0ee8593b7cfdf9c658654056f916403a0d7ed3ccd7a1bbaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): baml_language/crates/baml_query_btel/src/ingest.rs:1429-1445 | baml_language/crates/baml_query_btel/src/ingest.rs:1775-1793 \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 \u0060baml_language/crates/baml_query_btel/src/ingest.rs:1429\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":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb41802e8a72b10acd931a5a7a941ee9bd5411f8690e00c0ee6bc78a6723cf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): baml_language/crates/baml_lsp_server/src/playground_server.rs:1580-1597 | baml_language/crates/baml_lsp_server/src/playground_server.rs:1680-1696 \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 \u0060baml_language/crates/baml_lsp_server/src/playground_server.rs:1580\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":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":1580}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7ffd4928fd3b9bc0984516ae50aeb7c5439face4b7caac48daa15040352aa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): baml_language/crates/baml_query_btel/src/ingest.rs:1440-1455 | baml_language/crates/baml_query_btel/src/ingest.rs:1496-1511 \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 \u0060baml_language/crates/baml_query_btel/src/ingest.rs:1440\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":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"557a2c8c59753852af7bc7afb58f9a5ead0f241360e1936e2f41188a2eb87c52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): baml_language/crates/baml_parser/src/items.rs:1925-1939 | baml_language/crates/baml_parser/src/items.rs:1951-1965 \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 \u0060baml_language/crates/baml_parser/src/items.rs:1925\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":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"8079bb18da348d47054b07d17a11075205e27d9bc4f68e7371142ab3d8a22765"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/language_server/src/server/api/notifications/did_change.rs:66-80 | engine/language_server/src/server/api/requests/diagnostic.rs:71-85 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/server/api/notifications/did_change.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bd893fe3b9b90f1546913745e5c9e962f7fef295bc5ad02f1936d9c4e94ad3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/baml-lib/diagnostics/src/error.rs:510-523 | engine/baml-lib/diagnostics/src/error.rs:561-574 \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 \u0060engine/baml-lib/diagnostics/src/error.rs:510\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":"engine/baml-lib/diagnostics/src/error.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6451bbe357e596e6de39ef0a353b4d1190f40a7fa98cd983a14c92cdd88a66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): engine/baml-lib/llm-client/src/clients/aws_bedrock.rs:301-314 | engine/baml-lib/llm-client/src/clients/aws_bedrock.rs:339-352 | engine/baml-lib/llm-client/src/clients/aws_bedrock.rs:365-378 \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":"engine/baml-lib/llm-client/src/clients/aws_bedrock.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"209d3925a54c15903ab1fae763c9bb612b66db1002756292e9c10f4ce16e7e71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs:1149-1160 | engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs:1227-1239 \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 \u0060engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs:1149\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":"engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd571aaa72fd06012492340d0a335d306d2bc0ddcc31e835412791803313c8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): baml_language/crates/baml_base/src/qualified_name.rs:334-344 | baml_language/crates/baml_base/src/qualified_name.rs:348-358 | baml_language/crates/baml_base/src/qualified_name.rs:375-387 \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 \u0060baml_language/crates/baml_base/src/qualified_name.rs:375\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":"baml_language/crates/baml_base/src/qualified_name.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07466c8351ae05feee7218685a5d465370bcdee3b8aa8bbe2f2d9456e091618"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): engine/baml_cffi_macros/src/lib.rs:657-665 | engine/baml_cffi_macros/src/lib.rs:739-747 | engine/baml_cffi_macros/src/lib.rs:955-967 \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 \u0060engine/baml_cffi_macros/src/lib.rs:657\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":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"c625cfa3b9226d9b8d0d2686f53d89ad945653b7c39fcb263752170fdbc1be2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/baml-lib/ast/src/parser/parse_comments.rs:18-30 | engine/baml-lib/ast/src/parser/parse_comments.rs:41-53 \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 \u0060engine/baml-lib/ast/src/parser/parse_comments.rs:18\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":"engine/baml-lib/ast/src/parser/parse_comments.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12efd7458c8d1c5d4c524564b421e213d4fb961a2e7a49a31cd03a060a66f16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/tools_stow/src/main.rs:2356-2368 | baml_language/crates/tools_stow/src/main.rs:2390-2401 \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 \u0060baml_language/crates/tools_stow/src/main.rs:2356\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":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":2356}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e965a8c90045e04f407280e554f98bebf736e8365444389f39d7e239379c46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_cli/src/codequality_command.rs:487-496 | baml_language/crates/baml_cli/src/codequality_command.rs:535-547 \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 \u0060baml_language/crates/baml_cli/src/codequality_command.rs:487\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. 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":"baml_language/crates/baml_cli/src/codequality_command.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"35823e5bc7e4b4c52a41d29d7a1b8b79617e81cd3fd97e9d4b03eb46737f5ff3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:601-613 | baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:642-654 \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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d2bb180e62af41965306049dadb61cb6811fc682ffc1a6d423cbf112548150"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 3): engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:453-475 | engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs:327-347 | engine/baml-runtime/src/internal/llm_client/primitive/vertex/vertex_client.rs:534-554 \u2014 before extracting anything, compare \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs\u0060 and \u0060engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:453\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":"engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"074e9f054a2ea383c1e84421cae502011b34b7cb243039f4005cf856a3f5d82e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/baml-runtime/src/optimize/orchestrator.rs:320-331 | engine/baml-runtime/src/optimize/orchestrator.rs:514-525 \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 \u0060engine/baml-runtime/src/optimize/orchestrator.rs:320\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":"engine/baml-runtime/src/optimize/orchestrator.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"250073a165a48c1f916d42e9538a46f40a05cbf5bce54787b9f95cf460f18a67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/baml_sdkgen_types/src/output_writer.rs:714-725 | baml_language/crates/baml_sdkgen_types/src/output_writer.rs:767-778 \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 \u0060baml_language/crates/baml_sdkgen_types/src/output_writer.rs:714\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":"baml_language/crates/baml_sdkgen_types/src/output_writer.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"837f133187e0630f118386f025fc51737dbf9d7d33ea472df165f75f96805c12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/crates/sys_native/src/io_impls.rs:2369-2380 | baml_language/crates/sys_native/src/io_impls.rs:2615-2626 \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 \u0060baml_language/crates/sys_native/src/io_impls.rs:2369\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":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":2369}}}],"partialFingerprints":{"codehealthFindingId/v1":"623d0485eb93510cb8113f8d82783ef3477a6adab41791c10b2de51ad9692943"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/sdks/swift/rust/sdkgen_swift/src/lib.rs:517-528 | baml_language/sdks/swift/rust/sdkgen_swift/src/lib.rs:539-550 \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 \u0060baml_language/sdks/swift/rust/sdkgen_swift/src/lib.rs:517\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":"baml_language/sdks/swift/rust/sdkgen_swift/src/lib.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fcccac1fbd21a6c887424cfd3e97bbb3c9fa7af82100d28da2a024f3c92337"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/baml-lib/baml-core/src/lockfile.rs:178-189 | engine/baml-lib/baml-core/src/lockfile.rs:214-225 \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 \u0060engine/baml-lib/baml-core/src/lockfile.rs:178\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":"engine/baml-lib/baml-core/src/lockfile.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e64688cf28ff2cf2b76bbe14f9032e2f20442838ceb82feb4b923b2c5e846d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs:353-362 | baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs:372-381 | baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs:440-451 \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 \u0060baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs:353\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":"baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55cf7e466f9f427c3cb8e8d088e99d41b7dda6209b4c09380187a2f12e4e1a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/baml_compiler2_ast/src/lower_cst.rs:58-68 | baml_language/crates/baml_compiler2_ast/src/lower_cst.rs:105-115 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_compiler2_ast/src/lower_cst.rs:58\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":"baml_language/crates/baml_compiler2_ast/src/lower_cst.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f922c722d8501ce45d69455911fc9dad9824494e97028e5cb90444395e896ced"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): engine/baml-runtime/src/optimize/tui.rs:641-651 | engine/baml-runtime/src/optimize/tui.rs:1042-1052 | engine/baml-runtime/src/optimize/tui.rs:1188-1198 \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":"engine/baml-runtime/src/optimize/tui.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e8c914412bd252bd7b23ade5642fc1d21db16e9094d7616ef1a4d3297a2ac6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/baml-compiler/src/thir/interpret.rs:1713-1723 | engine/baml-compiler/src/thir/interpret.rs:1731-1741 \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 \u0060engine/baml-compiler/src/thir/interpret.rs:1713\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":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":1713}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc506cc89d19c3071fa95f0b50bcebbd5344f4675ed0ecf0cba47128c3d6a10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/tools_size_gate/src/measure.rs:397-407 | baml_language/crates/tools_size_gate/src/measure.rs:427-437 \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 \u0060baml_language/crates/tools_size_gate/src/measure.rs:397\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":"baml_language/crates/tools_size_gate/src/measure.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"f457c71badffb236194fd01911313aec502542a223be6b77f085b36cdbc1d7cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): languages/rust/baml-sys/src/loader.rs:275-285 | languages/rust/baml-sys/src/loader.rs:287-297 \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 \u0060languages/rust/baml-sys/src/loader.rs:275\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":"languages/rust/baml-sys/src/loader.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa0de97538a785812afb1f12481023eafa1182c7d3734bb1c99c046ca682183"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/bex_events/src/history/mod.rs:637-647 | baml_language/crates/bex_events/src/value/record.rs:564-571 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"baml_language/crates/bex_events/src/history/mod.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d97c882a8a5f9f5c95de427c18e8d61da414df95d83eca581df2e84b465a87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/baml_cffi_macros/src/lib.rs:709-719 | engine/baml_cffi_macros/src/lib.rs:724-734 \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 \u0060engine/baml_cffi_macros/src/lib.rs:709\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":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"0842d74c69a476310708c6ea5a9b9e7cf4a76c586e80cc8d5d4aae0273842cf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/baml_cffi_macros/src/lib.rs:783-793 | engine/baml_cffi_macros/src/lib.rs:798-808 \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 \u0060engine/baml_cffi_macros/src/lib.rs:783\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":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"140de9030a3a83a2f703248b1fc7bb67361209faa0f5891a8688c32612da87a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/baml_ide/src/describe.rs:886-896 | baml_language/crates/baml_ide/src/describe.rs:996-1006 \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 \u0060baml_language/crates/baml_ide/src/describe.rs:886\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":"baml_language/crates/baml_ide/src/describe.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e48d3ae8c86d1c31a3171bdbd99e6b83b21c984ee6fde725faaa2eba8ef82b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/sys_native/src/io_impls.rs:3339-3349 | baml_language/crates/sys_native/src/io_impls.rs:3399-3409 \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 \u0060baml_language/crates/sys_native/src/io_impls.rs:3339\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":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":3339}}}],"partialFingerprints":{"codehealthFindingId/v1":"942deed4a0812fb8eb0841b801069d618031288fcb13929ee7c768924bbe1204"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/baml-compiler/src/thir.rs:337-346 | engine/baml-lib/baml-types/src/expr.rs:291-300 \u2014 before extracting anything, compare \u0060engine/baml-compiler/src/thir.rs\u0060 and \u0060engine/baml-lib/baml-types/src/expr.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-compiler/src/thir.rs:337\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/thir.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11e994d90c27ca823def96d80199023bcddb2ba7713c25b3e5b4991ebd267f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs:319-328 | baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs:494-503 \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 \u0060baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs:319\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":"baml_language/crates/bex_sap/src/deserializer/coercer/mod.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"c840c005210922808d3838c37d18e80933513d6a65f28fd706fef4eeeb1086c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/language_client_ruby/ext/ruby_ffi/src/lib.rs:123-132 | engine/language_client_ruby/ext/ruby_ffi/src/lib.rs:173-182 \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 \u0060engine/language_client_ruby/ext/ruby_ffi/src/lib.rs:123\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":"engine/language_client_ruby/ext/ruby_ffi/src/lib.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9c66c2b4a0f0914ac05f8f9253ee66eaa80e0a57d2f45bb74c247817e55d8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): engine/baml-runtime/src/tracing/mod.rs:1112-1121 | engine/baml-runtime/src/tracing/mod.rs:1126-1135 | engine/baml-runtime/src/tracing/mod.rs:1178-1187 \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":"engine/baml-runtime/src/tracing/mod.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a75f46949f19a884361709ddce286fffb08b1eedb8f6b66361022b90061ae7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/baml-lib/parser-database/src/types/configurations.rs:77-86 | engine/baml-lib/parser-database/src/types/configurations.rs:250-259 \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 \u0060engine/baml-lib/parser-database/src/types/configurations.rs:77\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":"engine/baml-lib/parser-database/src/types/configurations.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"7472e9c4a0bc0b0622679429ff5f66630ab393bb25872ee50791283e7193d09e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/generators/languages/typescript/src/type.rs:132-139 | engine/generators/languages/typescript/src/type.rs:225-234 \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 \u0060engine/generators/languages/typescript/src/type.rs:132\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/typescript/src/type.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2833ac8d143258cea47e2e918c8904784705c8ae86912e24b9af519dd53548"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs:262-271 | engine/baml-lib/jsonish/src/deserializer/deserialize_flags.rs:262-271 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs\u0060 and \u0060engine/baml-lib/jsonish/src/deserializer/deserialize_flags.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 127 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs:262\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs:261\u0060 calls \u0060FloatToBigint\u0060 and \u0060engine/baml-lib/jsonish/src/deserializer/deserialize_flags.rs:261\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":"baml_language/crates/bex_sap/src/deserializer/deserialize_flags.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"02aaaa26a2e286fd9d3389136400ccb46f77058c213c1f555da690ff893dab8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_sdkgen_types/src/descriptor.rs:139-148 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:2246-2255 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_sdkgen_types/src/descriptor.rs:139\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":"baml_language/crates/baml_sdkgen_types/src/descriptor.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"4436a6b758a93bb022ce8148934018116ec62e4c4780db6dcf5139ec2660d9dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/baml_cffi_macros/src/lib.rs:540-549 | engine/baml_cffi_macros/src/lib.rs:1818-1827 \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 \u0060engine/baml_cffi_macros/src/lib.rs:540\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":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f8e8bfaf8eaaadd43e008b27ae4ac7f6849698fdddde2c7d79444d64e4f155"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/baml_parser/src/items.rs:2157-2166 | baml_language/crates/baml_parser/src/items.rs:2176-2185 \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 \u0060baml_language/crates/baml_parser/src/items.rs:2157\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":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":2157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85b3fdf8b6dd712ad9ca1545ca1dc2db34d18f7129c4bd01364c3400e00a93a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/baml-lib/parser-database/src/types/mod.rs:402-411 | engine/baml-lib/parser-database/src/types/mod.rs:432-441 \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 \u0060engine/baml-lib/parser-database/src/types/mod.rs:402\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":"engine/baml-lib/parser-database/src/types/mod.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85e91a55f3f6848acfffe7ec1903edf03f8eb03272c449d729baf8839e2ea1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/crates/bridge_wasm/src/wasm_env.rs:82-91 | baml_language/crates/bridge_wasm/src/wasm_io.rs:103-112 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bridge_wasm/src/wasm_env.rs:82\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":"baml_language/crates/bridge_wasm/src/wasm_env.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d49274bcd638b60c0d1c0f59fb1787a725f5f975d1ae72add04b989e25841f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/bex_vm/src/package_baml/csv.rs:1605-1611 | baml_language/crates/bex_vm/src/package_baml/csv.rs:1620-1629 \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 \u0060baml_language/crates/bex_vm/src/package_baml/csv.rs:1605\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"d016e6b6c48864026a104a50fea3d234973f9962ed8cb3da8cfa7d32845247a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/baml-lib/parser-database/src/types/configurations.rs:50-59 | engine/baml-lib/parser-database/src/types/configurations.rs:209-218 \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 \u0060engine/baml-lib/parser-database/src/types/configurations.rs:50\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/baml-lib/parser-database/src/types/configurations.rs:47\u0060 calls \u0060Some\u0060, \u0060ConstantDelay\u0060 and \u0060engine/baml-lib/parser-database/src/types/configurations.rs:208\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":"engine/baml-lib/parser-database/src/types/configurations.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95be2a4b4f85de8fa1c9678a1ec7629b18fbecd356a4bc509d1e18f15bd7b99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/baml-lib/jsonish/src/helpers/mod.rs:345-354 | engine/baml-runtime/src/internal/llm_client/mod.rs:63-67 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-lib/jsonish/src/helpers/mod.rs:345\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":"engine/baml-lib/jsonish/src/helpers/mod.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0a84e4686236f99b89168e202bbef0daff7d3730545902ec17ff5aba560010"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/language_client_cffi/src/ctypes/baml_value_with_meta_encode.rs:218-226 | engine/language_client_cffi/src/ctypes/baml_value_with_meta_encode.rs:258-266 \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 \u0060engine/language_client_cffi/src/ctypes/baml_value_with_meta_encode.rs:218\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":"engine/language_client_cffi/src/ctypes/baml_value_with_meta_encode.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"9266ff9d67052123d6d3155304833d0d566afa8a5082a14ec8509adbee4c0357"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:304-312 | baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:455-463 \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 \u0060baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs:304\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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1aa7c69d0ab14b1f083bb7a12958f95c153391828811113a4bd023baf596a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/baml-lib/baml-core/src/ir/repr.rs:1693-1700 | engine/baml-lib/baml-core/src/ir/repr.rs:1707-1715 \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 \u0060engine/baml-lib/baml-core/src/ir/repr.rs:1693\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. 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":"engine/baml-lib/baml-core/src/ir/repr.rs"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7216dde5654e8aa49b00d63b3de4ebb93a09f76dff217da2fca456450b99807"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): languages/rust/baml/src/raw_objects/mod.rs:400-408 | languages/rust/baml/src/raw_objects/mod.rs:441-449 \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 \u0060languages/rust/baml/src/raw_objects/mod.rs:400\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":"languages/rust/baml/src/raw_objects/mod.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4712d5e447cc54f5796f417349a24b48e7fcbe2f04c04221b310a215e4c616"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/baml-compiler/src/thir/typecheck.rs:1978-1986 | engine/baml-compiler/src/thir/typecheck.rs:1989-1997 \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":"engine/baml-compiler/src/thir/typecheck.rs"},"region":{"startLine":1978}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8bb52f58115fde7e2ea2a9b72ffdc7eae5549340b7e638e011c3d610fa5547"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/language_client_cffi/src/ctypes/baml_value_encode.rs:207-215 | engine/language_client_cffi/src/ctypes/baml_value_encode.rs:234-242 \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 \u0060engine/language_client_cffi/src/ctypes/baml_value_encode.rs:207\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":"engine/language_client_cffi/src/ctypes/baml_value_encode.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd9aa642f6c6acac50ba520a70f57927df995ea3f2b62da35eb3dcf999c775d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/language_server/src/baml_project/position_utils.rs:57-65 | engine/language_server/src/baml_project/position_utils.rs:94-101 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/language_server/src/baml_project/position_utils.rs:93\u0060 calls \u0060min\u0060 and \u0060engine/language_server/src/baml_project/position_utils.rs:54\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/baml_project/position_utils.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"239cbc0e041b168112565b8b4647699034380d71a09684fe70618aaf00a429d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/baml-runtime/src/optimize/gepa_runtime.rs:272-280 | engine/baml-runtime/src/optimize/gepa_runtime.rs:340-348 \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 \u0060engine/baml-runtime/src/optimize/gepa_runtime.rs:272\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":"engine/baml-runtime/src/optimize/gepa_runtime.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"d464add955d8ff07f03f300de953a96e28846803bf1793eb9d321218d6800995"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): engine/baml-lib/llm-client/src/clients/helpers.rs:877-885 | engine/baml-lib/llm-client/src/clients/helpers.rs:894-902 | engine/baml-lib/llm-client/src/clients/helpers.rs:911-919 | engine/baml-lib/llm-client/src/clients/helpers.rs:928-936 \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 \u0060engine/baml-lib/llm-client/src/clients/helpers.rs:877\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":"engine/baml-lib/llm-client/src/clients/helpers.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ac1afa28221f8aa9856de413ec22549a27d41f4b005a066bfe725f86ba117f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_compiler2_emit/src/emit.rs:1532-1537 | baml_language/crates/baml_compiler2_emit/src/emit.rs:1539-1547 \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 \u0060baml_language/crates/baml_compiler2_emit/src/emit.rs:1532\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":"baml_language/crates/baml_compiler2_emit/src/emit.rs"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b082e9b2ce31ac2c7976e398113ea2dbc6d4de4e2cfca7ace5f08be20153e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/baml-runtime/src/types/js_callback_provider.rs:104-111 | engine/baml-runtime/src/types/js_callback_provider.rs:127-134 \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 \u0060engine/baml-runtime/src/types/js_callback_provider.rs:104\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":"engine/baml-runtime/src/types/js_callback_provider.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f18e628051e889c0940d1e0ac862e86cbcb5a7fe46d53bdfe21cbfa458c804"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/baml_cffi_macros/src/lib.rs:1211-1218 | engine/baml_cffi_macros/src/lib.rs:1880-1887 \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 \u0060engine/baml_cffi_macros/src/lib.rs:1211\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":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5ad1aaeb3656ee3838a385577cdb85b13087c92f7ee6af447f6921d6b844f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/baml-runtime/src/cli/serve/mod.rs:269-274 | engine/baml-runtime/src/cli/serve/mod.rs:278-285 \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 \u0060engine/baml-runtime/src/cli/serve/mod.rs:269\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":"engine/baml-runtime/src/cli/serve/mod.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"7335ee993deaa5aa22adb8a633a0e11af25b1835ab7d6ab8a952353d1f482d40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): baml_language/crates/baml_parser/src/items.rs:1053-1060 | baml_language/crates/baml_parser/src/items.rs:2159-2166 | baml_language/crates/baml_parser/src/items.rs:2178-2185 \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":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ab7975524a0411d15b5f0d725cbba0b99e8b5e907209973ae0739b02fc584e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs:1165-1172 | engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs:1244-1251 \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 \u0060engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs:1165\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":"engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"193f75f1f40381f589d98ce1c8266ffaa4c01027637d635bab45228806e9ea20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/sys_ops/src/lib.rs:744-751 | baml_language/crates/sys_types/src/lib.rs:819-826 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/sys_ops/src/lib.rs:744\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":"baml_language/crates/sys_ops/src/lib.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d57d8d596fc7e557ee8467f60cb663e137c9140f5076aedfa505b082ae7123"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_linker/src/space.rs:29-36 | baml_language/crates/baml_linker/src/space.rs:91-98 \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 \u0060baml_language/crates/baml_linker/src/space.rs:29\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":"baml_language/crates/baml_linker/src/space.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"05283971a8b63e5b5d614ddde68ec2495538f5cede4585038de023e3babeb4e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/sdks/python/rust/bridge_python/src/encode.rs:122-129 | baml_language/sdks/typescript/bridge_typescript_web/src/encode.rs:125-132 \u2014 before extracting anything, compare \u0060baml_language/sdks/python/rust/bridge_python/src/encode.rs\u0060 and \u0060baml_language/sdks/typescript/bridge_typescript_web/src/encode.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/bridge_python/src/encode.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"22560b89fe15ceb6033cd4169f352630e8d53910108aa1640228b028b3c122cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/google/response_handler.rs:74-81 | engine/baml-runtime/src/internal/llm_client/primitive/vertex/response_handler.rs:77-84 \u2014 \u0060engine/baml-runtime/src/internal/llm_client/primitive/google/response_handler.rs\u0060 and \u0060engine/baml-runtime/src/internal/llm_client/primitive/vertex/response_handler.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 6 separate duplicated blocks between them, totalling at least 53 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/internal/llm_client/primitive/google/response_handler.rs:74\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":"engine/baml-runtime/src/internal/llm_client/primitive/google/response_handler.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d125e9b1e7c116d79290b8b1371d4233ccf2ab794d5735df2d3b3a3bccc9c16d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:833-840 | baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:921-928 \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 \u0060baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:833\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:919\u0060 calls \u0060alloc_expr\u0060, \u0060Path\u0060 and \u0060baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs:831\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/lower_expr_body.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c5724298ea7b5bbae30ac52c9c546c28af02e40ffe918a656d982bea74fc8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/baml-lib/baml-types/src/baml_value.rs:69-76 | engine/baml-lib/baml-types/src/baml_value.rs:83-90 \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 \u0060engine/baml-lib/baml-types/src/baml_value.rs:69\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":"engine/baml-lib/baml-types/src/baml_value.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7d0801616bad6ba8525454ca8b038b902d4f24070d5bad5f13ab99174a250d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/baml_parser/src/items.rs:1540-1547 | baml_language/crates/baml_parser/src/items.rs:1595-1602 \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 \u0060baml_language/crates/baml_parser/src/items.rs:1540\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":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":1540}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf4618ddad6f861fc5794663f3dc3fad1aef1eb0afabc84d7eb2d6c40681f07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/language_client_cffi/src/ffi/runtime.rs:31-38 | engine/language_client_cffi/src/ffi/runtime.rs:40-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 \u0060engine/language_client_cffi/src/ffi/runtime.rs:31\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":"engine/language_client_cffi/src/ffi/runtime.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ca50afbabc7b3996150feff6194b4e5461e790a7ee578c1464da535a918ac6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:446-451 | engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs:318-323 | engine/baml-runtime/src/internal/llm_client/primitive/vertex/vertex_client.rs:523-530 \u2014 before extracting anything, compare \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs\u0060 and \u0060engine/baml-runtime/src/internal/llm_client/primitive/google/googleai_client.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 80 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:446\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":"engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa675c188c785b794ae6e49d14d20ec2dc13b63b2b84c3aba3a6fcbf1afa8b3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): baml_language/crates/bex_sap/src/jsonish/value.rs:262-269 | engine/baml-lib/baml-types/src/value_expr.rs:409-416 | engine/baml-lib/jsonish/src/jsonish/value.rs:204-211 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/value.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/value.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 164 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/bex_sap/src/jsonish/value.rs:262\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/value.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd8ca5087ed486f32cb49be12d60e1ae389e215f30b1e1ecd1c0a1bf5b97f09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/crates/bex_vm/src/package_baml/csv.rs:2289-2296 | baml_language/crates/bex_vm/src/package_baml/csv.rs:2586-2593 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":2289}}}],"partialFingerprints":{"codehealthFindingId/v1":"a365478f94ccce6c4f61f24440f9a71d6706fd593aaaa83780e82a6039ddedb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:655-662 | engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:683-689 \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 \u0060engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:655\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":"engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f72a3bb52c0fd8caf4d2d8e6f38af524e46e7e623edd8486ee9e3e25ca3abcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:786-792 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:795-801 \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":"engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"a612a852950b4260b7c6caff54830434383a833443653854439d314467e46fb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): baml_language/crates/bex_sap/src/jsonish/value.rs:271-277 | engine/baml-lib/baml-types/src/value_expr.rs:388-394 | engine/baml-lib/jsonish/src/jsonish/value.rs:213-219 \u2014 before extracting anything, compare \u0060baml_language/crates/bex_sap/src/jsonish/value.rs\u0060 and \u0060engine/baml-lib/jsonish/src/jsonish/value.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 164 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/value.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f644d2af17a63363ddc91cda05d42e804e2f0f5bc74f4e2080e8f7fea5c985"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): languages/rust/baml/src/runtime.rs:484-490 | languages/rust/baml/src/runtime.rs:530-536 \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 \u0060languages/rust/baml/src/runtime.rs:484\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":"languages/rust/baml/src/runtime.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3f88e2ac1800dfaff8d796b4a77aba193b0eca5f2887e4b4c513e46935a486"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/bex_engine/src/lib.rs:7368-7374 | baml_language/crates/bex_engine/src/lib.rs:7384-7390 \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 \u0060baml_language/crates/bex_engine/src/lib.rs:7368\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":7368}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc2cef960727e59573f9e917a5b4b1fa63e5483c0340c20cd99018e090804d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:614-620 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:623-629 \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":"engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"393c58da8b7377d269ef6ea2b0f756b567e5d5a16ef6ea65cca6b8e908c4815a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/bex_engine/src/trace_value_encode.rs:777-783 | baml_language/crates/bex_engine/src/trace_value_encode.rs:795-801 \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 \u0060baml_language/crates/bex_engine/src/trace_value_encode.rs:777\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":"baml_language/crates/bex_engine/src/trace_value_encode.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"8888c84912921e20e433129486089388d683f1b762e40456db5c002eb40c6248"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/sdks/java/sdkgen_java/src/emit.rs:920-926 | baml_language/sdks/java/sdkgen_java/src/emit.rs:1425-1429 \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 \u0060baml_language/sdks/java/sdkgen_java/src/emit.rs:920\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. 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":"baml_language/sdks/java/sdkgen_java/src/emit.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d06e07048093a1ff9aaf4983aad14d15985721b3f3d478f148b178f9717b7e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:273-279 | engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:310-316 | engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:371-377 \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 \u0060engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:273\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":"engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bea5b17dc6c30550d853cac7e5d910c84f0637aca78774197b3be87c683c445"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:258-264 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:267-273 \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":"engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"429baaa821f3c9edb972319d26b49a8a567963534f15d9167cd628d6e0fc1444"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/baml_compiler2_mir/src/pretty.rs:586-592 | baml_language/crates/baml_compiler2_mir/src/pretty.rs:596-602 \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":"baml_language/crates/baml_compiler2_mir/src/pretty.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"0527db152fef148e8d2e7ecb7522d338b8061720f5bf9634bf835b4f1afedaef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs:778-784 | baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs:1069-1075 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f13bf6515164d7cec3574572bdb3c6d62de5272217eb5af26b2f7fde770f631"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_query_btel/src/ingest.rs:315-321 | baml_language/crates/baml_query_btel/src/ingest.rs:961-966 \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 \u0060baml_language/crates/baml_query_btel/src/ingest.rs:315\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":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff66a18eedd207a904f5d845e3817df7e683c668a1eda936a57ede88624ea29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/crates/baml_ide/src/info.rs:1106-1112 | baml_language/crates/baml_ide/src/info.rs:1140-1146 \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 \u0060baml_language/crates/baml_ide/src/info.rs:1106\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":"baml_language/crates/baml_ide/src/info.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7416046c256f33c3480d01a1a1eb6bb3255f9c00eed429da319627f714b211bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:496-502 | engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs:505-511 \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":"engine/language_client_cffi/src/raw_ptr_wrapper/type_builder/objects.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01c67044bb7224832d1769789fe3db93b0bdc2b393a79784c41dedfc62e52a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_parser/src/expr.rs:883-888 | baml_language/crates/baml_parser/src/stmts.rs:365-370 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/baml_parser/src/expr.rs:883\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":"baml_language/crates/baml_parser/src/expr.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3891dce43addf4aeb3eb25d130828038f59d74f18c7aa43cc298133b16499a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_parser/src/items.rs:1944-1949 | baml_language/crates/baml_parser/src/items.rs:1992-1997 \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":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":1944}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79ec0f9402caf263ce7b995b01ac05a34ec5a73c972eddb7a5c34e32a117d79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/btel_reader/src/value.rs:1254-1259 | baml_language/crates/btel_reader/src/value.rs:1295-1300 \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":"baml_language/crates/btel_reader/src/value.rs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a898ae0f9313ad5505ccabf40817d32478e9a4b8834358fb5cecd52af1f157"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/bridge_wasm/src/wasm_sys.rs:334-339 | baml_language/crates/bridge_wasm/src/wasm_sys.rs:379-384 \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 \u0060baml_language/crates/bridge_wasm/src/wasm_sys.rs:334\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":"baml_language/crates/bridge_wasm/src/wasm_sys.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab9f9130f908157048da47777a6a505604944a16e699694df5d7ff82edb30c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/baml-lib/baml-core/src/ir/repr.rs:1823-1828 | engine/baml-lib/baml-core/src/ir/repr.rs:1831-1836 \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 \u0060engine/baml-lib/baml-core/src/ir/repr.rs:1823\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":"engine/baml-lib/baml-core/src/ir/repr.rs"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16961d961d45a4f999ff1dc635a823dbbe0cd7d80949eee37151cebd1480233"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_sdkgen_types/src/output_writer.rs:956-961 | baml_language/crates/baml_sdkgen_types/src/output_writer.rs:1318-1323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_sdkgen_types/src/output_writer.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b1ed0611a8140906372a1dc834d2ad4f85b9557de8e0faabccf12b40ebec53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/baml-runtime/src/optimize/tui.rs:1740-1745 | engine/baml-runtime/src/optimize/tui.rs:1756-1760 \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 \u0060engine/baml-runtime/src/optimize/tui.rs:1740\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":"engine/baml-runtime/src/optimize/tui.rs"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88448e6fe30bb1c42fda04d65bdd2d80d8f9d01cb19150a7e6576f5442ac180"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs:1601-1606 | baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs:2056-2061 \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 \u0060baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs:1601\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":"baml_language/crates/bex_vm/src/package_reflect/type_kinds.rs"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e9e7c531b31962c13325fa19089e522aed7a1c4b4b697c21b3bed92a7843e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:175-180 | engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:182-187 \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":"engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d4291992de9cf29c9549e3c7c3c26f5b55831d06a4eea0dc3ac5b9b1f57656"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_sdkgen_types/src/output_writer.rs:827-832 | baml_language/crates/baml_sdkgen_types/src/output_writer.rs:1277-1282 \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 \u0060baml_language/crates/baml_sdkgen_types/src/output_writer.rs:827\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_sdkgen_types/src/output_writer.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1706b7460655977bb71307d862e4aac093c79c9206744a3d71d5182375d362b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): engine/baml-lib/llm-client/src/clients/aws_bedrock.rs:499-504 | engine/baml-lib/llm-client/src/clients/aws_bedrock.rs:506-511 | engine/baml-lib/llm-client/src/clients/aws_bedrock.rs:513-518 \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 \u0060engine/baml-lib/llm-client/src/clients/aws_bedrock.rs:499\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":"engine/baml-lib/llm-client/src/clients/aws_bedrock.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"024b7a5672da5dc85979d3e62a44f6bdd57a18c294adf38b8297a1473761338d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/bridge_cffi/src/ffi/runtime.rs:114-119 | baml_language/crates/bridge_cffi/src/ffi/runtime.rs:279-284 \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 \u0060baml_language/crates/bridge_cffi/src/ffi/runtime.rs:114\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":"baml_language/crates/bridge_cffi/src/ffi/runtime.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"143cf66a62899ce4cd9bc360ad1130409d11521346cc058d4fd2f437c2da1a1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:189-194 | engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:203-208 | engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:217-222 | engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:224-229 | engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs:231-236 \u2014 all 5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b1e630960df3812f25b773807995ef8e971e9e3bc05dc26f2ba075d03078c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/sdks/go/sdkgen_go/src/lib.rs:3217-3222 | baml_language/sdks/go/sdkgen_go/src/lib.rs:4724-4729 \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 \u0060baml_language/sdks/go/sdkgen_go/src/lib.rs:3217\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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":3217}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef91fa238e708a98e7602859e16450c8251151224d6a3fff07740f39e5d1ba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/baml_query_btel/src/functions.rs:1196-1200 | baml_language/crates/baml_query_btel/src/functions.rs:1216-1220 \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 \u0060baml_language/crates/baml_query_btel/src/functions.rs:1196\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":"baml_language/crates/baml_query_btel/src/functions.rs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec8e3a14ea5514d07c99f2c3cd47051db3898080e0834fe4ab18fd89127dcb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/baml_query_btel/src/functions.rs:1006-1010 | baml_language/crates/baml_query_btel/src/functions.rs:1022-1026 \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 \u0060baml_language/crates/baml_query_btel/src/functions.rs:1006\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":"baml_language/crates/baml_query_btel/src/functions.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a7b942df8e754cbc30e234c500487731a361ebd22f1692ffad80da9d493f5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:3549-3553 | baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:3558-3562 \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 \u0060baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:3549\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:3554\u0060 calls \u0060type_field\u0060 and \u0060baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs:3563\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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":3549}}}],"partialFingerprints":{"codehealthFindingId/v1":"221fc22ae64cdaa4a5a52ee4a2f268d61fc58798b5cdabd92efc23a515216c53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/bex_vm/src/package_baml/csv.rs:2543-2547 | baml_language/crates/bex_vm/src/package_baml/csv.rs:2570-2574 \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 \u0060baml_language/crates/bex_vm/src/package_baml/csv.rs:2543\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":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":2543}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d17141befd060ace0dbdbd2b26379fcf7fa4dca5eb595e3eff97ef911a620c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_compiler2_emit/src/emit.rs:1861-1866 | baml_language/crates/baml_compiler2_emit/src/emit.rs:1892-1897 \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":"baml_language/crates/baml_compiler2_emit/src/emit.rs"},"region":{"startLine":1861}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b1e8027b933f7924ee6732caaa03d3768b9b466cf40b8b1ae57a2b0d6fd9c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/baml_compiler2_hir/src/signature.rs:161-165 | baml_language/crates/baml_compiler2_hir/src/signature.rs:327-331 \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":"baml_language/crates/baml_compiler2_hir/src/signature.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"079f040cbcda742d8275c1edd87435ea164cbc2309f633611cb342c1f329da31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:5806-5811 | baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:5865-5870 \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 \u0060baml_language/crates/baml_compiler2_hir_ty/src/infer.rs:5806\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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":5806}}}],"partialFingerprints":{"codehealthFindingId/v1":"6824b1236d2bf33b8bb732c4d50518d4e156be0982ca91e7cf65121aa008b7b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/attributes.rs:150-154 | baml_language/crates/baml_fmt/src/ast/expressions.rs:1492-1496 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_fmt/src/ast/attributes.rs\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/expressions.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 162 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/attributes.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d60af5944c83d9458b03184c0f29ae771103511a1e22fb7df199b9afd7a1966"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/expressions.rs:2562-2566 | baml_language/crates/baml_fmt/src/ast/expressions.rs:2636-2640 \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":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":2562}}}],"partialFingerprints":{"codehealthFindingId/v1":"a353f779b0b34fe28f20d9f82c0d2b6da14d6ca856e6a86d9175ec9665e63063"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/pattern.rs:523-528 | baml_language/crates/baml_fmt/src/ast/types.rs:138-143 \u2014 before extracting anything, compare \u0060baml_language/crates/baml_fmt/src/ast/pattern.rs\u0060 and \u0060baml_language/crates/baml_fmt/src/ast/types.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_fmt/src/ast/pattern.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"468c8f834652d56106cb94b19a0876701347ce93036d661eeadfdaebc1340a1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/baml_fmt/src/ast/types.rs:320-324 | baml_language/crates/baml_fmt/src/ast/types.rs:345-349 \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":"baml_language/crates/baml_fmt/src/ast/types.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecd0e9a7f49f5c1909123d8699b3449a2c75a7df6ef7615d894a5556a7bb312"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/baml_type_macros/src/emit.rs:689-693 | baml_language/crates/baml_type_macros/src/emit.rs:735-739 \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 \u0060baml_language/crates/baml_type_macros/src/emit.rs:689\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":"baml_language/crates/baml_type_macros/src/emit.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdd08d348be661e246192eb67074316c5094ca7975d312984f9a32de3d72bfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/tools_size_gate/src/main.rs:349-353 | baml_language/crates/tools_size_gate/src/main.rs:408-412 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/crates/tools_size_gate/src/main.rs:349\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":"baml_language/crates/tools_size_gate/src/main.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1610f72d559229734a1371cbb65987cffba9e0249418c3811877108fe2af842"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/crates/tools_stow/src/main.rs:769-773 | baml_language/crates/tools_stow/src/main.rs:801-805 \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 \u0060baml_language/crates/tools_stow/src/main.rs:769\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":"baml_language/crates/tools_stow/src/main.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"e781e28a006b9d0d8f1f73b2b8774a90d636ec7baf267b8d5c76433c1edffe88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/sdks/python/rust/bridge_python/src/encode.rs:137-142 | baml_language/sdks/typescript/bridge_typescript_web/src/encode.rs:145-150 \u2014 before extracting anything, compare \u0060baml_language/sdks/python/rust/bridge_python/src/encode.rs\u0060 and \u0060baml_language/sdks/typescript/bridge_typescript_web/src/encode.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/bridge_python/src/encode.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c63d31a4982631c56b3743594a8f4edf622e85a4bb447fb467be031c5ce2c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/baml-compiler/src/thir/interpret.rs:405-409 | engine/baml-runtime/src/async_interpreter_runtime.rs:851-855 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-compiler/src/thir/interpret.rs:405\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":"engine/baml-compiler/src/thir/interpret.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5dc749f093d1b97f89deb6be5f8631542b31875518ae02ce24910cd2a4add61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/baml-lib/ast/src/ast/expression.rs:370-375 | engine/baml-lib/ast/src/ast/expression.rs:382-387 \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 \u0060engine/baml-lib/ast/src/ast/expression.rs:370\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/baml-lib/ast/src/ast/expression.rs:376\u0060 calls \u0060Identifier\u0060, \u0060Ref\u0060, \u0060Some\u0060 and \u0060engine/baml-lib/ast/src/ast/expression.rs:388\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/expression.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"083814bd46dba6981ee412f3dac7ec454ae51295c4d272c688b394d7ad38bb20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:369-374 | engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:394-399 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:369\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":"engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"453acf8cf6d598bd894df7f462d45f135ecbd24605ad89c356bd5a233ad991ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:382-386 | engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:402-406 \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 \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:382\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:407\u0060 calls \u0060File\u0060 and \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs:387\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":"engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1144dec317fb55e7ca7d650027e95f580cc985927ac5910e812820e4c8a1a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/baml-runtime/src/internal/prompt_renderer/scoped_ir.rs:41-45 | engine/baml-runtime/src/internal/prompt_renderer/scoped_ir.rs:56-60 \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 \u0060engine/baml-runtime/src/internal/prompt_renderer/scoped_ir.rs:41\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":"engine/baml-runtime/src/internal/prompt_renderer/scoped_ir.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16b0944bcd0dddece199da67e34dd5174a628b82efe444d6a25e42250a00ab2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/baml-runtime/src/tracingv2/publisher/rpc_converters/types.rs:21-29 | engine/baml-runtime/src/tracingv2/publisher/rpc_converters/types.rs:72-80 \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 \u0060engine/baml-runtime/src/tracingv2/publisher/rpc_converters/types.rs:21\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":"engine/baml-runtime/src/tracingv2/publisher/rpc_converters/types.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbc30b2b232cb88b2a99718e21ab37b9f4965471acad3e4384c093cbfc30037"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/baml_cffi_macros/src/lib.rs:43-47 | engine/baml_cffi_macros/src/lib.rs:1771-1775 \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 \u0060engine/baml_cffi_macros/src/lib.rs:43\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":"engine/baml_cffi_macros/src/lib.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04360de096d2954f5ead73377c3bea729857db2b61bbe5fb536df1a44a113dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/NativeLibraryLoader.java:126-139 | baml_language/sdks/java/gradle-plugin/src/main/java/com/boundaryml/baml/gradle/BamlPlugin.java:332-343 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/NativeLibraryLoader.java"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbaf55aae7d52f36d529067825b334823abbad0e067ceb8aba5a8be590af105a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/NativeLibraryLoader.java:147-159 | baml_language/sdks/java/gradle-plugin/src/main/java/com/boundaryml/baml/gradle/BamlPlugin.java:351-363 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/NativeLibraryLoader.java"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"35902d58329b347b10472edada82290fca86cc0d8a318ad17da14cb4b4e16b50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:1257-1269 | baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:1369-1381 \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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"419ee9ace7347fea5b4fdbaf6fca62982ed3dcff2ee54c59beaa8b9c0fc124ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:1036-1045 | baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:1410-1419 \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 \u0060baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:1036\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"063b0d674dcf509e8f690e3b093719349ae59b13524f66833fdafec0f6b7670a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlType.java:957-965 | baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:1635-1643 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlType.java"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a2221935195e75a46a1b01cf5d57e2c0f0f6eb8eae199d03870cd7e22a6308"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/TypeRegistry.java:989-997 | baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:1898-1906 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/TypeRegistry.java:989\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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/TypeRegistry.java"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ce03dd4cb39f929213edbaabc0f1511fce8c8778a36f673015da62194a5b7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:1017-1023 | baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:1361-1367 \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 \u0060baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:1017\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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"c326f7113e796ceed1f3be18257764a7d8336784e1214647e9975d6d5d032d40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:736-741 | baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:1260-1265 | baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:1372-1377 \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 \u0060baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:736\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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"becaa7cbb37a690600d8dbdee88742e92597d5673eff808dabc9c3c152ba596b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:704-709 | baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:1230-1235 \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 \u0060baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:704\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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ff38de58d8447b7f7564ab31488127fc1e531b04616d273aa16774473b7af7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:719-724 | baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:1251-1256 \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 \u0060baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:719\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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"509ab42bee37071dd654b89c7dab7b591795fb2f8b1f73f0bcf19c9d90f3e65f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:358-362 | baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:1251-1255 \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 \u0060baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java:358\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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"539888397248153b1e1f99044e6821eb711ac78b4e293ead1058f8837438056c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlCancelledError.java:33-53 | baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlPanic.java:27-47 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlCancelledError.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe4d79b8c4178cbe64aad3297c6cd73374b817b1413a7d6b33b7fa63fcad81f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 2): baml_language/sdks/python/src/baml_bridge/__init__.py:487-516 | baml_language/sdks/python/src/baml_bridge/__init__.py:532-560 \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":"baml_language/sdks/python/src/baml_bridge/__init__.py"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"89212deb5c96ee68b77eb004816a272b95d343f53e6f0b6447e901258cf6658d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): baml_language/tools/speedtest/workloads/memory/allocation-high-retention/main.py:10-28 | baml_language/tools/speedtest/workloads/memory/allocation-low-retention/main.py:10-28 \u2014 \u0060baml_language/tools/speedtest/workloads/memory/allocation-high-retention/main.py\u0060 and \u0060baml_language/tools/speedtest/workloads/memory/allocation-low-retention/main.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 1 separate duplicated blocks between them, totalling at least 19 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/memory/allocation-high-retention/main.py"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"634b0c67fcdc62d0cd907f7185f47d25cedf140b3e6fd86327515fed20b691ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): baml_language/tools/speedtest/src/speedtest/compare.py:85-102 | baml_language/tools/speedtest/src/speedtest/compare.py:211-227 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/tools/speedtest/src/speedtest/compare.py:103\u0060 calls \u0060fmt_delta_pct\u0060 and \u0060baml_language/tools/speedtest/src/speedtest/compare.py:229\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/src/speedtest/compare.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89e6587fd35282ed02545d49e4b1d43abf21881cf7b9fff59219d906cdb3e9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): baml_language/tools/speedtest/workloads/string/join-request-line-10k/main.py:4-15 | baml_language/tools/speedtest/workloads/string/plus-request-line-10k/main.py:4-15 | baml_language/tools/speedtest/workloads/string/template-request-line-10k/main.py:4-15 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/string/join-request-line-10k/main.py"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff00ee029b7ed900ba17a70e62443414fbdea9f2afe76c93eedcfd88d81d931"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): baml_language/tools/speedtest/src/speedtest/profiler.py:42-53 | baml_language/tools/speedtest/src/speedtest/profiler.py:96-107 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/src/speedtest/profiler.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"631a98ebf1c0779c113ea62942193acdda28b90afa9e8f509c14fd6759f942cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/sdks/python/src/baml_bridge/typemap.py:169-177 | baml_language/sdks/python/src/baml_bridge/typemap.py:187-195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdks/python/src/baml_bridge/typemap.py:169\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":"baml_language/sdks/python/src/baml_bridge/typemap.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"113a7e5c7eb1279c6b296a3d4f152aba54068fb00b87414a04cb800effecbe3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): baml_language/sdks/python/src/baml_bridge/typemap.py:151-160 | baml_language/sdks/python/src/baml_bridge/typemap.py:171-178 | baml_language/sdks/python/src/baml_bridge/typemap.py:189-196 \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 \u0060baml_language/sdks/python/src/baml_bridge/typemap.py:151\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":"baml_language/sdks/python/src/baml_bridge/typemap.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a99b7a1d9705877fef5fd1927167abc81dc2197382f8dd7516f90af44397f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tools/bctl_src/oncall/cli.py:83-90 | tools/bctl_src/oncall/cli.py:124-131 \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":"tools/bctl_src/oncall/cli.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"025463da9d58922135b1bf63946ff06151720d6b4e6c299ce459d960c9a7dbbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/tools/speedtest/src/speedtest/storage.py:32-37 | baml_language/tools/speedtest/src/speedtest/storage.py:60-65 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/src/speedtest/storage.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fd05375dee8c9e4d17c45b66af4124e49498573d21eeca8a742a24fbbb69e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 9): engine/generators/data/array_types/python/main.py:143-157 | engine/generators/data/edge_cases/python/main.py:202-216 | engine/generators/data/literal_types/python/main.py:66-79 | engine/generators/data/map_types/python/main.py:162-175 | engine/generators/data/mixed_complex_types/python/main.py:231-242 | engine/generators/data/nested_structures/python/main.py:237-249 | engine/generators/data/optional_nullable/python/main.py:153-166 | engine/generators/data/primitive_types/python/main.py:80-93 | engine/generators/data/union_types_extended/python/main.py:133-145 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 9 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 9 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/array_types/python/main.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfc6e9310dbe3e11c0a7f34d2158b9aa6818f98d1e289995e0b3036b7929ce2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): engine/generators/data/recursive_types/python/main.py:9-13 | engine/generators/data/sample/python/main.py:9-13 | engine/generators/data/unions/python/main.py:9-13 \u2014 before extracting anything, compare \u0060engine/generators/data/recursive_types/python/main.py\u0060 and \u0060engine/generators/data/sample/python/main.py\u0060 as WHOLE FILES: 100% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/recursive_types/python/main.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9339ceb2f62a5b48852a99ba9c50595e8a2bc3dde64e585e3905c0dde62338ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): baml_language/sdks/go/baml_go/media.go:118-143 | baml_language/sdks/go/baml_go/media.go:167-192 \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 \u0060baml_language/sdks/go/baml_go/media.go:118\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":"baml_language/sdks/go/baml_go/media.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"6287c31029c549f34b22b1905b93718af180c044ebc84f005140e7169fb3754c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): baml_language/sdks/go/baml_go/runtime.go:400-421 | baml_language/sdks/go/baml_go/runtime.go:453-473 \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 \u0060baml_language/sdks/go/baml_go/runtime.go:400\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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/runtime.go"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb27c13a75938f3533c09a1fe939d038ee28061587478eab47c73a4d11b98b33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): baml_language/sdks/go/baml_go/runtime.go:424-441 | baml_language/sdks/go/baml_go/runtime.go:476-493 \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 \u0060baml_language/sdks/go/baml_go/runtime.go:424\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/runtime.go"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb78e9b179371f4d451741003e8f3e04938db1bc85e1535121ddb59ae0160f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/language_client_go/baml_go/raw_objects/utils.go:53-69 | engine/language_client_go/pkg/callbacks.go:96-112 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/language_client_go/baml_go/raw_objects/utils.go:53\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":"engine/language_client_go/baml_go/raw_objects/utils.go"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4499acc2833a0fe2e8ea97162cf18a8abbdf2453363c18ef705f853e909c57f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/language_client_go/pkg/rawobjects_constructors.go:37-53 | engine/language_client_go/pkg/rawobjects_constructors.go:75-91 \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 \u0060engine/language_client_go/pkg/rawobjects_constructors.go:37\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/pkg/rawobjects_constructors.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e04cbfc2064b269ce83253ed644bf95432c830ed50b419ebc8c44665ec7a4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/language_client_go/pkg/runtime.go:153-166 | engine/language_client_go/pkg/runtime.go:197-210 \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 \u0060engine/language_client_go/pkg/runtime.go:153\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/pkg/runtime.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"433ca69a4b5cf1b6263b973914e1ac9d7bb08e20e1bf8f64a27a744402920f84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/language_client_go/pkg/rawobjects_collector.go:28-39 | engine/language_client_go/pkg/rawobjects_function_log.go:84-95 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/pkg/rawobjects_collector.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b682dc9ff1dcfa4d6eb1d2b28c39e6ed797503dbbef3869a9dc09aea9ff2cfa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/language_client_go/pkg/rawobjects_function_log.go:28-39 | engine/language_client_go/pkg/rawobjects_http_request.go:28-39 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/pkg/rawobjects_function_log.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"814b1014d6455b65fea526755cf70e2abf98745831477475f6fc1a3f5cc3c621"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/language_client_go/pkg/rawobjects_function_log.go:70-81 | engine/language_client_go/pkg/rawobjects_llm_call.go:129-140 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/pkg/rawobjects_function_log.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"367a3489be6b136e0daddb0ec2fe6a0d162d59e648f0d110f5ec39230bed027b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/language_client_go/pkg/rawobjects_http_body.go:28-39 | engine/language_client_go/pkg/rawobjects_sse_response.go:28-39 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/pkg/rawobjects_http_body.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d1a3a02855443a7ec490258006724cad0d0702ff7c0891847ac4c39640e166"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/language_client_go/pkg/rawobjects_http_request.go:70-81 | engine/language_client_go/pkg/rawobjects_http_response.go:56-67 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/pkg/rawobjects_http_request.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"57905f8c70df122fc093e265c6e7388612a1c250087fbd6175713a5115e2e4b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/language_client_go/pkg/rawobjects_http_request.go:84-95 | engine/language_client_go/pkg/rawobjects_http_response.go:70-81 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/pkg/rawobjects_http_request.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7623e191e4d8f23f2c9f183386a059ccd3525550003f7586711d209f2a1f71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/sdks/go/baml_go/container.go:33-43 | baml_language/sdks/go/baml_go/container.go:116-126 \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 \u0060baml_language/sdks/go/baml_go/container.go:33\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/container.go"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa5cbfcd08eabe32317c31c6a9b611574c60bc83d451e461af92f72dea43e4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/language_client_go/baml_go/serde/encode.go:89-99 | engine/language_client_go/baml_go/serde/encode.go:104-114 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/baml_go/serde/encode.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"3715e3414d6959f9d58f0864e54805ccfb26a3071ef11b8639369182df4e67b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/sdks/go/baml_go/container.go:140-149 | baml_language/sdks/go/baml_go/container.go:157-166 \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 \u0060baml_language/sdks/go/baml_go/container.go:140\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":"baml_language/sdks/go/baml_go/container.go"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad6a9879efcac0d58cd543b57548123e5735b6e7ab11003eccad9f013495244"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/sdks/go/baml_go/media.go:99-108 | baml_language/sdks/go/baml_go/media.go:154-163 \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 \u0060baml_language/sdks/go/baml_go/media.go:99\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":"baml_language/sdks/go/baml_go/media.go"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac1ffc255c20e82232d2cf1b88b4ff323cbe9d42b4a3b1326798cb2e5451818"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/language_client_go/baml_go/serde/decode.go:91-100 | engine/language_client_go/baml_go/serde/decode.go:250-259 \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":"engine/language_client_go/baml_go/serde/decode.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c347bac4c2caf47fba52d3d85b48d1d400ea1477e6f957e526af50610443182"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/sdks/go/baml_go/native_unix.go:321-329 | baml_language/sdks/go/baml_go/native_unix.go:348-356 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/native_unix.go"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4ce200db5f9b8c4232bc232f857196284641e549e90fa2343576572f2e89be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/sdks/go/baml_go/class.go:63-70 | baml_language/sdks/go/baml_go/dynamic.go:224-231 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/class.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6798156c0303bd8e2a9a7c6aa6be640ad7c0350e8334242c3d30111696088d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): baml_language/sdks/go/baml_go/class.go:62-68 | baml_language/sdks/go/baml_go/container.go:141-147 | baml_language/sdks/go/baml_go/container.go:158-164 | baml_language/sdks/go/baml_go/dynamic.go:223-229 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdks/go/baml_go/class.go:62\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":"baml_language/sdks/go/baml_go/class.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"48352cc2f7f2fb945446444ed6ecdfd808f9855bc093246ca296c410fa20aef6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/sdks/go/baml_go/dynamic.go:638-644 | baml_language/sdks/go/baml_go/json.go:481-487 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdks/go/baml_go/dynamic.go:638\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/dynamic.go"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af351336f5139dd28355c5e4a337f376d84e5a3b521962c4dd10ede28101ea4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): baml_language/sdks/go/baml_go/media.go:339-344 | baml_language/sdks/go/baml_go/media.go:359-364 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/media.go"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"5872b59b6299e20da7c74937897b3c2e822ae4f17587d2def5b7c3b4a375f003"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/language_client_go/pkg/rawobjects_http_body.go:41-48 | engine/language_client_go/pkg/rawobjects_sse_response.go:41-48 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/pkg/rawobjects_http_body.go"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a764bba9476b8467d3f673514220d5082f0e1c96f8941ed930ff0aec32935a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): engine/language_client_go/pkg/rawobjects_class_builder.go:21-25 | engine/language_client_go/pkg/rawobjects_class_property_builder.go:21-25 | engine/language_client_go/pkg/rawobjects_enum_builder.go:21-25 | engine/language_client_go/pkg/rawobjects_enum_value_builder.go:20-24 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/pkg/rawobjects_class_builder.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d88a90b4733007754820cc150552614456ad1f4efd77594b89b0072e4cb000"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/language_client_go/pkg/rawobjects_type_builder.go:283-296 | engine/language_client_go/pkg/rawobjects_type_builder.go:300-313 \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 \u0060engine/language_client_go/pkg/rawobjects_type_builder.go:283\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/pkg/rawobjects_type_builder.go"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"1412e75ca9be3163e9876144f16aae6627d81b78508b13dd594717cdd47efcfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/language_client_go/pkg/rawobjects_type_builder.go:229-242 | engine/language_client_go/pkg/rawobjects_type_builder.go:246-259 \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 \u0060engine/language_client_go/pkg/rawobjects_type_builder.go:229\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/pkg/rawobjects_type_builder.go"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d722b2bafa16ac26aad554fc4eeedf953d3f57bed7ffa57ff4ded36c2dee44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/sdks/go/baml_go/dynamic.go:672-682 | baml_language/sdks/go/baml_go/json.go:203-212 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdks/go/baml_go/dynamic.go:672\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/dynamic.go"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed079c6aea5f69c0f46943ce588c532ce517824d9c34c07ed127a79b5e9c32c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/language_client_go/baml_go/raw_objects/utils.go:120-126 | engine/language_client_go/baml_go/raw_objects/utils.go:176-181 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/language_client_go/baml_go/raw_objects/utils.go:120\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":"engine/language_client_go/baml_go/raw_objects/utils.go"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75851a0ed61ec6920126bdf09a34351d5cb24a1a2e15daa20f387b46444392f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/sdks/go/baml_go/dynamic.go:619-625 | baml_language/sdks/go/baml_go/json.go:176-182 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdks/go/baml_go/dynamic.go:619\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/dynamic.go"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccec6dc7f77dc9138b9e66445603fd3783f45a9274653df41a80772e1f35ce5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/sdks/go/baml_go/rust_type.go:99-105 | baml_language/sdks/go/baml_go/rust_type.go:118-124 \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 \u0060baml_language/sdks/go/baml_go/rust_type.go:99\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: \u0060baml_language/sdks/go/baml_go/rust_type.go:118\u0060 is reached only past a guard at line 115 that tests \u0060value.handle\u0060 and leaves the function early, and \u0060baml_language/sdks/go/baml_go/rust_type.go:99\u0060 reads \u0060value.handle\u0060 with no such check. What separates these copies is not which lines they run but which PRECONDITION they enforce, so one of them is operating on state the other one refuses. Decide which is intended BEFORE unifying them \u2014 extract the shared part and whichever copy is missing the check keeps running unchecked, and if the guard is the correct behaviour then that hole is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/rust_type.go"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0195ea592d72e702e90b7abc3d611527adbd94417032ee21a2ca23c5fb0c9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/sdks/go/baml_go/dynamic.go:659-665 | baml_language/sdks/go/baml_go/json.go:193-199 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdks/go/baml_go/dynamic.go:659\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":"baml_language/sdks/go/baml_go/dynamic.go"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11274d465e51234e56fa088944bbb4d4a42a3eff9f4732df6930a1908c047a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/sdks/go/baml_go/dynamic.go:390-398 | baml_language/sdks/go/baml_go/json.go:68-76 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdks/go/baml_go/dynamic.go:390\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/dynamic.go"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5477a9968ca69ee7c5955374db88f3c9a04a08601db0d4cb210a18f9579d49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/language_client_go/baml_go/serde/decode.go:177-182 | engine/language_client_go/baml_go/serde/decode.go:305-310 \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":"engine/language_client_go/baml_go/serde/decode.go"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c4e3ce645f46bb052ef94f0e225d92726da84404b25b6cccfb8d7328fb0654"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): baml_language/sdks/go/baml_go/dynamic.go:687-691 | baml_language/sdks/go/baml_go/dynamic.go:724-728 \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 \u0060baml_language/sdks/go/baml_go/dynamic.go:687\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":"baml_language/sdks/go/baml_go/dynamic.go"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6cccc049a15148c0175dc55216212cb4a58cef9e828fd52e048cb9a2518b18e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): baml_language/sdks/swift/Sources/BamlBridge/Runtime.swift:334-350 | baml_language/sdks/swift/Sources/BamlBridge/Runtime.swift:363-375 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdks/swift/Sources/BamlBridge/Runtime.swift:334\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/Runtime.swift"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"b776acfc9bcbc4fe82235144ad007e812cac78208ebed916d4d8d074652b48fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:627-634 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:817-824 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:1023-1030 \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 \u0060baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:627\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"9769047d22086c5f8e160cb1c4ee3d0b5b6bcb29e98c60510f38834711c81691"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): baml_language/sdks/swift/Sources/BamlBridge/Decode.swift:214-220 | baml_language/sdks/swift/Sources/BamlBridge/Decode.swift:229-235 | baml_language/sdks/swift/Sources/BamlBridge/Decode.swift:237-243 \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":"baml_language/sdks/swift/Sources/BamlBridge/Decode.swift"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"036f0bc0421b638f61132ef3424442b5c118410c2cdd911e7695f28f4c42b600"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 13): baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:92-96 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:224-228 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:234-235 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:372-376 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:383-384 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:536-540 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:548-549 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:716-720 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:729-730 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:912-916 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:926-927 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:1124-1128 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:1139-1140 \u2014 all 13 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 \u0060baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:92\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:533\u0060 calls \u0060_bamlDecodeSelects\u0060, \u0060t2\u0060, \u0060_bamlDecode\u0060 and \u0060baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:91\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":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49e74786a4f10ebf71363667edad213922b46ebda457b726dc6747cac9bb9ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 14): baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:121-125 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:130-131 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:258-262 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:268-269 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:411-415 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:422-423 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:580-584 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:592-593 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:765-769 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:778-779 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:966-970 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:980-981 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:1183-1187 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:1198-1199 \u2014 all 14 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 \u0060baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:121\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:125\u0060 calls \u0060t0\u0060, \u0060_bamlDecode\u0060 and \u0060baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:131\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":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"400e15f7090636069ee551b62de93ec81885bddcb2c38ff1f686e431bf73cde2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:318-322 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:478-482 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:654-658 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:846-850 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:1054-1058 \u2014 all 5 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 \u0060baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:318\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:483\u0060 calls \u0060t4\u0060, \u0060onT4\u0060 and \u0060baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:323\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":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3248df86a7816810918a7f229f44f987ba4f8cb99b068027edde3248beae57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:87-91 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:218-222 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:365-369 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:528-532 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:707-711 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:902-906 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:1113-1117 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:87\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:223\u0060 calls \u0060_bamlDecodeSelects\u0060, \u0060t2\u0060, \u0060_bamlDecode\u0060 and \u0060baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:92\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd15cfbec334463af5a19f72c662d68045a0a9e1a058b9424bb289f8cc34227e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:327-331 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:488-492 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:665-669 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:858-862 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:1067-1071 \u2014 all 5 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 \u0060baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:327\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:493\u0060 calls \u0060t4\u0060, \u0060onT4\u0060 and \u0060baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:332\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee5f89995789c767d88aa8ed87a16866be651465962a23e27a35fe3a0dbff82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:568-572 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:751-755 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:950-954 | baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:1165-1169 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:756\u0060 calls \u0060unionArm\u0060 and \u0060baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift:574\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/swift/Sources/BamlBridge/BamlUnions.swift"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef473dee8769b7970bc257d04a2f5783c519b9d95e4c82df79253488ec4c136b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (110 corresponding lines): baml_language/forks/aws-config-systest/run-e2e.py:440-549 | baml_language/forks/google-cloud-auth-systest/run-e2e.py:273-384 \u2014 These two members are one piece of code written twice and then edited apart: 110 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":"baml_language/forks/aws-config-systest/run-e2e.py"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"3326b76cd9f9c067fe0aa83027019492ca8d005089ef8823970e0256faf58beb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): baml_language/sdk_tests/harness_runner/src/lib.rs:193-221 | baml_language/sdk_tests/harness_runner/src/lib.rs:278-309 \u2014 These two members are one piece of code written twice and then edited apart: 29 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":"baml_language/sdk_tests/harness_runner/src/lib.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae20fb917aa68a1d12c66e8cfbc0a3b517b5f9cdd7acfb2bf9ae81a7d4bd31b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): baml_language/sdk_tests/codegen/src/lib.rs:225-256 | baml_language/sdk_tests/codegen/src/lib.rs:268-308 \u2014 These two members are one piece of code written twice and then edited apart: 32 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":"baml_language/sdk_tests/codegen/src/lib.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e8bad22b091b6c2ff1c40f6e4ab57e5ca9ebffaa6ef6b63b8cf55ee4931dab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): baml_language/crates/baml_tests/src/type_spec/tables.rs:17-34 | baml_language/crates/baml_tests/src/type_spec/tables.rs:66-89 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_tests/src/type_spec/tables.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"78296f54bd16754560b3e2ef69295ff2879316da35c8b6c40595585b457058c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 26\u002B corresponding lines): baml_language/sdk_tests/codegen/src/java.rs:55-87 | baml_language/sdk_tests/codegen/src/python_pydantic2.rs:47-72 | baml_language/sdk_tests/codegen/src/swift.rs:39-76 | baml_language/sdk_tests/codegen/src/typescript.rs:34-60 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 26 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":"baml_language/sdk_tests/codegen/src/java.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c83a88539bf5c858479a148c9f3c94d56d54bffaec5e242fd1f166c586dcbb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): baml_language/crates/baml_tests/src/type_spec/coherence.rs:18-39 | baml_language/crates/baml_tests/src/type_spec/coherence.rs:41-58 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_tests/src/type_spec/coherence.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c56d475d8d25a87fd290a1c7f5ba46c05421764b18fdf255cefddb69a085fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): baml_language/sdk_tests/codegen/src/lib.rs:550-572 | baml_language/sdk_tests/harness_runner/src/lib.rs:97-119 \u2014 These two members are one piece of code written twice and then edited apart: 23 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":"baml_language/sdk_tests/codegen/src/lib.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"814a43920b5408a00e8ebd94ab370708a04d382062d19a7bad84270683efd987"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): baml_language/crates/baml_tests/src/engine.rs:113-135 | baml_language/crates/baml_tests/src/engine.rs:232-246 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_tests/src/engine.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0995986aa9575d87e12702196aab058324158483cc75663317fae2d4f0fcec10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): baml_language/crates/baml_cli/src/test_command.rs:187-203 | baml_language/crates/baml_cli/src/test_command.rs:205-218 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/test_command.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b116cb3ecbc1c43aa128789f66b209b3d373e51617f6ba338a3d58ba6d53cde"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): baml_language/sdk_tests/crates/csharp/basic_calls/TestInvocation.cs:7-14 | baml_language/sdk_tests/crates/csharp/basic_calls/TestInvocation.cs:17-24 \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":"baml_language/sdk_tests/crates/csharp/basic_calls/TestInvocation.cs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0c30f38b1471b1f84aac9922314265a7ea7238700d59c807fc707ae71da25f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): baml_language/sdk_tests/codegen/src/csharp.rs:45-54 | baml_language/sdk_tests/harness_runner/src/fixtures.rs:28-43 \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":"baml_language/sdk_tests/codegen/src/csharp.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ca12f8f5e4d8ec170374d5e7791a109f2193b47d30f0aef7edc8e592f9952f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): baml_language/sdk_tests/crates/csharp/dynamic_values/Program.cs:224-237 | baml_language/sdk_tests/crates/csharp/dynamic_values/Program.cs:240-254 | baml_language/sdk_tests/crates/csharp/dynamic_values/Program.cs:257-271 \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":"baml_language/sdk_tests/crates/csharp/dynamic_values/Program.cs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0d42999274ff23b9c7eaac5c32a7c4c9c2011c416d6fef72394e5e7d8cdae0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): baml_language/sdk_tests/crates/csharp/basic_calls/TestInvocation.cs:33-49 | baml_language/sdk_tests/crates/csharp/basic_calls/TestInvocation.cs:58-74 \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":"baml_language/sdk_tests/crates/csharp/basic_calls/TestInvocation.cs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbb49bdad544ed590ff06da07d9ecac90285d80406d19b126ef8d06b51ca28d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/generators/utils/test_harness/src/lib.rs:421-432 | engine/generators/utils/test_harness/src/lib.rs:434-444 \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":"engine/generators/utils/test_harness/src/lib.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0dc5cb09d9cc31d2e885b2ddd10058004eeff0da6605186d726dcaea016e1ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): integ-tests/ruby/tracing-demo1.rb:15-30 | integ-tests/ruby/tracing-demo1.rb:69-82 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/ruby/tracing-demo1.rb"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8892a817c7ec3842023a911125da404f91fbb2d04d2ca705ccf373e919fcee14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): baml_language/forks/aws-config-systest/run-e2e.py:130-139 | baml_language/forks/google-cloud-auth-systest/run-e2e.py:106-114 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/forks/aws-config-systest/run-e2e.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b44a41830bea77f7b305e814b83cffab9d0bfef1685bd2e45e48835d8bad4e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): baml_language/sdks/rust/bridge_rust/src/spec.rs:290-298 | baml_language/sdks/rust/bridge_rust/src/spec.rs:632-642 | baml_language/sdks/rust/bridge_rust/src/spec.rs:647-658 \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":"baml_language/sdks/rust/bridge_rust/src/spec.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec01101573ac525dd4d74fbd5d30cb1e6dcdf8dc12a493f7a3bf15ed16d030ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): baml_language/forks/aws-config-systest/run-e2e.py:84-91 | baml_language/forks/google-cloud-auth-systest/run-e2e.py:74-80 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/forks/aws-config-systest/run-e2e.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ec009d6e150156a7a865ccb780ed311a20c185c0331441e8dfd420315ad726"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): baml_language/forks/aws-config-systest/run-e2e.py:118-127 | baml_language/forks/google-cloud-auth-systest/run-e2e.py:95-103 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/forks/aws-config-systest/run-e2e.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd853882745f8d5adfbdf18ceed205dfb1cb0f6b2c1c01fc475b12c166242f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): baml_language/sdk_tests/crates/csharp/stdlib_resources/Program.cs:471-482 | baml_language/sdk_tests/crates/csharp/streaming/Program.cs:287-298 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdk_tests/crates/csharp/stdlib_resources/Program.cs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f1b6ae4051df5440177701eb1aca69daae5b2fced8d81b60b5cadc9eef0f25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): baml_language/forks/aws-config-systest/run-e2e.py:97-101 | baml_language/forks/google-cloud-auth-systest/run-e2e.py:83-84 \u2014 These two members are one piece of code written twice and then edited apart: 2 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":"baml_language/forks/aws-config-systest/run-e2e.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8f201dcb573cf021fb90f5dd36e656ff440fb4fde96888e12f6c547ad2843b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): engine/generators/utils/test_harness/src/lib.rs:134-151 | engine/generators/utils/test_harness/src/lib.rs:216-233 \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 \u0060engine/generators/utils/test_harness/src/lib.rs:134\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":"engine/generators/utils/test_harness/src/lib.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fc20ebff95fa76bbecef310f48ccee245b2706f1da913e763f027089ccd8e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): baml_language/sdk_tests/harness_runner/src/lib.rs:321-337 | baml_language/sdk_tests/harness_runner/src/lib.rs:389-404 \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 \u0060baml_language/sdk_tests/harness_runner/src/lib.rs:321\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":"baml_language/sdk_tests/harness_runner/src/lib.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8a9b6969151aeafef27ce4d55c165d104c53c19714788a93354137a2434b32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): baml_language/sdk_tests/codegen/src/lib.rs:226-238 | baml_language/sdk_tests/codegen/src/lib.rs:269-284 \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 \u0060baml_language/sdk_tests/codegen/src/lib.rs:226\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdk_tests/codegen/src/lib.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a7289cd45fe9b33dc6df220b26723cf68752fc97e1f996f66fa7af8910c1e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): engine/generators/utils/test_harness/src/lib.rs:109-125 | engine/generators/utils/test_harness/src/lib.rs:192-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/utils/test_harness/src/lib.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"6560a02a4f5bb0d8b197934dacaebadacbc2554556bdaf9207750a46ab782c95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/baml-runtime/src/test_executor/output_pretty.rs:80-94 | engine/baml-runtime/src/test_executor/output_pretty.rs:107-121 \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":"engine/baml-runtime/src/test_executor/output_pretty.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d01aeedd7dca51931f4de3b84edc3329b7e605817e9c11220d527b7d2f46e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/baml-runtime/src/test_executor/test_execution_args.rs:13-25 | engine/baml-runtime/src/test_executor/test_execution_args.rs:26-38 \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":"engine/baml-runtime/src/test_executor/test_execution_args.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3ed30a16c7059ecb4d7e40b38571bba20448056e702225efa46b738c0793c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/baml-runtime/src/test_executor/output_pretty.rs:211-222 | engine/baml-runtime/src/test_executor/output_pretty.rs:242-253 \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 \u0060engine/baml-runtime/src/test_executor/output_pretty.rs:211\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":"engine/baml-runtime/src/test_executor/output_pretty.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"4847ab5d27bccef2b83c479973763d9aee5baa8f445009f10ae62b9aa31af4fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/crates/baml_cli/src/test_command.rs:193-203 | baml_language/crates/baml_cli/src/test_command.rs:208-218 \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 \u0060baml_language/crates/baml_cli/src/test_command.rs:193\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":"baml_language/crates/baml_cli/src/test_command.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19d72b1e9914b27c0580d64e6ff748e01737ffba11cc0942cca5867eb0555f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/sdk_tests/crates/csharp/dynamic_values/Program.cs:246-254 | baml_language/sdk_tests/crates/csharp/dynamic_values/Program.cs:263-271 \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 \u0060baml_language/sdk_tests/crates/csharp/dynamic_values/Program.cs:246\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":"baml_language/sdk_tests/crates/csharp/dynamic_values/Program.cs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cab2bd683bba6a989cbf2f25a7f370358b098d9132da40493963feae7ab228"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201310 lines \u00D7 2): engine/baml-runtime/src/test_executor/mod.rs:228-233 | engine/baml-runtime/src/test_executor/mod.rs:251-260 \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 \u0060engine/baml-runtime/src/test_executor/mod.rs:228\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"engine/baml-runtime/src/test_executor/mod.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ad686bc24028e6184c3ca6e142e522e87ad0e0ae8815e3ab57dd289b1aac6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/crates/baml_tests/src/type_spec/tables.rs:18-26 | baml_language/crates/baml_tests/src/type_spec/tables.rs:67-75 \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 \u0060baml_language/crates/baml_tests/src/type_spec/tables.rs:18\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":"baml_language/crates/baml_tests/src/type_spec/tables.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da4f361900dec80ad607dbc5ea10c7ee547ecd043d92853f099680fa35c0910"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/generators/utils/type_test_spec/src/lib.rs:122-130 | engine/generators/utils/type_test_spec/src/lib.rs:158-166 \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 \u0060engine/generators/utils/type_test_spec/src/lib.rs:122\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":"engine/generators/utils/type_test_spec/src/lib.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"7824ab948a2cc9cd7b5f8c088af40d303b53569f62b2726a8baea20dbf6c8684"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): engine/generators/utils/type_test_spec/src/lib.rs:127-135 | engine/generators/utils/type_test_spec/src/lib.rs:163-171 | engine/generators/utils/type_test_spec/src/lib.rs:257-265 \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 \u0060engine/generators/utils/type_test_spec/src/lib.rs:127\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":"engine/generators/utils/type_test_spec/src/lib.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"0643380cfbd8cebf04538d14516cba08e2fe9034445245020114f40eeb5a321d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/sdk_tests/codegen/src/cpp.rs:36-42 | baml_language/sdk_tests/codegen/src/java.rs:56-66 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdk_tests/codegen/src/cpp.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd2c868275018fa97c8b5910a8838828c70b8cf1f70f70747482812429897e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/baml-runtime/src/test_executor/mod.rs:174-180 | engine/baml-runtime/src/test_executor/mod.rs:245-251 \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 \u0060engine/baml-runtime/src/test_executor/mod.rs:174\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":"engine/baml-runtime/src/test_executor/mod.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbb655401f2e72b527f3db5c6b2b37d0054205d69c2dd633c566ec4374ba1a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/generators/utils/type_test_spec/src/lib.rs:416-422 | engine/generators/utils/type_test_spec/src/lib.rs:442-448 \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":"engine/generators/utils/type_test_spec/src/lib.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"6513e6cc7b63ba3656b40d28a7ca3a468b0aafaf8d9875915081d510c5a6f518"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/baml-runtime/src/test_executor/output_pretty.rs:381-392 | engine/baml-runtime/src/test_executor/output_pretty.rs:424-435 \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":"engine/baml-runtime/src/test_executor/output_pretty.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a83e2cfc2b43201893ebab45d8a4c52c63518e97b15baef520ff7d367020d82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): baml_language/sdk_tests/crates/csharp/failures_and_cancellation/Program.cs:113-123 | baml_language/sdk_tests/crates/csharp/stdlib_resources/Program.cs:457-467 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"baml_language/sdk_tests/crates/csharp/failures_and_cancellation/Program.cs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d865dc5158dd4e14ceb6c9765bc5110615d8b292ef7a97705126417e3cabc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): baml_language/sdk_tests/crates/csharp/generics/Program.cs:162-172 | baml_language/sdk_tests/crates/csharp/primitive_edges/Program.cs:163-173 | baml_language/sdk_tests/crates/csharp/type_roundtrips/Program.cs:149-159 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. 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":"baml_language/sdk_tests/crates/csharp/generics/Program.cs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fcf8d1199aff816586a891455bff39214cb998149171da775d22abe89c18a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): baml_language/sdk_tests/codegen/src/cpp.rs:28-33 | baml_language/sdk_tests/codegen/src/java.rs:48-53 | baml_language/sdk_tests/codegen/src/python_pydantic2.rs:40-45 | baml_language/sdk_tests/codegen/src/rust.rs:185-190 | baml_language/sdk_tests/codegen/src/swift.rs:32-37 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 5 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdk_tests/codegen/src/cpp.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbd65602c95d0d85eb9e4d56f1f595f6ecea13943a6f3eb70c46136b87f2f8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): baml_language/sdk_tests/codegen/src/csharp.rs:79-87 | baml_language/sdk_tests/codegen/src/lib.rs:158-166 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdk_tests/codegen/src/csharp.rs:79\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060baml_language/sdk_tests/codegen/src/lib.rs:169\u0060 calls \u0060display\u0060 and \u0060baml_language/sdk_tests/codegen/src/csharp.rs:90\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":"baml_language/sdk_tests/codegen/src/csharp.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"64987171947fbe83d319fdc04469dac6771c5b70aa9c9037de6131ba1d9fc1dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/sdk_tests/codegen/src/python_pydantic2.rs:56-63 | baml_language/sdk_tests/codegen/src/swift.rs:48-55 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060baml_language/sdk_tests/codegen/src/python_pydantic2.rs:56\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":"baml_language/sdk_tests/codegen/src/python_pydantic2.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ceb96fb9d8765340819ad9ace4de8b7f27670838beb720c6c76832edc5e76b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/sdk_tests/harness_runner/src/lib.rs:203-210 | baml_language/sdk_tests/harness_runner/src/lib.rs:292-298 \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 \u0060baml_language/sdk_tests/harness_runner/src/lib.rs:203\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060baml_language/sdk_tests/harness_runner/src/lib.rs:291\u0060 calls \u0060workspace_root_from_manifest\u0060, \u0060join\u0060 and \u0060baml_language/sdk_tests/harness_runner/src/lib.rs:203\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdk_tests/harness_runner/src/lib.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbad91c80bacca66e02133b84fa1d062232f3d46b87efa7052309a849ea9c875"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): baml_language/forks/aws-config-systest/run-e2e.py:440-467 | baml_language/forks/google-cloud-auth-systest/run-e2e.py:273-301 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/forks/aws-config-systest/run-e2e.py"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f09408a31874ef6868104b5357e1c5f876298cdf7785ece9c9f89dfd89bd941"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): scripts/ffi-debug/analyze_ffi.py:298-317 | scripts/ffi-debug/analyze_ffi.py:327-346 | scripts/ffi-debug/analyze_ffi.py:365-384 \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":"scripts/ffi-debug/analyze_ffi.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd0a9f2eb2e8cceb714c0839fb0d32aa9132e8f99ef67d8770544369f8159a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201319 lines \u00D7 2): scripts/ffi-debug/analyze_ffi.py:197-210 | scripts/ffi-debug/analyze_ffi.py:220-238 \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":"scripts/ffi-debug/analyze_ffi.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed353d84dbf5c8db03b6222730b3096633010def24f9e93b4d7078af164cc58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): scripts/ffi-debug/analyze_ffi.py:580-597 | scripts/ffi-debug/analyze_ffi.py:600-617 \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":"scripts/ffi-debug/analyze_ffi.py"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"040cffea41e65ce1f544e687438c7796400396745f8be9d76a1839ec14a202d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): baml_language/forks/aws-config-systest/run-e2e.py:540-549 | baml_language/forks/google-cloud-auth-systest/run-e2e.py:375-384 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/forks/aws-config-systest/run-e2e.py"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9446b3cd55d26ac3b51cd9d145839f9fd0b56423d10a1fcee21e7216252f9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201310 lines \u00D7 6): scripts/ffi-debug/analyze_ffi.py:656-659 | scripts/ffi-debug/analyze_ffi.py:660-663 | scripts/ffi-debug/analyze_ffi.py:668-671 | scripts/ffi-debug/analyze_ffi.py:676-685 | scripts/ffi-debug/analyze_ffi.py:690-699 | scripts/ffi-debug/analyze_ffi.py:700-706 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060scripts/ffi-debug/analyze_ffi.py:671\u0060 calls \u0060set_ylabel\u0060, \u0060n\u0060 and \u0060scripts/ffi-debug/analyze_ffi.py:659\u0060 does not \u2014 after which the two agree again for 5 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":"scripts/ffi-debug/analyze_ffi.py"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc36f4e773b10ee3436e4e4d3b033df719bea0edd74e8ed06873afe0d8741e18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): scripts/ffi-debug/analyze_ffi.py:102-110 | scripts/ffi-debug/analyze_ffi.py:111-118 | scripts/ffi-debug/analyze_ffi.py:120-127 \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. 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":"scripts/ffi-debug/analyze_ffi.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"11eb8a9bbeab654524a14984e15a8c2110e321bd290a64c538125e93bb583d38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/ffi-debug/analyze_ffi.py:402-409 | scripts/ffi-debug/analyze_ffi.py:411-418 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ffi-debug/analyze_ffi.py"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ea1def08a92fa5fd4825b9e0696e3c629fcab7f15526039452634f27830db3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 4): scripts/ffi-debug/analyze_ffi.py:297-302 | scripts/ffi-debug/analyze_ffi.py:325-331 | scripts/ffi-debug/analyze_ffi.py:354-359 | scripts/ffi-debug/analyze_ffi.py:364-369 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ffi-debug/analyze_ffi.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d8e05101c1eb94f0f35734d38e9730e2a0c7600bbfcefd9995d61f7ece15a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): scripts/ffi-debug/analyze_ffi.py:183-188 | scripts/ffi-debug/analyze_ffi.py:206-211 | scripts/ffi-debug/analyze_ffi.py:221-226 | scripts/ffi-debug/analyze_ffi.py:234-239 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060scripts/ffi-debug/analyze_ffi.py:212\u0060 calls \u0060sum\u0060, \u0060values\u0060 and \u0060scripts/ffi-debug/analyze_ffi.py:229\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ffi-debug/analyze_ffi.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"b435921733129ba7ad06a293326e5821ef42552d3a276f645b58dacc36a8db41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): scripts/ffi-debug/analyze_ffi.py:158-163 | scripts/ffi-debug/analyze_ffi.py:169-174 | scripts/ffi-debug/analyze_ffi.py:176-181 \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":"scripts/ffi-debug/analyze_ffi.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf42ff34b2a8ba2cef4ffca48a275b024fecc2be9fb90ac93f707647aeeb0e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): baml_language/forks/aws-config-systest/run-e2e.py:227-234 | baml_language/forks/google-cloud-auth-systest/run-e2e.py:168-175 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/forks/aws-config-systest/run-e2e.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"15bd615db6d01ea2005869698683924c28c29d4fca1a7342208183e752dce3bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): baml_language/forks/aws-config-systest/run-e2e.py:156-162 | baml_language/forks/google-cloud-auth-systest/run-e2e.py:140-146 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/forks/aws-config-systest/run-e2e.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87479099b5c3b440b4ad60530352c305bcae875cc8ab50653aa1fb7d4eea210"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201358 lines \u00D7 2): integ-tests/ruby/test_functions.rb:366-402 | integ-tests/ruby/test_functions.rb:404-461 \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 \u0060integ-tests/ruby/test_functions.rb:366\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/ruby/test_functions.rb"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffabc6873470b167cde9bfdb0b32fb2929880ff4bfd6e7ae65fac21b7395718b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201333 lines \u00D7 2): integ-tests/ruby/test_collector.rb:41-73 | integ-tests/ruby/test_collector.rb:162-193 \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":"integ-tests/ruby/test_collector.rb"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"634e4f02f69fcb7284f865e8580935e5d29e91104a372a6978cc8a9db26dcf18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): integ-tests/ruby/test_functions.rb:220-235 | integ-tests/ruby/test_functions.rb:242-257 \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":"integ-tests/ruby/test_functions.rb"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"56bf995b99c1944ace3ec98b6c759a4ebd5c4b8740a1b1f29f9243c8cb7cec97"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project baml_cffi: baml_cffi has instability 0.88 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d61612826421579ef73f2b19ae6cafa418bbf13d7bbe84244ecd526a0c02fd1c"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project baml_compiler2_metrics: baml_compiler2_metrics has instability 0.86 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c0e889730c0f9879579512c3e77b10b7f88b74dc3b3231dac645308f999c3792"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project baml_compiler2_rust: baml_compiler2_rust has instability 0.89 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6f1954a9e6b47e08ba9b847c65bdddb859cb962d815f3cbcd22581a15fda8526"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project baml_linker: baml_linker has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"11be4d2be97271bf87b65b9f4b6a88ed445402a49031a79f4e67bab32fc73aeb"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project baml_lsp_server: baml_lsp_server has instability 0.95 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"910700f3151758efab49bb0b0ef40cf532487df8bf81921351d3bfa0abd1f034"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project bex_engine: bex_engine has instability 0.81 with 5 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f5b209a0f873de82924a845f8b0429a0ddbb0e546f215fa3248582fe64da33c7"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project bex_vm: bex_vm has instability 0.91 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e421ee4dc4ed133fb389e2d0733d3d5a34faff559e38ef7deb2d723540380fa3"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project btel_bcs: btel_bcs has instability 0.88 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cf51b74c8e1646bdf6bca73974692c18352effcc27b43d40f7e12e099746834f"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project btel_reader: btel_reader has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0b01beb24bad0d1a1ca509825da33b1431bbf4067e162feec778d3fcfd901344"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project language-server: language-server has instability 0.89 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f0b5b3c05c590601beb2bc758465775f2cc714721c80fa441ea2e1d7955658b4"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project playground-server: playground-server has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"333da46b6b23481537981d8e56a1ec28ab88aa6dc9111148cf6c62687ee06983"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project sys_auth: sys_auth has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b237af7392bb4d35f713e811342e3d81b664ab82f2c2c8e99219c8f981d73b9a"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @b/pkg-grammar: @b/pkg-grammar: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5163e20de19e1e91ca03430c11dd822443da87abe6dda44a833eabd19fd7d01c"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @b/pkg-lsp: @b/pkg-lsp: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"df261a2d8bb4cf514c088f894be7a7e519b0938d6f780401a3d7a7a55e3121c7"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @b/pkg-proto: @b/pkg-proto: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1cd75c2363af08864ac646a8d19ab644a462d28b251ff78f3eaf3b53557c1348"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @baml/codemirror-lang-baml: @baml/codemirror-lang-baml: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"538d7e43bc6cadf4cc6b6e46f44fc6678f9b7a6865d1ec4231e26e87fd2b85d2"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: baml-ids: baml-ids: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1cf5d39a15b5def8121deba6a255eefd4a65658fb423e64aa2fe32bdf357dacf"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: baml-sys: baml-sys: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"061ac3e49cc69a2a1ce2b9864291e0a406fe3c0ee7a07162e542d28d2eae8ded"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: baml-viz-events: baml-viz-events: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3dd3077480e6110fd56326cf74af582e6cbeffd99eceb7350d97f8363dfab02d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: baml_base: baml_base: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 31 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8db218f63454805852067d01632c57e1a1dd78d4d8f9438386b2cabc7229aee6"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: baml_path: baml_path: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d04e7092b3ebf3513f3b5b7998a3b5d4340b1f4691615c10ee88ab9565d829eb"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: bex_str: bex_str: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2dfd0c158343cb02b5445d24bbfd1948dfbbe0cc136abf59ae374b0f1b60871e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: bstd: bstd: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c9a0e584fa43e96d213ce85b1a30401dc04c045a00010a8a2de18fcb706f77e3"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: forked_aws_sigv4: forked_aws_sigv4: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c0dd2850ca5276db9841f1fd951d8a27e9089128c3889480f318eb1ee9be420"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: forked_aws_smithy_eventstream: forked_aws_smithy_eventstream: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fe074dac8d5296e787a1589d406027e27fb3a5e8a1f3a5116b1f974fe8753cfe"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: sys_glob: sys_glob: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6ef53d82594efceb28331b30b0cf583751917956d57bbcbbe1bb482d257b91fc"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: sys_regex: sys_regex: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"26d380742bbdb58f5a7fdaa3adf8115485542e95c51a83d78de0d37531eb3541"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: btel_settings: btel_settings: abstractness 0.00, instability 0.05, distance 0.95 \u2014 zone of pain \u2014 concrete and depended on by 20 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"827db6007b2876a766219c19bedb853016850a97c08b5d01c0991304c56dc84c"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: btel_types: btel_types: abstractness 0.00, instability 0.05, distance 0.95 \u2014 zone of pain \u2014 concrete and depended on by 18 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"50ed57441ade15ea4a7960c99b9f6101d2b1e18bbb09b48a97a6d6c4e626691d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @baml/ui: @baml/ui: abstractness 0.06, instability 0.00, distance 0.94 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8ad58cb7b976c9cf16bacfbe7d01081fd32175f76f94b00d9f5d67ea840b9cf4"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: baml_artifact: baml_artifact: abstractness 0.00, instability 0.08, distance 0.92 \u2014 zone of pain \u2014 concrete and depended on by 12 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"778a81ae3c49cbe4af9436cabe6df4633c81acaa6b543c9bede7279370fe3814"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: internal-baml-diagnostics: internal-baml-diagnostics: abstractness 0.11, instability 0.00, distance 0.89 \u2014 zone of pain \u2014 concrete and depended on by 11 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3578e3f39a02ede6a94ced44491a007bb9ac9454021a54cebf8c0962eb65d63b"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: bex_resource_types: bex_resource_types: abstractness 0.13, instability 0.00, distance 0.88 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"40779f7cb6e8e46e18ea07877ffeaefc0216403ea769821736c133e7a4fe525f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: baml_builtins2: baml_builtins2: abstractness 0.00, instability 0.15, distance 0.85 \u2014 zone of pain \u2014 concrete and depended on by 11 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6fed3b0dc7d48aebb18a553942c7f7af5bf49a07cd5869041bf07fca411359a1"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: baml_type_runtime: baml_type_runtime: abstractness 0.00, instability 0.20, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fbc1b9ec820a7e9e1dc6a2f14f50c83f210a00395dd0d42aa02eb70293f8b835"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: baml_syntax: baml_syntax: abstractness 0.08, instability 0.13, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 7 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3ce51e86906c47c5cee9c20914c09418b0447fdebb880f51c403c3d3f0f7db0a"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: baml_type: baml_type: abstractness 0.15, instability 0.06, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 34 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2c0af3a250b3fe0b61af65bd44d548a73a4cfaa43d48a1593bd88e39bd5b30f9"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: baml-log: baml-log: abstractness 0.21, instability 0.00, distance 0.79 \u2014 zone of pain \u2014 concrete and depended on by 10 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1ad1a169f24e223976ad55cf7fcda6f6559acc5033dab55d9f59093bf68f6ee6"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: baml_sdkgen_types: baml_sdkgen_types: abstractness 0.03, instability 0.19, distance 0.78 \u2014 zone of pain \u2014 concrete and depended on by 13 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e6e7b66244fe44abe5cb7d6e3218b8ec72c1dae289f1068c60e181638b71fb8e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: bcs_api: bcs_api: abstractness 0.00, instability 0.25, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"056b909bce70a112d715e366a2a5070a82202b25f4b27156d454f262afb203cd"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: forked_google_cloud_auth: forked_google_cloud_auth: abstractness 0.25, instability 0.00, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"aec07b558d1aebd939c99d2b02860d9266fcfb5c5070283799673d7f2ac49495"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: baml_parser: baml_parser: abstractness 0.07, instability 0.18, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 9 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"75e3505104337c95b886325c027b0b8ce6d2309ed2101921a8ad379457e190e0"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Id (LCOM4 99): Id\u0027s methods fall into 99 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 99 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_syntax/src/tree.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d4e1577cc2736b384891821a05f9c61a9bdb338e5b5031b94ec766f86a66c4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NativeSysOps (LCOM4 61): NativeSysOps\u0027s methods fall into 61 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 61 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/sys_native/src/lib.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc5d2b690d4cab2b3a950c8d0deb00aba772bb91dbe3450a4d9c17bef0cc4a8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FunctionSpec (LCOM4 20): FunctionSpec\u0027s methods fall into 20 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 20 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/rust/bridge_rust/src/spec.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"190ea1ee88c54be7658b3571a6c9fc00b3f6ed99028c5e6a77cc538ff4ace5b7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ClassPropertyBuilder (LCOM4 10): ClassPropertyBuilder\u0027s methods fall into 10 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 10 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/type_builder/mod.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04b6f67094eeb8ed182e1f2f7d0c2cd3c613c580c90ab962f474068b9f0b713"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: EnumValueBuilder (LCOM4 10): EnumValueBuilder\u0027s methods fall into 10 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 10 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/type_builder/mod.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"16de969166d0e77c49aacd5df782f6b6798e2a26692e9de3d46250603b0e6f1f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Stream (LCOM4 8): Stream\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/rust/bridge_rust/src/spec.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d306d5aa4c696365aa2d84b1290496ad71b9e17aaa39fbb0c1e16be6cd3e1d3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Prompt (LCOM4 8): Prompt\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/rust/bridge_rust/src/spec.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa3588314df23b088a81dd92f3a779e0486f27c866e467431b4093235384d1d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BexVm (LCOM4 7): BexVm\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":1557}}}],"partialFingerprints":{"codehealthFindingId/v1":"074d4e1072464811ab29e021923e625ad3c9faaf5626feded3f9535a28f0779e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ProjectDatabase (LCOM4 6): ProjectDatabase\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_db/src/db.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6209094cff300b4bc005bb10db1dd1ebdac1532252e545353327e53b7551460"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Ty (LCOM4 6): Ty\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_type/src/interned.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9a18d48949f17fa33b5fcefbcdf07b462adaf4006b655d336030c59c2424d7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Reporter (LCOM4 5): Reporter\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/reporter.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c34d0fc47354c0853cb41171634a94c4ea6bbc69c669806a219dd92daa8d598"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WasmHttp (LCOM4 4): WasmHttp\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_wasm/src/wasm_http.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"db388c2a2502a611705100d347ed8d842784175aa4f95f25eaabbb395aad5f19"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BamlImage (LCOM4 4): BamlImage\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/bridge_python/src/media.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5905741533a83574ed51895cb12d99506705f6bc4235e5ab359d54b809f43d2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BamlAudio (LCOM4 4): BamlAudio\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/bridge_python/src/media.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b39c14ce6a2f515a2704a3977eba3f6ff4fad2ae71fdc5317d309bbd756cc2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BamlVideo (LCOM4 4): BamlVideo\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/bridge_python/src/media.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8082a5b0eb86e0d5d9823f48963eddfa1bc41e0d0e5be9b0abe6ce91074feff"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BamlPdf (LCOM4 4): BamlPdf\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/bridge_python/src/media.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a99932ced376a718be3345db5c112f9fab197ebcc962635d26a28f86816fd28"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: IntermediateRepr (LCOM4 4): IntermediateRepr\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/ir/repr.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5e94836e53a1ca3e33b2732a87372e1b21a89d102491fc04f9ba059dbefd69"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: EnumBuilder (LCOM4 4): EnumBuilder\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/type_builder/mod.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"a836d9d469ae0d86048b93a313e085c0d2f60a3bc281308c3c166b0390be24ae"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FunctionResultStream (LCOM4 4): FunctionResultStream\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/types/stream.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"14851593b68ad3e683895936ce25ec4e8575eb2c983336ff0511deeabd65cc14"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: should extract and attempt to run test case: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/__tests__/runtime-integration.test.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d59a7e2eaf1440b4d3acf6d2159c44cc9c4dcf4e87da6f1a802a36544a919a6"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: should switch to ConditionalWorkflow when clicking CheckCondition, then select header: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/__tests__/selection-integration.test.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec44808b6180e13d5b51d70abb706497b3d6117adde33f1cc8f5b4aa78d6b5d6"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: updates atoms when toggling between workflow header and root nodes: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/__tests__/selection-integration.test.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c5248ef5844936cea1c7bcea985731447d72fd479be67441923c18dede4efa"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: hides tabs for non-LLM workflow nodes: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/__tests__/unified-selection-sync.test.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09e002eae9c7f482d67e33575e7bb8835626f8ab37172f0994a8030ac9e9fe9"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: skip_case: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/sdk-parity-lint/test-fixtures/typescript/fixture/customizable/sample.test.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd25d6a805b508da9535a7c73e915b403cbd7761f0dff1e5a13e839f20704d5e"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: host_callables_release_fires_on_drop_of_callable: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdk_tests/crates/typescript/function_calls/customizable/host_callables.test.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"273e96248936b23bf458387e81399d6a7bcbf25f1b7f50f8d7367c68a78178aa"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: marks contexts entered by dynamic rules as dynamic: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar/tests/kde-syntax.test.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"46364b154031548b6b93e3f47a7e6e808de078c450d1facc94e1c35b1fe9be5e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: renders loading state or ExecutionPanel: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-vscode-webview/src/App.browser.test.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f232218166a9931a5ef37476ff0ce5a3f82ef21043f52ba39ed5ea760ad444cf"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: renders loading state or ExecutionPanel: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-vscode-webview/src/App.test.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f241b82184f71a3c5506d7fb413450ad1fe265dcd0b6d30a501682f9514e52a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should derive selectedFunctionObjectAtom from function name: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/__tests__/selection-integration.test.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"8266ee9eeed82fa21402a5a45119f46b8b9642e0c1aafc2996badb5ca7771aec"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: (unnamed test): This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/codemirror-lang-baml/test/test.cjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a5315aad71433c2b29c0332ac8536ff22370c9cffb7b280c6567d1258b4679"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: (unnamed test): This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/codemirror-lang-baml/test/test.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"61039caa0f3f36ecaf8a8957ca99c310e4f00d14b3d43ee7d2e54691569f242c"}},{"ruleId":"D10","level":"error","message":{"text":"Assertions commented out: should handle multiple async calls with nested gathers: The test body contains commented-out assertion calls and no live one \u2014 it runs, verifies nothing, and still passes. Restore the assertions or delete the test; a green test that checks nothing is worse than an absent one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/typescript/tests/collector.test.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"c119ea366b4af1fd3f561597b38c8eb38863dd4cc07584e431694100d51cb7fc"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: supports tracing sync: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/typescript/tests/tracing.test.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbbea657fb4362585741f9eccdc0329cd4a98be02469a07d0b76007fb324e7e9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: should support system_instructions in Gemini: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/typescript/tests/providers/gemini.test.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"355cbb034b1cd75d03337d977bcabfce6c58ce8298156c0c7e28a6a735799d44"}},{"ruleId":"D10","level":"warning","message":{"text":"Test project verifies nothing: typescript/packages/codemirror-lang-baml: No conventional assertion call was detected in 2 of 2 tests in \u0060typescript/packages/codemirror-lang-baml\u0060 \u2014 the project as a whole, not one method. Two things look like this: verification that happens indirectly (an approval/verifier harness or BDD step methods), or a suite that genuinely checks nothing. If it is the latter, this project passes unconditionally and cannot fail."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/codemirror-lang-baml/test/test.cjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f502331331889ed70b0147fc107710632f5b86115adf42045c0e084a2531882"}},{"ruleId":"D13","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":"ac3421f86e90cba09b962b6adce04ab82097d9b2b2ca57bb8c325326592ef27d"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_vm/src/vm.rs: baml_language/crates/bex_vm/src/vm.rs changed 90 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 344 in BexVm::run_compact at line 9408. 13 of those changes were fix/bug commits, and the other 77 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_vm/src/vm.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":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":9408}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7bc45ae915de2651c029d5171726154f54566ed1d35b7c9a354f90c0319c61"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_hir_ty/src/infer.rs: baml_language/crates/baml_compiler2_hir_ty/src/infer.rs changed 78 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 203 in InferenceContext::finish at line 12717. 22 of those changes were fix/bug commits, and the other 56 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_hir_ty/src/infer.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":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":12717}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ab0b453615baa9d0a1a82a8ad5e93fe0a22d71cf27c736007695bca05ba2cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_hir_ty/src/diagnostics.rs: baml_language/crates/baml_compiler2_hir_ty/src/diagnostics.rs changed 46 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 212 in TirTypeError::render at line 1269. 12 of those changes were fix/bug commits, and the other 34 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_hir_ty/src/diagnostics.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":"baml_language/crates/baml_compiler2_hir_ty/src/diagnostics.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78152af1d7e329f138ca60ee419e353c481322372efefac913283ac57e2a4f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_engine/src/lib.rs: baml_language/crates/bex_engine/src/lib.rs changed 72 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in BexEngine::run_thread_event_loop_inner at line 6074. 10 of those changes were fix/bug commits, and the other 62 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_engine/src/lib.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":"baml_language/crates/bex_engine/src/lib.rs"},"region":{"startLine":6074}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d46f59a0a0ab8e7dd1d1a5576faff234e9850154c53534b7876f20b795553a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_mir/src/lower.rs: baml_language/crates/baml_compiler2_mir/src/lower.rs changed 65 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in LoweringContext::lower_call_with_callee at line 8326. 13 of those changes were fix/bug commits, and the other 52 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_mir/src/lower.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":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":8326}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78cc60bcc0f2de43e783f288c4dcfa4eea95166a5a95f6a2551bb8d270da877"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_vm_types/src/bytecode.rs: baml_language/crates/bex_vm_types/src/bytecode.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 146 in Bytecode::instruction_to_opcode at line 3099. 4 of those changes were fix/bug commits, and the other 21 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_vm_types/src/bytecode.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":"baml_language/crates/bex_vm_types/src/bytecode.rs"},"region":{"startLine":3099}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d7fa88ef0878c7c219e8fd4932b453738c2f8929c27cc16cff2a04e0b253de"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: typescript2/pkg-playground/src/ExecutionPanel.tsx: typescript2/pkg-playground/src/ExecutionPanel.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 461 in ExecutionPanel.ExecutionPanel at line 493. 1 of those changes was a fix/bug commit, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- typescript2/pkg-playground/src/ExecutionPanel.tsx\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":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"619c2e0d7305a9170e601212e7f26ffd9d4e80d3b2b801d5384f13d4c3f8ba55"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_db/src/check.rs: baml_language/crates/baml_db/src/check.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in baml_db::check::check_file at line 434. 8 of those changes were fix/bug commits, and the other 36 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_db/src/check.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":"baml_language/crates/baml_db/src/check.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cf79aa3a8a8948e6818731ece7ca9cd16fce157a4e03e0457bd94e6db5ea56"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_vm/src/debug.rs: baml_language/crates/bex_vm/src/debug.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 118 in bex_vm::debug::display_instruction_textual at line 773. 4 of those changes were fix/bug commits, and the other 15 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_vm/src/debug.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":"baml_language/crates/bex_vm/src/debug.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5c2b7f9051595fa1aa0967f8321067bcaa25edae0fb5802ba002d48ff1e155"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_mir/src/optimize.rs: baml_language/crates/baml_compiler2_mir/src/optimize.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in baml_compiler2_mir::optimize::verify_definite_assignment at line 1943. 1 of those changes was a fix/bug commit, and the other 19 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_mir/src/optimize.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":"baml_language/crates/baml_compiler2_mir/src/optimize.rs"},"region":{"startLine":1943}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbdc28b632a944f43826dab11143d84e4cf85c8abd29721839e7646bb6d57eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_project/src/runtime_compile.rs: baml_language/crates/bex_project/src/runtime_compile.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in bex_project::runtime_compile::lower_session_submission at line 1166. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_project/src/runtime_compile.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":"baml_language/crates/bex_project/src/runtime_compile.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6def0f10d548d309ec5ad868d1df89708e1fe7c418064cdf2b53cf7274b1311"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_emit/src/emit.rs: baml_language/crates/baml_compiler2_emit/src/emit.rs changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in StackifyCodegen::emit_terminator at line 2393. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_emit/src/emit.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":"baml_language/crates/baml_compiler2_emit/src/emit.rs"},"region":{"startLine":2393}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a771b73fab5ae19a0c562e70d54ec8bd8a5e00b2c933e1efea20c379a983013"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_ast/src/ast.rs: baml_language/crates/baml_compiler2_ast/src/ast.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in TypeExprKind::fmt at line 265. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_ast/src/ast.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":"baml_language/crates/baml_compiler2_ast/src/ast.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"5523eb85e3849f3891f9fbdd3077ac40d1b4880332cca91168efcc3425846127"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_hir_ty/src/lower.rs: baml_language/crates/baml_compiler2_hir_ty/src/lower.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in LowerCtx::lower_path at line 798. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_hir_ty/src/lower.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":"baml_language/crates/baml_compiler2_hir_ty/src/lower.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b2dbf0c3a0eaf3afabba5e07462a77459643dac5f8dccc4ea56fc62d22ae4c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_heap/src/gc.rs: baml_language/crates/bex_heap/src/gc.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in BexHeap::fixup_object_references at line 843. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_heap/src/gc.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":"baml_language/crates/bex_heap/src/gc.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"83425ac63de7e0a25fdeebc8b9d6b33361ccca23aae48d1fe123dfed9e45e840"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_engine/src/conversion.rs: baml_language/crates/bex_engine/src/conversion.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in BexEngine::convert_heap_ptr_to_external_with_type at line 428. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_engine/src/conversion.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":"baml_language/crates/bex_engine/src/conversion.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ded7f8200660c2b3f43638e1508e883f66674c204d44b802443187264c77d8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_emit/src/stack_carry.rs: baml_language/crates/baml_compiler2_emit/src/stack_carry.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in baml_compiler2_emit::stack_carry::simulate_terminator_stack at line 575. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_emit/src/stack_carry.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":"baml_language/crates/baml_compiler2_emit/src/stack_carry.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"76165d326b878f08dd1c98a0fc23219f655225e419369ea6c8c5cff86d673899"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_hir_ty/src/package_interface.rs: baml_language/crates/baml_compiler2_hir_ty/src/package_interface.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in baml_compiler2_hir_ty::package_interface::validate_row_identities at line 1021. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_hir_ty/src/package_interface.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":"baml_language/crates/baml_compiler2_hir_ty/src/package_interface.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1cfad00b7ac1d9d923e782e8204323fc4882bb9957da5f7d50157e2ed03e7d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_vm/src/telemetry.rs: baml_language/crates/bex_vm/src/telemetry.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in TelemetryState::complete_invocation_at at line 1039. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_vm/src/telemetry.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":"baml_language/crates/bex_vm/src/telemetry.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"68371cc9eb5c00c81b3f990108f8b386b74b1a2e0a674a34fed9eb462cee2879"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs: baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in baml_compiler2_hir_ty::interfaces::impl_rules::validate_impl_signatures at line 983. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.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":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces/impl_rules.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"294df10cfac67bb2c1b3db141a863ec024ae1662f1276c707075174b8ba2c6a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_mir/src/pretty.rs: baml_language/crates/baml_compiler2_mir/src/pretty.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in baml_compiler2_mir::pretty::write_rvalue at line 557. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_mir/src/pretty.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":"baml_language/crates/baml_compiler2_mir/src/pretty.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fdbcae216c231276a36efb0ea661824206c291130a6dce07e4148fb7b585d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/go/sdkgen_go/src/lib.rs: baml_language/sdks/go/sdkgen_go/src/lib.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in sdkgen_go::render_functions at line 1960. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/go/sdkgen_go/src/lib.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":"baml_language/sdks/go/sdkgen_go/src/lib.rs"},"region":{"startLine":1960}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af4ac778ca30a534128d6192fb933e2a9fec8649b0d583bfd7afbdd482fcb03"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/sys_ops/src/output_format.rs: baml_language/crates/sys_ops/src/output_format.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in OutputFormatContent::render_impl at line 360. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/sys_ops/src/output_format.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":"baml_language/crates/sys_ops/src/output_format.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fe01443615f64620d517da94425390c876dfe23911cadecf541c2a9da30eb1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_vm_types/src/types.rs: baml_language/crates/bex_vm_types/src/types.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in Program::validate at line 204. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_vm_types/src/types.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":"baml_language/crates/bex_vm_types/src/types.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a04722bb2409c9ce0b8c91e394273dd762f1e209bb0682d1d3d7df6768d84c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_hir/src/builder.rs: baml_language/crates/baml_compiler2_hir/src/builder.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in SemanticIndexBuilder::walk_expr_children at line 605. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_hir/src/builder.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":"baml_language/crates/baml_compiler2_hir/src/builder.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fdd0cae6bf4de5adba075bdb472362fd022e96d5068d9357cfcc878292c757"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_emit/src/analysis.rs: baml_language/crates/baml_compiler2_emit/src/analysis.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in baml_compiler2_emit::analysis::collect_uses_in_terminator at line 867. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_emit/src/analysis.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":"baml_language/crates/baml_compiler2_emit/src/analysis.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"26041ae67f8f8f1764ae5a0ee1faad7f68a61111fed2eab6e543b3aaa28665ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_vm/src/package_reflect/type_class.rs: baml_language/crates/bex_vm/src/package_reflect/type_class.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in RenderDefinitionEquivalence::types_equivalent at line 710. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_vm/src/package_reflect/type_class.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":"baml_language/crates/bex_vm/src/package_reflect/type_class.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d395a1e30ea910458138e7ed7a0f6af9097e3bf21957fe9b85710ccdc3bd87"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/rust/sdkgen_rust/src/translate_ty.rs: baml_language/sdks/rust/sdkgen_rust/src/translate_ty.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in sdkgen_rust::translate_ty::translate_inner at line 96. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/rust/sdkgen_rust/src/translate_ty.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":"baml_language/sdks/rust/sdkgen_rust/src/translate_ty.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a07bdf081d843c8a8205b574da170f5de40b4829232bde0feac016118d156a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_vm/src/package_baml/root.rs: baml_language/crates/bex_vm/src/package_baml/root.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in bex_vm::package_baml::root::render_to_sink at line 677. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_vm/src/package_baml/root.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":"baml_language/crates/bex_vm/src/package_baml/root.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1afd8fe02196c404389496e127b0785d88a035350037cf999bec726fa1e79a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs: baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in sdkgen_csharp::semantic::generate_program_inner at line 434. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/csharp/sdkgen_csharp/src/semantic.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":"baml_language/sdks/csharp/sdkgen_csharp/src/semantic.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"baac1bd05314d78a0e49d31efd2d2ba967eb52e600516b4624ff917a52d28e42"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_query_btel/src/ingest.rs: baml_language/crates/baml_query_btel/src/ingest.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in baml_query_btel::ingest::reconcile at line 392. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_query_btel/src/ingest.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":"baml_language/crates/baml_query_btel/src/ingest.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec32d7601f8271cc6e021e98f58ba419d8bf147403268a292f8cbe1819c6eb78"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_vm/src/package_baml/ops.rs: baml_language/crates/bex_vm/src/package_baml/ops.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in EqualsDriver::compare_objects at line 459. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_vm/src/package_baml/ops.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":"baml_language/crates/bex_vm/src/package_baml/ops.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"325d7d1dea34d93c6ab47cfea29ef8f0209c227f8d5f7bb8bc7af474ff4980f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_lsp_server/src/playground_server.rs: baml_language/crates/baml_lsp_server/src/playground_server.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in baml_lsp_server::playground_server::handle_ws_in_message at line 1728. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_lsp_server/src/playground_server.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":"baml_language/crates/baml_lsp_server/src/playground_server.rs"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"54cf042bea3ae39bff8444b51f46efe0cbaf466c24a8f9073601f53d8853f7e4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs: baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in sdkgen_cpp::translate_ty at line 1662. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/cpp/sdkgen_cpp/src/lib.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":"baml_language/sdks/cpp/sdkgen_cpp/src/lib.rs"},"region":{"startLine":1662}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27301c465c7e7c84bd5abc16aaa45cba9a27d2a0504006ad87702de52842bdd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs: baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in sdkgen_python_pydantic2::leaf::render_leaf_body_pyi at line 2653. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/leaf.rs"},"region":{"startLine":2653}}}],"partialFingerprints":{"codehealthFindingId/v1":"145ed7d7738197274cc3d0919756d4b34d7570770e20e7c4f2db0623d010328c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/btel_recorder/src/lib.rs: baml_language/crates/btel_recorder/src/lib.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in ConversionBuffer::span at line 211. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/btel_recorder/src/lib.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":"baml_language/crates/btel_recorder/src/lib.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"a787c98bf02ba2c286192c1a309e32bf0bd836a8cd0d608dfe827b21d5f8ae5f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_ide/src/symbol_pool.rs: baml_language/crates/baml_ide/src/symbol_pool.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in baml_ide::symbol_pool::build_symbol_pool at line 97. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_ide/src/symbol_pool.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":"baml_language/crates/baml_ide/src/symbol_pool.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4399ac57e9196626f046be02a7a43d02d42c5ab2037815fcf26606d03f11e58"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_emit/src/lib.rs: baml_language/crates/baml_compiler2_emit/src/lib.rs changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in baml_compiler2_emit::compute_function_metadata at line 285. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_emit/src/lib.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":"baml_language/crates/baml_compiler2_emit/src/lib.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed4873c258683f534f88d58c9d15fe117dee623be800d21b29747285affaf42"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/rust/sdkgen_rust/src/analyze.rs: baml_language/sdks/rust/sdkgen_rust/src/analyze.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in sdkgen_rust::analyze::analyze at line 176. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/rust/sdkgen_rust/src/analyze.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":"baml_language/sdks/rust/sdkgen_rust/src/analyze.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"809e370b4aec74d8559491fba4b3e8ab0eabc68c3de0ffaaa195ecacac5cdd12"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_cli/src/generate.rs: baml_language/crates/baml_cli/src/generate.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in GenerateArgs::run_generate at line 264. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_cli/src/generate.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":"baml_language/crates/baml_cli/src/generate.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"8687f8acc0e57e1b28775531c4e627a949e16bec7488518658c3aba610bf73d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_ast/src/lowering_diagnostic.rs: baml_language/crates/baml_compiler2_ast/src/lowering_diagnostic.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in LoweringDiagnostic::to_diagnostic at line 226. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_ast/src/lowering_diagnostic.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":"baml_language/crates/baml_compiler2_ast/src/lowering_diagnostic.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1351376d8119b1f36bc8caffadba4ba6710f6371f853bb71b6709044df077a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_emit/src/pull_semantics.rs: baml_language/crates/baml_compiler2_emit/src/pull_semantics.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in baml_compiler2_emit::pull_semantics::walk_rvalue_pull at line 396. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_emit/src/pull_semantics.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":"baml_language/crates/baml_compiler2_emit/src/pull_semantics.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7653e40d96f539aa7e12b53b5f0dcd096a3906ff3f04be2712a35062fb806a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_hir_ty/src/impls.rs: baml_language/crates/baml_compiler2_hir_ty/src/impls.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in baml_compiler2_hir_ty::impls::match_pattern at line 2130. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_hir_ty/src/impls.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":"baml_language/crates/baml_compiler2_hir_ty/src/impls.rs"},"region":{"startLine":2130}}}],"partialFingerprints":{"codehealthFindingId/v1":"627ea69336e43104bcf1a2b2cac65f7c08d332dd2e4fc7506c2ddc956a8ceba4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs: baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in InferenceContext::lower_array_pattern at line 1523. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.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":"baml_language/crates/baml_compiler2_hir_ty/src/infer/pat.rs"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba80b4987834bf76acc259ebaa4ed441441cc0cae9de3d78c2751d5251281e27"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_query_btel/src/functions.rs: baml_language/crates/baml_query_btel/src/functions.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in baml_query_btel::functions::register at line 965. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_query_btel/src/functions.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":"baml_language/crates/baml_query_btel/src/functions.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"9611f725e8aec5f225b871093daeace9e70f8b5aae67853f4e971fb90430b980"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts: typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 103 in baml-lsp-worker.onmessage at line 567. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts\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":"typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8c6907cb97713b9c0a80b1a6865459253f26db31dec7e3a7197117c5ead87a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_query_btel/src/ingest/bulk.rs: baml_language/crates/baml_query_btel/src/ingest/bulk.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in Bulk::apply at line 546. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_query_btel/src/ingest/bulk.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":"baml_language/crates/baml_query_btel/src/ingest/bulk.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbd61a37ffb040c8c2f3821e9bbe7ee46aa972dbf2272925b1e70550884678c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/rust/sdkgen_rust/src/lib.rs: baml_language/sdks/rust/sdkgen_rust/src/lib.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in sdkgen_rust::to_source_code_with_optional_metadata at line 195. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/rust/sdkgen_rust/src/lib.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":"baml_language/sdks/rust/sdkgen_rust/src/lib.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2a1ab87b5ba597273ad3a17cb1f42980f2fcc172b9ad33161461199ca3d024"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_vm/src/telemetry/snapshot.rs: baml_language/crates/bex_vm/src/telemetry/snapshot.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Scratch::capture at line 139. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_vm/src/telemetry/snapshot.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":"baml_language/crates/bex_vm/src/telemetry/snapshot.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4010d656335a5ed9fd63edae75ad6681f7e2ec43b7c8d9c52a7f376b4f3b17"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_builtins2_codegen/src/extract.rs: baml_language/crates/baml_builtins2_codegen/src/extract.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in baml_builtins2_codegen::extract::type_expr_to_baml_type at line 987. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_builtins2_codegen/src/extract.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":"baml_language/crates/baml_builtins2_codegen/src/extract.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9b47f75e6e93a33bf677a5bba59e876ab09229ee4053d39bed32640ec24fb7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_ide/src/resolve.rs: baml_language/crates/baml_ide/src/resolve.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in baml_ide::resolve::member_position_at at line 257. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_ide/src/resolve.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":"baml_language/crates/baml_ide/src/resolve.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"32aa1bcf15ae20014da8e8d14de2ca3eaab840b72a7a12b1bd68abed4f08763b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/java/sdkgen_java/src/lib.rs: baml_language/sdks/java/sdkgen_java/src/lib.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in sdkgen_java::to_source_code_internal at line 110. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/java/sdkgen_java/src/lib.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":"baml_language/sdks/java/sdkgen_java/src/lib.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07f0b00b8d070fcf34608e7216bd1572086f066ceef51fa8f8b9e470b2b5411"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_type/src/normalize.rs: baml_language/crates/baml_type/src/normalize.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in NormalTy::from_interned at line 3057. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_type/src/normalize.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":"baml_language/crates/baml_type/src/normalize.rs"},"region":{"startLine":3057}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e0b0326bcf280b3f5e55f0f6532db6ebf6768dbc6e8807daef7e6d544df20c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/sys_native/src/io_impls.rs: baml_language/crates/sys_native/src/io_impls.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in NativeSysOps::_send_sse at line 3428. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/sys_native/src/io_impls.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":"baml_language/crates/sys_native/src/io_impls.rs"},"region":{"startLine":3428}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c82913b4a0428edb5e08afc1beed3740cb66e66ac6150c0054a75b4d0e2f577"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_hir_ty/src/method_resolution.rs: baml_language/crates/baml_compiler2_hir_ty/src/method_resolution.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in baml_compiler2_hir_ty::method_resolution::lookup_impl_member at line 500. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_hir_ty/src/method_resolution.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":"baml_language/crates/baml_compiler2_hir_ty/src/method_resolution.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"60214349f255ac032d9efb99f5aa3e790d185cdde8d6e615e046aa0b3acca536"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_engine/src/trace_heap.rs: baml_language/crates/bex_engine/src/trace_heap.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in TraceSnapshotBuilder::copy_object at line 324. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_engine/src/trace_heap.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":"baml_language/crates/bex_engine/src/trace_heap.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de0f794517ff4dc4ac34b55bb36a65208e5ad389194038ac01e687eb655d222"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_sap/src/sap_model/convert.rs: baml_language/crates/bex_sap/src/sap_model/convert.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in TypeCtx::convert_ty at line 725. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_sap/src/sap_model/convert.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":"baml_language/crates/bex_sap/src/sap_model/convert.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"0756d131ce15a84d338ab208962786f9ec58cc3e6be869360f9cd23dc35c1c5a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_cli/src/run_command.rs: baml_language/crates/baml_cli/src/run_command.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in RunArgs::run_expression at line 1055. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_cli/src/run_command.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":"baml_language/crates/baml_cli/src/run_command.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8aeaabb74aaf5a299dbfb6ad16a7819ad2569d32304a30ec1cda3d88b07b9d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/typescript/sdkgen_typescript_shared/src/translate_ty.rs: baml_language/sdks/typescript/sdkgen_typescript_shared/src/translate_ty.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in sdkgen_typescript_shared::translate_ty::translate_ty at line 52. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/typescript/sdkgen_typescript_shared/src/translate_ty.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":"baml_language/sdks/typescript/sdkgen_typescript_shared/src/translate_ty.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c073c5e8558aaee520f3ce7c9239967a3dd1c8fe349d8788aea2f441c93ba6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_builtins2_codegen/src/codegen.rs: baml_language/crates/baml_builtins2_codegen/src/codegen.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in baml_builtins2_codegen::codegen::receiver_input_type_with_vm_usage at line 2235. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_builtins2_codegen/src/codegen.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":"baml_language/crates/baml_builtins2_codegen/src/codegen.rs"},"region":{"startLine":2235}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e354dde0b3dd54e0fcbeeb854f0ba435922c9c4e1d00f4db5129fa3539298d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: typescript2/app-beps/src/app/bcs/[number]/page.tsx: typescript2/app-beps/src/app/bcs/[number]/page.tsx changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in page.BcsProposal at line 33. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- typescript2/app-beps/src/app/bcs/[number]/page.tsx\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":"typescript2/app-beps/src/app/bcs/[number]/page.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"91acc9cf8640ba2d2f984c86380242aab9e1ce1de61066fa570cdca2226b146c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_hir_ty/src/infer/obligations.rs: baml_language/crates/baml_compiler2_hir_ty/src/infer/obligations.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in InferenceContext::attempt at line 391. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_hir_ty/src/infer/obligations.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":"baml_language/crates/baml_compiler2_hir_ty/src/infer/obligations.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ddfbd84c4cc3763373435ac428c45494206c2dc33a41d2f1ae2628830601844"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs: baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in baml_compiler2_visualization::control_flow::from_ast::render_expr_compact_ast at line 1088. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.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":"baml_language/crates/baml_compiler2_visualization/src/control_flow/from_ast.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"34da54ff96fb7e5af9b72c08f7e004479033e80bd807275ba3fefe13dd89cd86"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bcs_api/src/diagnostics.rs: baml_language/crates/bcs_api/src/diagnostics.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in Diagnostic::fmt at line 297. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bcs_api/src/diagnostics.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":"baml_language/crates/bcs_api/src/diagnostics.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7151c0a3ab6dfc4bc5c918fc73c75698f239bd3b9c78ac0cfcffc4ebc5bb23d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/btel_bcs/src/delivery.rs: baml_language/crates/btel_bcs/src/delivery.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in btel_bcs::delivery::run_worker at line 1773. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/btel_bcs/src/delivery.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":"baml_language/crates/btel_bcs/src/delivery.rs"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b98a9b76aada2851c5e8229d77718eea9255cbf9f018b8e5bb74aa88979897"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_hir_ty/src/defaults.rs: baml_language/crates/baml_compiler2_hir_ty/src/defaults.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in baml_compiler2_hir_ty::defaults::collect_default_expr_forward_references at line 77. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_hir_ty/src/defaults.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":"baml_language/crates/baml_compiler2_hir_ty/src/defaults.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb34f38e0193e8c1f521619e4ba564b09345ce49991af3c15c287abf06644258"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/translate_ty.rs: baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/translate_ty.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in sdkgen_python_pydantic2::translate_ty::translate_ty_from at line 128. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/translate_ty.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":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/translate_ty.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"255d2bdf51a903a62f7d00ea56d50c630f746c536eb81adf1e1a56348d174b1c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs: baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in baml_compiler2_hir_ty::interfaces::match_ty_pattern_into at line 972. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_hir_ty/src/interfaces.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":"baml_language/crates/baml_compiler2_hir_ty/src/interfaces.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fcff79775022295ef9b9a448948f66a358c807e68ca0c704ba73b0e1a09c3b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: typescript2/app-website/playground/baml-worker.ts: typescript2/app-website/playground/baml-worker.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 97 in baml-worker.onmessage at line 394. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- typescript2/app-website/playground/baml-worker.ts\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":"typescript2/app-website/playground/baml-worker.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"882e6fb9f9cdad20ed8eb9fa433ab7df49a246a02a849eef278207a35ebe8d3d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/go/sdkgen_go/src/types.rs: baml_language/sdks/go/sdkgen_go/src/types.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in GoTypeProjection::project_inner at line 355. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/go/sdkgen_go/src/types.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":"baml_language/sdks/go/sdkgen_go/src/types.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf2f9050f65057ad3fc954980c4b9c58638acf6cb0e5abd4a736e903524897e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_heap/src/accessor.rs: baml_language/crates/bex_heap/src/accessor.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in bex_heap::accessor::convert_object at line 625. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_heap/src/accessor.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":"baml_language/crates/bex_heap/src/accessor.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70933034878e19e42408562c7cffbbbbb42d237257c9b06d2cca4488c8e016e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_ide/src/annotations.rs: baml_language/crates/baml_ide/src/annotations.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in baml_ide::annotations::process_body at line 239. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_ide/src/annotations.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":"baml_language/crates/baml_ide/src/annotations.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"3869a6042a5b07d14145bdd67ab8c5a3d1727ec3fef101dd9aef36e4ea03bc29"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/python/src/baml_bridge/proto.py: baml_language/sdks/python/src/baml_bridge/proto.py changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in proto._ty_to_python_type at line 473. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/python/src/baml_bridge/proto.py\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":"baml_language/sdks/python/src/baml_bridge/proto.py"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a43230887fcd76e7145255bda92069a7f5c2ddcc210e7c7f52597344129aa3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_hir_ty/src/exhaustiveness.rs: baml_language/crates/baml_compiler2_hir_ty/src/exhaustiveness.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in baml_compiler2_hir_ty::exhaustiveness::write_ty_identity at line 324. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_hir_ty/src/exhaustiveness.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":"baml_language/crates/baml_compiler2_hir_ty/src/exhaustiveness.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbdde03c4670470901a81cd635b1976c8b58dd4225ebc5492b26dc66a8a593ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_ide/src/info.rs: baml_language/crates/baml_ide/src/info.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in baml_ide::info::generic_type_parameter_info_at at line 1014. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_ide/src/info.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":"baml_language/crates/baml_ide/src/info.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8dfa6b17ecc4bdffacd44ef12a0de485d6d4d63a377436def320789c8722d3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/rust/sdkgen_rust/src/emit/class.rs: baml_language/sdks/rust/sdkgen_rust/src/emit/class.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in sdkgen_rust::emit::class::fields_struct at line 174. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/rust/sdkgen_rust/src/emit/class.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":"baml_language/sdks/rust/sdkgen_rust/src/emit/class.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b161586528f3d0914f166dd4cff1f25f7c4832447b0dad6a80c0ebf1ca30f5f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs: baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in bex_vm::package_reflect::runtime_class_builder::prepare_group at line 654. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.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":"baml_language/crates/bex_vm/src/package_reflect/runtime_class_builder.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8020559f9af5df783d24e0f7bb459e5b09a4eaa8bd23b9103cfe932c6560556"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: typescript2/app-website/components/home/tracker.tsx: typescript2/app-website/components/home/tracker.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in tracker.Tracker at line 2254. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- typescript2/app-website/components/home/tracker.tsx\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":"typescript2/app-website/components/home/tracker.tsx"},"region":{"startLine":2254}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6a47a4ce52bbfaf9c5dfd44451e88187370445bcee3285398f9ae72b8ca918"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bridge_ctypes/src/value_encode.rs: baml_language/crates/bridge_ctypes/src/value_encode.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in bridge_ctypes::value_encode::external_to_outbound at line 39. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bridge_ctypes/src/value_encode.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":"baml_language/crates/bridge_ctypes/src/value_encode.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"b158144f7998134da629714b231482bd903ba35c75429d149df57901d8fb1fb0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_hir_ty/src/facts.rs: baml_language/crates/baml_compiler2_hir_ty/src/facts.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Facts::project at line 246. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_hir_ty/src/facts.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":"baml_language/crates/baml_compiler2_hir_ty/src/facts.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"189284eeb2a3dd32ccbdf06923cfa582c002a74abd7e959c485fa6a459739d8e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_vm/src/package_baml/resolve.rs: baml_language/crates/bex_vm/src/package_baml/resolve.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in ImplResolver::hash_eligible at line 496. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_vm/src/package_baml/resolve.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":"baml_language/crates/bex_vm/src/package_baml/resolve.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bba918e1ed8f4c71f23092c54c2db58667f94b8981acd062cc27f8845fac1b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoWriter.java: baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoWriter.java changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in ProtoWriter.encodeInboundValue at line 302. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoWriter.java\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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoWriter.java"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25e3272467da563fa024cb3df0502cbe42ed5a4db7e5ebfb0b100f94933519c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdk_tests/crates/csharp/stdlib_resources/Program.cs: baml_language/sdk_tests/crates/csharp/stdlib_resources/Program.cs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in top-level statements at line 7. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdk_tests/crates/csharp/stdlib_resources/Program.cs\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":"baml_language/sdk_tests/crates/csharp/stdlib_resources/Program.cs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0ea7f0c0230581516aa84676ef264fff2a7c4b218dba4ea0c74b734827f8c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_ast/src/lower_type_expr.rs: baml_language/crates/baml_compiler2_ast/src/lower_type_expr.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in baml_compiler2_ast::lower_type_expr::lower_from_type_name_with_generic_args at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_ast/src/lower_type_expr.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":"baml_language/crates/baml_compiler2_ast/src/lower_type_expr.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba5520628299eb7837073772b7eb20aa63ae8c31715d7b2042968fedc20541d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/swift/rust/sdkgen_swift/src/emit.rs: baml_language/sdks/swift/rust/sdkgen_swift/src/emit.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in sdkgen_swift::emit::render_callable at line 395. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/swift/rust/sdkgen_swift/src/emit.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":"baml_language/sdks/swift/rust/sdkgen_swift/src/emit.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c5eebc0ca7d6d9465185dc3822fdff79b27d7fbe9cac71285bdb7b7cf9167e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/swift/rust/sdkgen_swift/src/lib.rs: baml_language/sdks/swift/rust/sdkgen_swift/src/lib.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in sdkgen_swift::to_source_code_with_optional_metadata at line 67. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/swift/rust/sdkgen_swift/src/lib.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":"baml_language/sdks/swift/rust/sdkgen_swift/src/lib.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"3534179aeb05b9415a3c602326fa6236c9541c3c8c0476813c600f2d6c3ec58c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_engine/src/host_instrumentation.rs: baml_language/crates/bex_engine/src/host_instrumentation.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in bex_engine::host_instrumentation::capture_callback_inputs at line 432. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_engine/src/host_instrumentation.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":"baml_language/crates/bex_engine/src/host_instrumentation.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"07635ab744da917d228ffdb6df2609e6013bb64d28c3ece3d7947575e2e5d4e8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_hir/src/type_ref.rs: baml_language/crates/baml_compiler2_hir/src/type_ref.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in TypeRefDisplay::fmt at line 168. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_hir/src/type_ref.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":"baml_language/crates/baml_compiler2_hir/src/type_ref.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38d725a9750fe6904fa36a9920a4d1adb75f2b73f554ea87905a1025f3a7d70"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/btel_reader/src/value.rs: baml_language/crates/btel_reader/src/value.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in Renderer::object at line 1222. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/btel_reader/src/value.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":"baml_language/crates/btel_reader/src/value.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8b618d3daab0998f375f63e1ef070d2da71861269d24f51c15af9fc5b97a61"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_hir/src/diagnostic.rs: baml_language/crates/baml_compiler2_hir/src/diagnostic.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in Hir2Diagnostic::to_diagnostic at line 304. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_hir/src/diagnostic.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":"baml_language/crates/baml_compiler2_hir/src/diagnostic.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"31072d5613060ff0d40294d38c4bdddd5792f1fc077859883974d43d96f40e80"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_ide/src/describe.rs: baml_language/crates/baml_ide/src/describe.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in baml_ide::describe::describe_locals at line 824. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_ide/src/describe.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":"baml_language/crates/baml_ide/src/describe.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aea130cacc4425ad84d4a5cf481bcc18133d7041fd9126d18655b0678c0d96e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_ide/src/param_schema.rs: baml_language/crates/baml_ide/src/param_schema.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in SchemaCx::field_schema at line 216. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_ide/src/param_schema.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":"baml_language/crates/baml_ide/src/param_schema.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d652f136dfecbd95d9ad6c3bd13af9e93e191552f833fe546028c4a15ce640cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_fmt/src/ast/expressions.rs: baml_language/crates/baml_fmt/src/ast/expressions.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Id::single_line_width at line 2559. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_fmt/src/ast/expressions.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":"baml_language/crates/baml_fmt/src/ast/expressions.rs"},"region":{"startLine":2559}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2eaee41cd8b638de47083b2f1d5ca88fe108befb81f921e5ca50ceff85307ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/rust/sdkgen_rust/src/emit/function.rs: baml_language/sdks/rust/sdkgen_rust/src/emit/function.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in sdkgen_rust::emit::function::emit_binding at line 100. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/rust/sdkgen_rust/src/emit/function.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":"baml_language/sdks/rust/sdkgen_rust/src/emit/function.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca6fa10078bdca3e8e81b009bf970b24586a443118b77171059c0b98ffcd7fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_vm/src/package_baml/csv.rs: baml_language/crates/bex_vm/src/package_baml/csv.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in bex_vm::package_baml::csv::convert_cell at line 1426. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_vm/src/package_baml/csv.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":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e2107fdbcf50ac5a95479a26455a4b383465f7a37616c41f0dbaab8e80591d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/btel_snapshot/src/logical_bytes.rs: baml_language/crates/btel_snapshot/src/logical_bytes.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in Blob::logical_bytes_approx_v1 at line 59. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/btel_snapshot/src/logical_bytes.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":"baml_language/crates/btel_snapshot/src/logical_bytes.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f3f9a2d7b4fd5bb4013979910520fe8a46522de30052ebff5002ccfbd8d67e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_lsp_server/src/lib.rs: baml_language/crates/baml_lsp_server/src/lib.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in baml_lsp_server::run_stdio_loop at line 793. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_lsp_server/src/lib.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":"baml_language/crates/baml_lsp_server/src/lib.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1b78a0195ccaa70429e7dc4909727131471c555a8fc7bd6bfea97275849070"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_cli/src/describe_command.rs: baml_language/crates/baml_cli/src/describe_command.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in baml_cli::describe_command::write_description at line 613. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_cli/src/describe_command.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":"baml_language/crates/baml_cli/src/describe_command.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"204da8ac6318cb3bb13a7b68afd8a9fed735da3ee30036cd92f74672e0ae6e87"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_type_runtime/src/lib.rs: baml_language/crates/baml_type_runtime/src/lib.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in baml_type_runtime::collect at line 352. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_type_runtime/src/lib.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":"baml_language/crates/baml_type_runtime/src/lib.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"4673270be7d2df65275bd0d76e6fdaf3e99ad29fe84f1c7f24c2597a6b06075b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/btel_file/src/reader.rs: baml_language/crates/btel_file/src/reader.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in btel_file::reader::validate_file at line 138. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/btel_file/src/reader.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":"baml_language/crates/btel_file/src/reader.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"313eac6bef9bc155228b347678b70d9a1ca3d1084ab7f0cdb8553150008f4f9a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_mir/src/memory.rs: baml_language/crates/baml_compiler2_mir/src/memory.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in baml_compiler2_mir::memory::walk_rvalue_places at line 133. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_mir/src/memory.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":"baml_language/crates/baml_compiler2_mir/src/memory.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52f647e5f0a626ff5562757f2b560bb3a0759399fd768a0191fc2d5c1f570ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs: baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in baml_compiler2_hir_ty::coherence::unify_into_at at line 248. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_hir_ty/src/coherence.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":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce166101118fca186be83b1cdb9c2f5a12f2d7711df128ca95934e8f622d0dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/btel_snapshot/src/host.rs: baml_language/crates/btel_snapshot/src/host.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in btel_snapshot::host::add at line 62. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/btel_snapshot/src/host.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":"baml_language/crates/btel_snapshot/src/host.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87d3056890abf14b65e8b1f835d5878154296dc92ed0ad9e34332af4c17221b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_ide/src/usages.rs: baml_language/crates/baml_ide/src/usages.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in baml_ide::usages::find_member_usages at line 362. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_ide/src/usages.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":"baml_language/crates/baml_ide/src/usages.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"57dc2fd3d37654889366d7d1a064ea8d20752f26abbc3de08c598234593d2169"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java: baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in ProtoReader.armMatchesValue at line 1556. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java\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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoReader.java"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec1b10c938822a8525c19768dc685d6bba9dde912e76ef1e7fa2a562c056ccf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bridge_ctypes/src/value_decode.rs: baml_language/crates/bridge_ctypes/src/value_decode.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in bridge_ctypes::value_decode::decode_inbound at line 342. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bridge_ctypes/src/value_decode.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":"baml_language/crates/bridge_ctypes/src/value_decode.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74113830c397eedaca8a0cfc57999a8011fe8e786e92594738a92e66023c983"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/swift/rust/sdkgen_swift/src/translate_ty.rs: baml_language/sdks/swift/rust/sdkgen_swift/src/translate_ty.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in sdkgen_swift::translate_ty::translate_ty at line 100. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/swift/rust/sdkgen_swift/src/translate_ty.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":"baml_language/sdks/swift/rust/sdkgen_swift/src/translate_ty.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"0427d6cf3928b31e5c4dd01e0236453fd2464413884f83b07bad8784fd1e5a25"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/go/sdkgen_go/src/names.rs: baml_language/sdks/go/sdkgen_go/src/names.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in sdkgen_go::names::hash_go_ty at line 1077. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/go/sdkgen_go/src/names.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":"baml_language/sdks/go/sdkgen_go/src/names.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ad0eba2eed9c67a5f5ef3244590946e131890cb92841dfc2d1c1ddbbdc7724"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_lsp/src/dispatch/mod.rs: baml_language/crates/baml_lsp/src/dispatch/mod.rs changed 3 times in last 90 days, max cyclomatic complexity 61 in GlobalState::dispatch_request at line 92. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_lsp/src/dispatch/mod.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":"baml_language/crates/baml_lsp/src/dispatch/mod.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a195f8ac427ae86aec83250622a7dce0a75311a6a50658b190461c864491bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_sap/src/deserializer/coercer/coerce_class.rs: baml_language/crates/bex_sap/src/deserializer/coercer/coerce_class.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in ClassTy::coerce at line 105. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_sap/src/deserializer/coercer/coerce_class.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":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_class.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f50ebe4347e03b26d5b4ff85be202c7a9c4c69d0aeb2caa07c27eef3bbb199"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_ide/src/cfg.rs: baml_language/crates/baml_ide/src/cfg.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in baml_ide::cfg::ast_test_control_flow_graph_impl at line 79. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_ide/src/cfg.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":"baml_language/crates/baml_ide/src/cfg.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13068db896f200b1b2fb2c8c325d249c9da2a076b44a42a33f20fc69d138ba9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_ast/src/traverse.rs: baml_language/crates/baml_compiler2_ast/src/traverse.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ExprBody::expr_children at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_ast/src/traverse.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":"baml_language/crates/baml_compiler2_ast/src/traverse.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c7f6089017586e80d08ad5a08a890143e517f8b327a97cce16993713ed5d6d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_type/src/unify.rs: baml_language/crates/baml_type/src/unify.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in baml_type::unify::unify_into_at at line 549. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_type/src/unify.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":"baml_language/crates/baml_type/src/unify.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfd6bf600b2853c12c16c1e75cbbd253de374f5953ef648fbd26e5deb259c9a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/rust/sdkgen_rust/src/unions.rs: baml_language/sdks/rust/sdkgen_rust/src/unions.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in sdkgen_rust::unions::collect at line 104. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/rust/sdkgen_rust/src/unions.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":"baml_language/sdks/rust/sdkgen_rust/src/unions.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"db583831a4ad4ea65a12bad9dcaf3abc6b4fadd24b4177f78ce947cc55dc303b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_vm_types/src/head_walk.rs: baml_language/crates/bex_vm_types/src/head_walk.rs changed 4 times in last 90 days, max cyclomatic complexity 39 in bex_vm_types::head_walk::visit_object_heads at line 186. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_vm_types/src/head_walk.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":"baml_language/crates/bex_vm_types/src/head_walk.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f770e8d7bbc6e2bbe079e9a33b3c493c9f3265445132918a0ec04e6490a00d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/btel_processor/src/runtime.rs: baml_language/crates/btel_processor/src/runtime.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in TelemetryRuntime::write_span_with_context at line 632. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/btel_processor/src/runtime.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":"baml_language/crates/btel_processor/src/runtime.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07306155cca711321e0fa86a2a61a4c9f649dfa873701ed84378e5ae4e079bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_vm/src/vm/error_evidence.rs: baml_language/crates/bex_vm/src/vm/error_evidence.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in BexVm::begin_error_evidence at line 347. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_vm/src/vm/error_evidence.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":"baml_language/crates/bex_vm/src/vm/error_evidence.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"46676062adee7b4d1e59b903e663834533b45f5074c9061cd7b175cbaee65741"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/btel_recorder/src/encoding.rs: baml_language/crates/btel_recorder/src/encoding.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in EncodedSpans::event at line 72. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/btel_recorder/src/encoding.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":"baml_language/crates/btel_recorder/src/encoding.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2ce6b2d512e3f31148231c21c5d2a5a12e7a67f6c3f5dcef44291acd650774"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/java/sdkgen_java/src/emit.rs: baml_language/sdks/java/sdkgen_java/src/emit.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in sdkgen_java::emit::render_callable_pair at line 831. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/java/sdkgen_java/src/emit.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":"baml_language/sdks/java/sdkgen_java/src/emit.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"1454edb221bdda482f3185a0aa12b18c6e9bde5835e7ef54effa62840bceca38"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_type/src/normalize/mu.rs: baml_language/crates/baml_type/src/normalize/mu.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Renderer::structural at line 1624. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_type/src/normalize/mu.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":"baml_language/crates/baml_type/src/normalize/mu.rs"},"region":{"startLine":1624}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02240a565bc50b153a79a61374c4621937bae3c4a7c2a9eec13788b769f96a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdk_tests/crates/csharp/host_callables/Program.cs: baml_language/sdk_tests/crates/csharp/host_callables/Program.cs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in top-level statements at line 9. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdk_tests/crates/csharp/host_callables/Program.cs\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":"baml_language/sdk_tests/crates/csharp/host_callables/Program.cs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1b756841b6c6fa13282722026bdc3c5cf74ecfdeb99219384a25d12c65c8a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_vm/src/package_reflect/graft.rs: baml_language/crates/bex_vm/src/package_reflect/graft.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in bex_vm::package_reflect::graft::relocate at line 1240. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_vm/src/package_reflect/graft.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":"baml_language/crates/bex_vm/src/package_reflect/graft.rs"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbcd8309eb4687d6660be71f9a181ddfda1809546a5bde4d203a6be6f95963a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bridge_cffi/src/baml_to_host.rs: baml_language/crates/bridge_cffi/src/baml_to_host.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in bridge_cffi::baml_to_host::decode_invocation_request at line 404. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bridge_cffi/src/baml_to_host.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":"baml_language/crates/bridge_cffi/src/baml_to_host.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"698fe705207889c490585d42a00749e1d882ad33d806f483546a78fcf395f266"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_tests/src/type_spec/harness.rs: baml_language/crates/baml_tests/src/type_spec/harness.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in baml_tests::type_spec::harness::collect_hir_ty_nodes at line 610. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_tests/src/type_spec/harness.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":"baml_language/crates/baml_tests/src/type_spec/harness.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99d25e4ab65b330334fe06328885826c7fa765c4a53dea097bb0763fe88ab8e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_hir_ty/src/init_io.rs: baml_language/crates/baml_compiler2_hir_ty/src/init_io.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in baml_compiler2_hir_ty::init_io::evaluated_calls_impl at line 141. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_hir_ty/src/init_io.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":"baml_language/crates/baml_compiler2_hir_ty/src/init_io.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec89fdcac4e88bbf004d8f07152d2320904029c31eb373d6ec7425c84308c320"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_hir/src/body_type_refs.rs: baml_language/crates/baml_compiler2_hir/src/body_type_refs.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in baml_compiler2_hir::body_type_refs::collect_body_type_refs at line 114. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_hir/src/body_type_refs.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":"baml_language/crates/baml_compiler2_hir/src/body_type_refs.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5f49f0dd5605b74b985ce2ffb89e0641b2c8c940f8c879f967ee5bb5246ad3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_hir_ty/src/infer/trace_hooks.rs: baml_language/crates/baml_compiler2_hir_ty/src/infer/trace_hooks.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in baml_compiler2_hir_ty::infer::trace_hooks::checked_declaration at line 60. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_hir_ty/src/infer/trace_hooks.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":"baml_language/crates/baml_compiler2_hir_ty/src/infer/trace_hooks.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95d604a804b8bb8d81f629cd13c79fb84f20263c34f6c41f6c3cc6007901b48"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdk_tests/crates/csharp/streaming/Program.cs: baml_language/sdk_tests/crates/csharp/streaming/Program.cs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in top-level statements at line 11. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdk_tests/crates/csharp/streaming/Program.cs\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":"baml_language/sdk_tests/crates/csharp/streaming/Program.cs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"db26658c55091b74ec65832a727632dd6b0a313021dc3e899c56aade6ed923a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_rust/src/codegen/expr.rs: baml_language/crates/baml_compiler2_rust/src/codegen/expr.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in Generator::rvalue at line 18. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_rust/src/codegen/expr.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":"baml_language/crates/baml_compiler2_rust/src/codegen/expr.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac57d55d6db758075b55db2c38af9cbe5cdb98c866147c2bf19169d7bf0e702"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_mir/src/optimize/values.rs: baml_language/crates/baml_compiler2_mir/src/optimize/values.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in baml_compiler2_mir::optimize::values::fold_constants at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_mir/src/optimize/values.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":"baml_language/crates/baml_compiler2_mir/src/optimize/values.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c4878d8100c7c7321b52358396af1b3503cc49c95e4b43b10921c10cbbb5a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_heap/src/heap_debugger/real.rs: baml_language/crates/bex_heap/src/heap_debugger/real.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in BexHeap::verify_object_invariants at line 278. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_heap/src/heap_debugger/real.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":"baml_language/crates/bex_heap/src/heap_debugger/real.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"91da2faf2bba2adde2c328c7016c56d06ea21812d1beb2f59879629882f2a243"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/go/baml_go/runtime.go: baml_language/sdks/go/baml_go/runtime.go changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in baml_go.encodeCallForDispatchWithTargetAndTypeArgs at line 565. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/go/baml_go/runtime.go\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":"baml_language/sdks/go/baml_go/runtime.go"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b43eecd9a7ccef67ca6397498d1f88fac74305a2ab6c4ebecee5af6f1fb1057"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: typescript2/app-product-metrics/src/jobs/send-slack-report.ts: typescript2/app-product-metrics/src/jobs/send-slack-report.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in send-slack-report.captureDashboardOnce at line 204. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- typescript2/app-product-metrics/src/jobs/send-slack-report.ts\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":"typescript2/app-product-metrics/src/jobs/send-slack-report.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"69cf0f5ef89ec6fc1fc08d15a7e3f32346466461b0274520ecfbad51bd700001"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_ide/src/completion/context.rs: baml_language/crates/baml_ide/src/completion/context.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in baml_ide::completion::context::classify at line 357. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_ide/src/completion/context.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":"baml_language/crates/baml_ide/src/completion/context.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"1728a84746e46b7006bba0800f9b37d982db309423801523e8f129abc50e04e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/python/rust/bridge_python/src/host_value.rs: baml_language/sdks/python/rust/bridge_python/src/host_value.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in bridge_python::host_value::discard_host_call_args at line 535. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/python/rust/bridge_python/src/host_value.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":"baml_language/sdks/python/rust/bridge_python/src/host_value.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"a007b27a147334f999303c1d027a7e525fbb6b3861293a7ce1f1843386860646"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/btel_snapshot/src/memory.rs: baml_language/crates/btel_snapshot/src/memory.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in btel_snapshot::memory::type_bytes at line 118. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/btel_snapshot/src/memory.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":"baml_language/crates/btel_snapshot/src/memory.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3988c12ee7d2e95638953295466db4e4ced3aba0f4359ab052125e09d9d1be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_release/src/lib.rs: baml_language/crates/baml_release/src/lib.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Fetcher::install_to_toolchain_root_with_force at line 235. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_release/src/lib.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":"baml_language/crates/baml_release/src/lib.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9b8d1d24adf2c1bc658b688264f6a8642a0a1baac78ee4713e2028589ec5cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: typescript2/app-website/components/home/language.tsx: typescript2/app-website/components/home/language.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in language.Examples at line 374. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- typescript2/app-website/components/home/language.tsx\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":"typescript2/app-website/components/home/language.tsx"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41a072146685f7667d99d58c60e0aed595f077d8995dea6b09edaf3b1ed7d9c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: typescript2/app-beps/src/app/bcs/[number]/reader.tsx: typescript2/app-beps/src/app/bcs/[number]/reader.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in reader.BcsReader at line 73. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- typescript2/app-beps/src/app/bcs/[number]/reader.tsx\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":"typescript2/app-beps/src/app/bcs/[number]/reader.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"43519070eaebab73a726e9e194adbfcd09460b853f9378e4f05498d3c39c0003"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_query_btel/src/ingest/context.rs: baml_language/crates/baml_query_btel/src/ingest/context.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in baml_query_btel::ingest::context::identity at line 214. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_query_btel/src/ingest/context.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":"baml_language/crates/baml_query_btel/src/ingest/context.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"084e7a3260809b58a0367c4cabcab62d3b5eaad199220cf2d5031ef38cdb35e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: typescript2/app-website/components/home/improve.tsx: typescript2/app-website/components/home/improve.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in improve.Collage at line 715. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- typescript2/app-website/components/home/improve.tsx\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":"typescript2/app-website/components/home/improve.tsx"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b0c96189afefb66ec847783c65fd11ea375794b28fd16c0568ee53fc3c23f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_vm/src/package_baml/json/encode.rs: baml_language/crates/bex_vm/src/package_baml/json/encode.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in Walker::visit at line 620. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_vm/src/package_baml/json/encode.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":"baml_language/crates/bex_vm/src/package_baml/json/encode.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1bb53962c52757def3b985eff4f9797c90dc6e829f16423f11fd13a5014b84"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/sys_wasm/src/host_value.rs: baml_language/crates/sys_wasm/src/host_value.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in WasmHost::call_registered_callable_with_context at line 563. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/sys_wasm/src/host_value.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":"baml_language/crates/sys_wasm/src/host_value.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e81bc3d79a2d7160be0fae078f1828ca4bc37ad13682b1ea815698849772a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/swift/Sources/BamlBridge/Encode.swift: baml_language/sdks/swift/Sources/BamlBridge/Encode.swift changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Encode.swift.encodeCallArgs at line 1035. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/swift/Sources/BamlBridge/Encode.swift\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":"baml_language/sdks/swift/Sources/BamlBridge/Encode.swift"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2cf378c0308f83a6faec550411a4dc919488a763b4449b931e51df44b918b2c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: typescript2/pkg-playground/src/run-store-client.ts: typescript2/pkg-playground/src/run-store-client.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in run-store-client.createRunStoreClient at line 223. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- typescript2/pkg-playground/src/run-store-client.ts\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":"typescript2/pkg-playground/src/run-store-client.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"701fd853e6e00ac87a17774a82527739ede16b6b3a7a26ba1648c713464bc2b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: typescript2/app-beps/src/app/api/auth/github/callback/route.ts: typescript2/app-beps/src/app/api/auth/github/callback/route.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in route.GET at line 57. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- typescript2/app-beps/src/app/api/auth/github/callback/route.ts\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":"typescript2/app-beps/src/app/api/auth/github/callback/route.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3912c6eaaae7975597004f9adf212efcab054608d68c591a07142cf154fe8d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/btel_snapshot/src/decode.rs: baml_language/crates/btel_snapshot/src/decode.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in btel_snapshot::decode::decode at line 359. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/btel_snapshot/src/decode.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":"baml_language/crates/btel_snapshot/src/decode.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"8610a5f0cc2bd840fd5aec8ad512756f20d3d02ab956a52c074cb929bb1b2be4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_sap/src/deserializer/coercer/coerce_ty.rs: baml_language/crates/bex_sap/src/deserializer/coercer/coerce_ty.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in TyResolvedRef::coerce at line 144. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_sap/src/deserializer/coercer/coerce_ty.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":"baml_language/crates/bex_sap/src/deserializer/coercer/coerce_ty.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb61c5edddf4e42090c3d96ad7c80994d1db140b500b039bb48e0cc11f7e045"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: typescript2/app-beps/src/app/profile/page.tsx: typescript2/app-beps/src/app/profile/page.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in page.ProfilePage at line 68. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- typescript2/app-beps/src/app/profile/page.tsx\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":"typescript2/app-beps/src/app/profile/page.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ee8094e035e51ea359ec73eafdf980892c06af1b91b90a2c489d19576be8c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/btel_snapshot/src/walk.rs: baml_language/crates/btel_snapshot/src/walk.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in btel_snapshot::walk::value at line 158. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/btel_snapshot/src/walk.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":"baml_language/crates/btel_snapshot/src/walk.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f61a3e28edcfeab4d0b23118626bfec0a05e41a93c372097e92ddcb29e4d2f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/csharp/bridge_csharp/src/Proto/PrimitiveProtocol.cs: baml_language/sdks/csharp/bridge_csharp/src/Proto/PrimitiveProtocol.cs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in PrimitiveProtocol.DecodeHandle at line 1038. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/csharp/bridge_csharp/src/Proto/PrimitiveProtocol.cs\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":"baml_language/sdks/csharp/bridge_csharp/src/Proto/PrimitiveProtocol.cs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d91583190862433d5b771f2e8950eeea661e134ae53830439230f96893dea3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlType.java: baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlType.java changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in BamlType.toString at line 1295. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlType.java\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":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/BamlType.java"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb1dc1becc5b50c1f8a61a4fdea499b9e22e6b4472fc3263b144d72320efe15"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/btel_processor/src/lib.rs: baml_language/crates/btel_processor/src/lib.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Processor::process_available at line 571. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/btel_processor/src/lib.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":"baml_language/crates/btel_processor/src/lib.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd58aebdfa8f9dd7212e49b3ff7be520dfb0ec64afab2883ea9584c30a8a9886"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_ide/src/tokens/index.rs: baml_language/crates/baml_ide/src/tokens/index.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in baml_ide::tokens::index::index_function at line 145. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_ide/src/tokens/index.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":"baml_language/crates/baml_ide/src/tokens/index.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a374c1854dfced492db7285c8e010b3955b25d2308f323d784222615f6958ce8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: typescript2/app-developer-docs/lib/generated-content/package-generator.ts: typescript2/app-developer-docs/lib/generated-content/package-generator.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in package-generator.buildReferencePages at line 161. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- typescript2/app-developer-docs/lib/generated-content/package-generator.ts\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":"typescript2/app-developer-docs/lib/generated-content/package-generator.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fb31e21341596b88e90e3c451f41c5b51bf3d494b5b71643d58ed22945b3d3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/sdks/go/baml_go/json.go: baml_language/sdks/go/baml_go/json.go changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in baml_go.encodeJSON at line 24. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/sdks/go/baml_go/json.go\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":"baml_language/sdks/go/baml_go/json.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f455e6d38e679574e809abbe8d9870bd34e8cb7c86ab6513c7d5657c550b912"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_type/src/decl_cycles.rs: baml_language/crates/baml_type/src/decl_cycles.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in baml_type::decl_cycles::extract_type_alias_deps at line 112. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_type/src/decl_cycles.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":"baml_language/crates/baml_type/src/decl_cycles.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73f56a087a1218b990f80e82b9c93fd33b6c1946d16ef7e25a6e0c6cc417af0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: typescript2/app-website/app/(home)/bamlcode/_components/Workbench.tsx: typescript2/app-website/app/(home)/bamlcode/_components/Workbench.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in Workbench.Workbench at line 23. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- typescript2/app-website/app/(home)/bamlcode/_components/Workbench.tsx\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":"typescript2/app-website/app/(home)/bamlcode/_components/Workbench.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"22468eee72a359d182c55c92fa8f76852c0934e5cb91782000fde6707a9c2d50"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_vm/src/package_baml/json/decode.rs: baml_language/crates/bex_vm/src/package_baml/json/decode.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in bex_vm::package_baml::json::decode::decode_one at line 724. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_vm/src/package_baml/json/decode.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":"baml_language/crates/bex_vm/src/package_baml/json/decode.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ba8c7bc6a717def96445b17c4b9eefc19a53631e81102cf28997806c2df635"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: typescript2/app-beps/src/app/bcs/[number]/frame.tsx: typescript2/app-beps/src/app/bcs/[number]/frame.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in frame.BcsFrame at line 34. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- typescript2/app-beps/src/app/bcs/[number]/frame.tsx\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":"typescript2/app-beps/src/app/bcs/[number]/frame.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"276358982733a9a54a59557092d50594b4c409d75b177389c215e815759e6275"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: typescript2/app-beps/src/app/bcs/[number]/comments/page.tsx: typescript2/app-beps/src/app/bcs/[number]/comments/page.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in page.BcsComments at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- typescript2/app-beps/src/app/bcs/[number]/comments/page.tsx\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":"typescript2/app-beps/src/app/bcs/[number]/comments/page.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"819b3e39e7ea61a6fc4d8e7ae506720ac984b82092bed90ea9d9ff52ef8196b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/baml_compiler2_mir/src/optimize/effects.rs: baml_language/crates/baml_compiler2_mir/src/optimize/effects.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Analysis::new at line 557. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/baml_compiler2_mir/src/optimize/effects.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":"baml_language/crates/baml_compiler2_mir/src/optimize/effects.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"74246696fc1e685ed16c9d9a3886ac96721b5d8cee990f796a2f206ef31388cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: typescript2/app-developer-docs/lib/generated-content/verify.ts: typescript2/app-developer-docs/lib/generated-content/verify.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in verify.verifyGeneratedRelease at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- typescript2/app-developer-docs/lib/generated-content/verify.ts\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":"typescript2/app-developer-docs/lib/generated-content/verify.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee2f2c31ede93ee5e6a13789f8cdd09049cc26ea4b5a8b45aaf118cfbafc3c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: baml_language/crates/bex_vm/src/call_specialize.rs: baml_language/crates/bex_vm/src/call_specialize.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in bex_vm::call_specialize::specialize_calls at line 7. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- baml_language/crates/bex_vm/src/call_specialize.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":"baml_language/crates/bex_vm/src/call_specialize.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"88aaba56211222f3aaae988b49d7eb0f66f1a9dc2d8e1a689731fb3ed8c2cbb3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: typescript2/pkg-playground/src/telemetry/use-telemetry.ts: typescript2/pkg-playground/src/telemetry/use-telemetry.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in use-telemetry.useTelemetry at line 115. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- typescript2/pkg-playground/src/telemetry/use-telemetry.ts\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":"typescript2/pkg-playground/src/telemetry/use-telemetry.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7954d4b45ea01cc11b2b8e7c2c4a8c8daff79bb502f240ec57a0801b0520409f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: typescript2/app-website/app/(home)/blog/page.tsx: typescript2/app-website/app/(home)/blog/page.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in page.BlogIndex at line 296. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- typescript2/app-website/app/(home)/blog/page.tsx\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":"typescript2/app-website/app/(home)/blog/page.tsx"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"a644a33ce153c4e1f1295585f2c40abaa5cd601faf6b803dde4b88a973dee508"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/smoke-go-release.py: scripts/smoke-go-release.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in smoke-go-release.main at line 213. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- scripts/smoke-go-release.py\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":"scripts/smoke-go-release.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"79781fec0820bca4c949777de59317234ea78e412249de39791269ab13c69a3c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: typescript2/app-website/components/home/review.tsx: typescript2/app-website/components/home/review.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in review.Comment at line 1043. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- typescript2/app-website/components/home/review.tsx\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":"typescript2/app-website/components/home/review.tsx"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6a84153184fdadcc0398465d015aabb3c444a0997875519d1cb05b6683720c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: .github/scripts/csharp-mtime-cache.py: .github/scripts/csharp-mtime-cache.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in csharp-mtime-cache.restore at line 98. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- .github/scripts/csharp-mtime-cache.py\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":".github/scripts/csharp-mtime-cache.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2b10fbd60bdc6af9ccf461077a15a587231bc460aa51c9e298d3cea3cf19a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: typescript2/app-developer-docs/components/generated-reference.tsx: typescript2/app-developer-docs/components/generated-reference.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in generated-reference.GeneratedReferenceContent at line 461. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 06:47:21 \u002B00:00\u0027 --until=\u00272026-11-14 06:47:21 \u002B00:00\u0027 --full-history --no-merges -- typescript2/app-developer-docs/components/generated-reference.tsx\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":"typescript2/app-developer-docs/components/generated-reference.tsx"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9422f9d74ed1888876f3a5edcdb380c0e1fa5f847030b24c6f52ae3b1652d6f"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 35 significant file(s) lose their only recent owner: languages/rust/baml/src/raw_objects/mod.rs, languages/rust/baml/src/runtime.rs, typescript2/app-developer-docs/components/generated-reference.tsx, typescript2/app-beps/convex/slack.ts, baml_language/crates/btel_bcs/src/liveness.rs, typescript2/app-beps/convex/comments.ts, baml_language/crates/tools_size_gate/src/measure.rs, typescript2/app-developer-docs/lib/generated-content/publisher.ts (\u002B27 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"225770523c1fe9fc9f123e66543a04592e1e07ec47bf50a9b7f75e5e54af885e"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 16 significant file(s) lose their only recent owner: baml_language/crates/baml_type/src/normalize/mu.rs, baml_language/crates/baml_type_macros/src/convert.rs, baml_language/crates/baml_type_macros/src/emit.rs, baml_language/crates/baml_ide/src/rename.rs, typescript2/app-stdlib-matrix/src/signature.ts, typescript2/app-stdlib-matrix/src/components/matrix-app.ts, baml_language/crates/bex_vm/src/type_context.rs, baml_language/crates/baml_type/src/realized_ty.rs (\u002B8 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c4f5d8f92a2b6fa78d8b92eaadce41f11748ca2a4fc621b45bac122cd368769"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 14 significant file(s) lose their only recent owner: typescript2/app-product-metrics/src/jobs/send-slack-report.ts, baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/utils.rs, typescript2/app-product-metrics/src/server.ts, baml_language/tools/speedtest/src/speedtest/compare.py, tools/baml_nightly_select.py, tools/sheep-council/prepare-sheep-council-email.py, jetbrains/build.gradle.kts, tools/bctl_src/oncall/cli.py (\u002B6 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"233ae2fd2acacebadfe9aadf94413b7140ead5c6f9ef3fef4b91fc5dae6f0527"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #4: If anonymized user #4 becomes unavailable, 6 significant file(s) lose their only recent owner: baml_language/crates/baml_lsp_server/src/lsp_runtime.rs, baml_language/crates/baml_lsp/src/position_codec.rs, typescript2/pkg-playground/src/args-form-model.ts, typescript2/app-beps/src/components/bep/bep-submit-modal.tsx, typescript2/app-vscode-webview/src/RemoteEditorView.tsx, typescript2/pkg-editor/src/remote-backend.ts. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"27b85e0640b9a4548ce68c211333c451a67f93af5fa5d19755ad8618614bffa8"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #5: If anonymized user #5 becomes unavailable, 6 significant file(s) lose their only recent owner: typescript2/app-beps/src/lib/export-utils.ts, engine/baml-rpc/src/ui/ui_function_calls.rs, engine/baml-runtime/src/request/aws.rs, engine/baml-rpc/src/ui/ui_traces.rs, engine/baml-rpc/src/ui/ui_types.rs, engine/baml-runtime/src/tracingv2/publisher/rpc_converters/errors.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"337c5692d90a8f3188fc057eecb8c12cb1459621d8d3a34a933765b6bcab2eb6"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #6: If anonymized user #6 becomes unavailable, 3 significant file(s) lose their only recent owner: baml_language/crates/baml_query_btel/src/sql.rs, baml_language/crates/baml_query_btel/src/sql/tests.rs, baml_language/crates/baml_compiler_diagnostics/src/runtime_type.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3a37a7b2cd01c70aaa969b1ff5ab53f297722321607623463c6e486e50ab742f"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 3 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (84 single-owned of 2282 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 2282 of the 3431 production source files in this repository met that bar). They are anonymized user #7 (2 file(s)), anonymized user #8 (1 file(s)), anonymized user #9 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: engine/baml-runtime/src/optimize/tui.rs, engine/baml-runtime/src/optimize/storage.rs, baml_language/crates/baml_cli/src/output/mod.rs, typescript/apps/fiddle-web-app/app/embed/page.tsx."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdk_tests/crates/csharp/dynamic_values/Program.cs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"2243e392fe78ca294dab48b676fa7d32ceed0a7290d1f01bf9f3f53eb004f663"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Cffi/HostValueRegistry.cs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"797374fa735c137898ff792c5d073f0534f2f62640bf173668c1e2d9ae930b07"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Cffi/NativeCallbacks.cs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3ee69067bf33d806fdf95585cc2da353ec7f301e70b075af7ced7db301e42f"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Cffi/NativeCallbacks.cs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8f5c921bc2b7ebe0cf290a9adf835ac12bf35fe5c027ca804dc7f086f147e6"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Values/BamlStream.cs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b4fd99e2eb74679f6a7910a8e11b86c2343bb9c3918d30f4b52f7781c60398"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Values/BamlStream.cs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"981b9015953b7cab43a4f7b6dc3f28ce9ea028094a9a7067109cc8487754cfaa"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Values/BamlStream.cs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c467b8b32d7b1d5a0d796ffa7507bcf2a5aa9e4cd060135cfb896dd16ac5c5"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Values/BamlStream.cs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b3882bf94d2dbe615b7024ecd731844128898fc587c100b15595195756a474"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc7c9a1cdabf73d600d04e3be99f8f9e2cdfeaafca188a975bf9fea5e9e2bb9"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T1? _value1 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30a81504a2132a858a33ca3ed45e0d45d59a0723b260620e51b297c5d33edee"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T1? _value1 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee32ded88a041eacf59ba3f1cb687e26c9af6488d0591db003a4df6741d6b70"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T1? _value1 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc4d24c8954bb6e70b865b300a88807b0ea62c0b94b17c6cfea59ad53d6af3d"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T2? _value2 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3fad76f2979ec011a2aee142bd9f241f5dcb99466fbf242d0f609ce811c9488"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T2? _value2 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"8123f92d9d2d40afbd2e2eb967a64104d565d0cb000581cb45936f0b1b1f7160"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T2? _value2 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d9516b475afcd0efd32ee19b2ddb8fbbf2a75746b4dd75dd59073402217b19"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T3? _value3 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dc1e4e8358df887d2cac4851d96053c25077517e8ebe73daebe6c777afd25f"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T3? _value3 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad0b27e0ac00c369d4d80425d1d194d8cf6e1714baa2597c9054f6676332b19"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T3? _value3 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"4647d0642b00dcf9d5815b6939b89945f5bc548456c8c484741614dbc8bfc23b"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T4? _value4 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"15aeef3ceeeda701044c91eab43d13c6d33e48f6733eced43d0bb07d03a15ce1"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T4? _value4 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"85aae8a24e45874cf02e0ca06a586f41909fb1701600a07d8c55aeb820597010"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T4? _value4 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"62edb3ec82903c9351d0aaa84c4d2efb7fae5e04cf09684f0f673e301e9de7c8"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T5? _value5 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ddfb9c7b553aeb6bd4137e3cf75e8b939381938d6f91b27c72429ee9b3575b5"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T5? _value5 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fe07134b7704349cb8d147ea5a018df1092c2d39442d139e08e8c3b6f39677"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T5? _value5 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6fac43efc3feaa2e7e15daa352933d42078cb43767b1208db7f8d5698eb62a"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T6? _value6 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c5df285cd45407a62f89e6b3d41be039362580da2a0113c5da2df89d4d6885"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T6? _value6 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"110e2f8bc7820a196a6b73086abbbcb26bc0408dbb9311ead5429c946013d806"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T6? _value6 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b9d83f5e1d9dbf679a724fc39ce40f6ed220d303c7a3da30e6ca31d5dad017"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T7? _value7 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab3069eab843c41f968bf2ed7ab3272bb146c999b58f9d8b9b77c87457f8c15"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T7? _value7 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"868ddc1cad7b107ab34fde69f134f1990d9ec883c8fdfc0e46e329b38efe2f66"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T7? _value7 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8bf734bb609ebcb504cdd4040f34b744d219d9a8756bc77a04fd847f76c8e84"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T8? _value8 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"2040545875629f54a5ecf6292e7b72338a2b658f5e2071fef279294fa0059dad"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T8? _value8 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"5332ac869defb5a247d134ba51e8c5b11643cc3d902a95dcb6dde115aa108101"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T9? _value9 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9d817b925b77f4239713a46fb06de5668ec079fcaaab271e10777d44d57cc0"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T9? _value9 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"e026c1ea3f0b8c207292dfb3322ea6d7157effbca286bec5c326a2b2355024e7"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T10? _value10 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b481ff8807a1ae847ec57795a3bef1002eccc932f44a46805b5ef87a5d5733"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T10? _value10 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c450ed7760dc2543dd9969d0001720483e044baac16576626d42849b5c0b1b"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T11? _value11 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad04c8de6811313b0ed304703f73344dd236ea3e96da5315648cead9f8eae0e6"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T11? _value11 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ef8bc1109d58d086548b35d52cdf995526fa2a34ff5be7118781e6dde8f503"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T12? _value12 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"e313379a902cd0ff467906f8c6f200e973b4c08732fe2d421d3d6d5d30c9a3ee"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T12? _value12 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"647fe4c9f7ff6c5867572ec50832823bfccef6a06a8f96e24ee982547007893e"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T13? _value13 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec52f462a14e3da47d0b08f58b5529ad81e9891e09570a7fcfe85618b3f3140b"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T13? _value13 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b966eae665ae8568ac8fed250c7b2e9efcc60e59bc4d2dfb8c8a0f3d927d724"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T14? _value14 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"79dac9708ae54016f758342a067c227cc9d2a85c7dfdb70d302d586ead372361"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T14? _value14 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31f3f3f9a9d8c4ece0f6a6c5e8d2ea989d12b809bfdcae85cbd0d6ca4e4e874"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T15? _value15 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e94bb19db2f8e6d07399a9db1c52c9e411eb1f501bb134c8889e19626fd3363"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T15? _value15 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"615dc5f3f3f506ce70316583d8e277aa4db1db4149442a144bb5c18bd904b328"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T16? _value16 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72a3460a93a1aa069407c94a8e2b5a74bd0af4b82855ce883c4b24f11832319"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T17? _value17 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"95bda290d41a4a8c5467645997f785b5f8373d68d9ba0b331084eab308394a74"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T18? _value18 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0fe50cba940df9ed84bdeaf6bf9a464166ed99ff89b2f661ec8950866d8966"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T19? _value19 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f24329328e6b1dc95af22e5bf12afbaa9be3907907d00dca6a3c5556cf44be9"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T20? _value20 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"28af467c2be818fd3c36ae13335b0fd8c6bb2ebbd0174a0a459a16f0aff12b85"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T21? _value21 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a49e259008fc104d70c598143860b792a2c99772fff218c46717c830b07b09a"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T22? _value22 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"337f25cd44609534d350634fb223d478aa5eed618f89b4b06b1c9aa38ff4499d"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T23? _value23 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"613874d3ba7d68992557c12afcfbdc4bc0c7b096f40656178dd4c9fbd2c4b34b"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T24? _value24 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cecfa2d93ff865aff6bb03da86b676b31b5de29c14355b29aa220e69fb0bf2c"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T25? _value25 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1837b3e4af58df86575a0c11c0e82b371eb05a2b1063a5ae705f2879933c578"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T26? _value26 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"f151b4b73576b02daf8d07837fc3928dc1979cc57d500e27325c3d71f511ca09"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T27? _value27 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"16606536f4c0c8d2add773ffb7ce3cbea92bac141ecee4cb0c1472556965da60"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T28? _value28 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd088323cbdaeaf96d91fe1daffb31e1ce22b5709a9f4dd390afcc881364285"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T29? _value29 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"8edbf62ccc14ca680e1f80bffc6465109f8ad0c1fbca8159168b890909ea6803"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T30? _value30 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed1c15fdaadd9a5c9ed5a619ea545bfb6ee67e4e5db9f42b708b71d82bd7c3c"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private T31? _value31 \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.Union.LayoutProbe/Program.cs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd86c315d1a2b7f2ce768f28549b8681fd61d259cf848b7203820b1f6d7e3d8"}},{"ruleId":"D17","level":"warning","message":{"text":"CommentedOutCode: commented-out configuration entry \u0060cache\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/actions/setup-python/action.yml"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6f60c75fd75228f9c3b0dc0822af2c1409436ddc235af549a9711f87130148"}},{"ruleId":"D17","level":"warning","message":{"text":"CommentedOutCode: commented-out configuration entry \u0060RESULT_MACOS\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/size-gate.reusable.yaml"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1469f7296338ecac71f6c79f0c6d14e9f9a1666b9536dcc278ef332dbb78fa4"}},{"ruleId":"D17","level":"warning","message":{"text":"CommentedOutCode: commented-out configuration entry \u0060RESULT_WINDOWS\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/size-gate.reusable.yaml"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f42c27b3269901a49a0132b41e060c29f375cd8235e1e7688d8d40b0290c51b"}},{"ruleId":"D17","level":"warning","message":{"text":"Dead code: ReadHandleFields: Method ReadHandleFields \u2014 Roslyn\u0027s SymbolFinder walked every project the solution loads, including Baml.Bridge, and found no reference to it. That walk cannot see three kinds of caller, so check them before removing it: code outside the solution file (a solution is a curated list, not the repository \u2014 a sibling test tree with its own .sln is invisible), a call resolved by reflection or dependency injection from the symbol\u0027s name, and any project the workspace could not load. This is \u0027no caller found by this walk\u0027, not a verdict that the symbol is unused."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedCodec.cs"},"region":{"startLine":1825}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d44b0fe6184532c30be0312eafdedf8cc939e57c447ebf6993d5c8080a8f062"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060Baml.BytecodeCarrierEmitter\u0060 is an executable (\u0060OutputType Exe\u0060) and neither \u0060baml_language/sdks/csharp/bridge_csharp/tools/Baml.BytecodeCarrierEmitter/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.BytecodeCarrierEmitter/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7abd7523956ea5cb12f2da4ef79223e04492733372f2e61fa4952da82362409d"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060Baml.NuGetNormalizer\u0060 is an executable (\u0060OutputType Exe\u0060) and neither \u0060baml_language/sdks/csharp/bridge_csharp/tools/Baml.NuGetNormalizer/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/tools/Baml.NuGetNormalizer/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"824797c4b61776325000fc34071fc2225f881d4f297fcdfd468a887df7b8bb55"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060language_client_python\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060engine/language_client_python/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_python/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2a44f83a82479c22b2ff03c3d38e7c01dbe90dbd540c874e54ff8cef4e8072"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060language_client_typescript\u0060 is a command-line package (\u0060bin\u0060 in \u0060package.json\u0060) and neither \u0060engine/language_client_typescript/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a34c781aac1e0b9ea1732bf7e523dd6569f909ca05fc70d87186efc3c728f0"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060python-v1\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060integ-tests/python-v1/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/python-v1/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"344bfcb19f9081af6f7647d4946d25ae80b2c8d551abbfa6d0e35d553d81ef80"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060baml\u0060 is a package (\u0060PackageId\u0060) and neither \u0060languages/csharp/baml/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"languages/csharp/baml/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f49060cf4bd3fba612ed0347715016b3b2d5be2d08ae6f10d5dbff430b17970"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060app-promptfiddle\u0060 is runnable (a \u0060start\u0060 script in \u0060package.json\u0060) and neither \u0060typescript2/app-promptfiddle/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7114a355f8bbd76a1f553444d5affa0556945218acb96a6fe982838783ae93f"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060pkg-playground\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060typescript2/pkg-playground/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdaabba13f3e79615e44443bd3c6d0eda526a1cc92252a853266a4b39637c21"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. The recognised ADR directories in this tree were read \u2014 \u0060typescript2/app-beps/src/app/bcs/[number]/decisions\u0060, \u0060typescript2/app-beps/src/app/beps/[number]/decisions\u0060, \u0060typescript2/app-beps/src/components/decisions\u0060 \u2014 and none of their files is a decision record (a README, index or template page does not count). What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060baml_language/sdk_tests/crates/csharp/basic_calls/BasicCalls.csproj\u0060 makes this repository a deployable product (line 3)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdk_tests/crates/csharp/basic_calls/BasicCalls.csproj"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc054d742a99f378be2bbfc8d8693b3dbab1b3f0c3d48a87555f53dd7daff26"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060FixtureHTTPServer\u0060 spells \u0060HTTP\u0060 where 72 names in the project spell it \u0060Http\u0060: 72 of 73 names in project python spell the token \u0060Http\u0060 (72 of 73; unit: names in project python containing \u0060Http\u0060). Peers: engine.generators.languages.python.generated_tests.array_types.baml_client.async_client.BamlHttpRequestClient (engine/generators/languages/python/generated_tests/array_types/baml_client/async_client.py:555); engine.generators.languages.python.generated_tests.array_types.baml_client.async_client.BamlHttpStreamRequestClient (engine/generators/languages/python/generated_tests/array_types/baml_client/async_client.py:682); engine.generators.languages.python.generated_tests.array_types.baml_client.sync_client.BamlHttpRequestClient (engine/generators/languages/python/generated_tests/array_types/baml_client/sync_client.py:550); engine.generators.languages.python.generated_tests.array_types.baml_client.sync_client.BamlHttpStreamRequestClient (engine/generators/languages/python/generated_tests/array_types/baml_client/sync_client.py:677); engine.generators.languages.python.generated_tests.asserts.baml_client.async_client.BamlHttpRequestClient (engine/generators/languages/python/generated_tests/asserts/baml_client/async_client.py:123). Rename to \u0060FixtureHttpServer\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/wrapper_tests/fixture.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e295dac8b53854b5e9bc132366251862d4f5366a27829dae650d98dc92dd51e"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060TestGeminiOpenAiGeneric\u0060 spells \u0060Ai\u0060 where 58 names in the project spell it \u0060AI\u0060: 58 of 60 names in project ruby spell the token \u0060AI\u0060 (58 of 60; unit: names in project ruby containing \u0060AI\u0060). Peers: BamlSyncClient.OpenAIWithAnthropicResponseHello (integ-tests/ruby/baml_client/client.rb:2379); BamlSyncClient.PromptTestOpenAI (integ-tests/ruby/baml_client/client.rb:2679); BamlSyncClient.PromptTestOpenAIChat (integ-tests/ruby/baml_client/client.rb:2704); BamlSyncClient.PromptTestOpenAIChatNoSystem (integ-tests/ruby/baml_client/client.rb:2729); BamlSyncClient.TestOpenAI (integ-tests/ruby/baml_client/client.rb:4654). Rename to \u0060TestGeminiOpenAIGeneric\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/ruby/baml_client/client.rb"},"region":{"startLine":4279}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6375718b3d67793302f404c43a1013d66d4f5ff60161b15ff0f3ae94a30f04"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060TestGeminiOpenAiGeneric\u0060 spells \u0060Ai\u0060 where 58 names in the project spell it \u0060AI\u0060: 58 of 60 names in project ruby spell the token \u0060AI\u0060 (58 of 60; unit: names in project ruby containing \u0060AI\u0060). Peers: BamlSyncClient.OpenAIWithAnthropicResponseHello (integ-tests/ruby/baml_client/client.rb:2379); BamlSyncClient.PromptTestOpenAI (integ-tests/ruby/baml_client/client.rb:2679); BamlSyncClient.PromptTestOpenAIChat (integ-tests/ruby/baml_client/client.rb:2704); BamlSyncClient.PromptTestOpenAIChatNoSystem (integ-tests/ruby/baml_client/client.rb:2729); BamlSyncClient.TestOpenAI (integ-tests/ruby/baml_client/client.rb:4654). Rename to \u0060TestGeminiOpenAIGeneric\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/ruby/baml_client/client.rb"},"region":{"startLine":10340}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79d18d984623cc8b9880803c47db2335b477145d6eb3cd386da46348be207ab"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060envVarsJson\u0060 spells \u0060Json\u0060 where 212 names in the project spell it \u0060JSON\u0060: 212 of 214 names in project github.com/boundaryml/baml spell the token \u0060JSON\u0060 (212 of 214; unit: names in project github.com/boundaryml/baml containing \u0060JSON\u0060). Peers: Union3ProductOrTagOrUser.MarshalJSON (engine/generators/languages/go/generated_tests/array_types/baml_client/stream_types/unions.go:79); Union3ProductOrTagOrUser.UnmarshalJSON (engine/generators/languages/go/generated_tests/array_types/baml_client/stream_types/unions.go:96); Union3BoolOrIntOrString.MarshalJSON (engine/generators/languages/go/generated_tests/array_types/baml_client/types/unions.go:79); Union3BoolOrIntOrString.UnmarshalJSON (engine/generators/languages/go/generated_tests/array_types/baml_client/types/unions.go:96); Union3ProductOrTagOrUser.MarshalJSON (engine/generators/languages/go/generated_tests/array_types/baml_client/types/unions.go:271). Rename to \u0060envVarsJSON\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/baml_go/exports.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08a6151787573f1bf185fd1b3ab5683f77a51d55c16896d001fce0973575d8d"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060srcFilesJson\u0060 spells \u0060Json\u0060 where 212 names in the project spell it \u0060JSON\u0060: 212 of 214 names in project github.com/boundaryml/baml spell the token \u0060JSON\u0060 (212 of 214; unit: names in project github.com/boundaryml/baml containing \u0060JSON\u0060). Peers: Union3ProductOrTagOrUser.MarshalJSON (engine/generators/languages/go/generated_tests/array_types/baml_client/stream_types/unions.go:79); Union3ProductOrTagOrUser.UnmarshalJSON (engine/generators/languages/go/generated_tests/array_types/baml_client/stream_types/unions.go:96); Union3BoolOrIntOrString.MarshalJSON (engine/generators/languages/go/generated_tests/array_types/baml_client/types/unions.go:79); Union3BoolOrIntOrString.UnmarshalJSON (engine/generators/languages/go/generated_tests/array_types/baml_client/types/unions.go:96); Union3ProductOrTagOrUser.MarshalJSON (engine/generators/languages/go/generated_tests/array_types/baml_client/types/unions.go:271). Rename to \u0060srcFilesJSON\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/baml_go/exports.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aea746ae1d638bec32cbd829fd7984d220ddd8db02491da4793e209ce6b0d13"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060checksumURL\u0060 spells \u0060URL\u0060 where 83 names in the project spell it \u0060Url\u0060: 83 of 84 names in project github.com/boundaryml/baml spell the token \u0060Url\u0060 (83 of 84; unit: names in project github.com/boundaryml/baml containing \u0060Url\u0060). Peers: baml_client.NewImageFromUrl (engine/generators/languages/go/generated_tests/array_types/baml_client/runtime.go:193); baml_client.NewAudioFromUrl (engine/generators/languages/go/generated_tests/array_types/baml_client/runtime.go:197); baml_client.NewPDFFromUrl (engine/generators/languages/go/generated_tests/array_types/baml_client/runtime.go:201); baml_client.NewVideoFromUrl (engine/generators/languages/go/generated_tests/array_types/baml_client/runtime.go:205); baml_client.NewImageFromUrl (engine/generators/languages/go/generated_tests/asserts/baml_client/runtime.go:193). Rename to \u0060checksumUrl\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/baml_go/lib_common.go"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd091157e4154e89497aac047ba427bba46ff9114f64ecc7e3973c3ddd675ec5"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060nextCallbackID\u0060 spells \u0060ID\u0060 where 42 names in the project spell it \u0060Id\u0060: 42 of 43 names in project github.com/boundaryml/baml spell the token \u0060Id\u0060 (42 of 43; unit: names in project github.com/boundaryml/baml containing \u0060Id\u0060). Peers: ProductClassView.PropertyId (engine/generators/languages/go/generated_tests/array_types/baml_client/type_builder/classes.go:202); TagClassView.PropertyId (engine/generators/languages/go/generated_tests/array_types/baml_client/type_builder/classes.go:294); UserClassView.PropertyId (engine/generators/languages/go/generated_tests/array_types/baml_client/type_builder/classes.go:334); CircularReferenceClassView.PropertyId (engine/generators/languages/go/generated_tests/edge_cases/baml_client/type_builder/classes.go:134); UserClassView.PropertyId (engine/generators/languages/go/generated_tests/edge_cases/baml_client/type_builder/classes.go:830). Rename to \u0060nextCallbackId\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_go/pkg/callbacks.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae526a2eb3d29a1d3c179947d7a7e505a8f0aefa0e9197821ca0dd60b179cd95"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060testAWS\u0060 spells \u0060AWS\u0060 where 305 names in the project spell it \u0060Aws\u0060: 305 of 306 names in project @baml/root spell the token \u0060Aws\u0060 (305 of 306; unit: names in project @baml/root containing \u0060Aws\u0060). Peers: BamlAsyncClient.TestAws (integ-tests/react/baml_client/async_client.ts:7604); BamlAsyncClient.TestAwsCaching (integ-tests/react/baml_client/async_client.ts:7660); BamlAsyncClient.TestAwsClaude37 (integ-tests/react/baml_client/async_client.ts:7716); BamlAsyncClient.TestAwsInferenceProfile (integ-tests/react/baml_client/async_client.ts:7772); BamlAsyncClient.TestAwsInvalidAccessKey (integ-tests/react/baml_client/async_client.ts:7828). Rename to \u0060testAws\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/react/src/app/actions.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"2555832acf1a73c655edaaa0ac323786a09b86d0af8f44863bdc993191b4483c"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060VSCodeAPIWrapper\u0060 spells \u0060API\u0060 where 25 names in the project spell it \u0060Api\u0060: 25 of 26 names in project @baml/root spell the token \u0060Api\u0060 (25 of 26; unit: names in project @baml/root containing \u0060Api\u0060). Peers: add-api-key-form.AddApiKeyForm (typescript/packages/playground-common/src/components/api-keys-dialog/add-api-key-form.tsx:8); atoms.showApiKeyDialogAtom (typescript/packages/playground-common/src/components/api-keys-dialog/atoms.ts:32); atoms.userApiKeysAtom (typescript/packages/playground-common/src/components/api-keys-dialog/atoms.ts:126); atoms.requiredApiKeysAtom (typescript/packages/playground-common/src/components/api-keys-dialog/atoms.ts:219); atoms.areApiKeysMissingAtom (typescript/packages/playground-common/src/components/api-keys-dialog/atoms.ts:302). Rename to \u0060VSCodeApiWrapper\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/vscode.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5220e9aaa2582acb0800fcdd4de5b8a5c8d019251f4d82a6945d5341c84c43ee"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Add new enum values to Category\u0022 repeats the code it sits on: 4 of its 5 words (add, new, values, category) are already in \u0060tb.Category.addValue(\u0027Sports\u0027).description(\u0027Sports and athletics news\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/dynamic_types/typescript/index.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b55946db29ff64df55540f46ba3c711d3617f32416f8e1cd1bb62a64c580c7"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Add list of strings\u0022 repeats the code it sits on: 3 of its 3 words (add, list, strings) are already in \u0060tb.Person.addProperty(\u0027skills\u0027, tb.string().list());\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/dynamic_types/typescript/index.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b0fb88181d203443e235f27519e0ed140c9bd378c097c3b73618a0f4f5b184"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Add optional string\u0022 repeats the code it sits on: 3 of its 3 words (add, optional, string) are already in \u0060tb.Person.addProperty(\u0027nickname\u0027, tb.string().optional())\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/dynamic_types/typescript/index.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a38effc22868cacc793e904ca6062f45dd539f8659ede9f948d529c0b60b96c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Add a category with an alias\u0022 repeats the code it sits on: 3 of its 3 words (add, category, alias) are already in \u0060tb.Category.addValue(\u0027AI\u0027)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/dynamic_types/typescript/index.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b23c6d79beeb77399f39f1af4b9dab0669349b113dfeeb87a1bcd175ee35b0"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022resultOrNull can be object or null\u0022 repeats the code it sits on: 3 of its 3 words (result, null, object) are already in \u0060if (result.resultOrNull !== null \u0026\u0026 (typeof result.resultOrNull !== \u0027object\u0027 || result.resultOrNull === null))\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/union_types_extended/typescript/index.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"974c1b86749500d644a7c6a1f8d9f41a51ae115f6108760043a3050995909c18"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022age property just has a description\u0022 repeats the code it sits on: 3 of its 3 words (age, property, description) are already in \u0060userClass.property(\u0027age\u0027)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/__test__/type_builder.test.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3da7f75393542feabe2424022d616474e6f031163a94c98c318cd561a4bbc32"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Parse error if it\u0027s a string representation of JSON\u0022 repeats the code it sits on: 4 of its 5 words (parse, error, string, json) are already in \u0060const errorObj = typeof error === \u0027string\u0027 ? JSON.parse(error) : error;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/react/src/components/test-client/format-error.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4b215fff61705fe7062ea2658b0bc9b0a45620f40e83ab62fa7a3046d42195"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022State for file inputs\u0022 repeats the code it sits on: 3 of its 3 words (state, file, inputs) are already in \u0060const [fileInputs, setFileInputs] = useState\u003CRecord\u003Cstring, File | null\u003E\u003E({});\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/react/src/components/test-client/hooks/useFormState.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd67cb70d089ed4d4509cb928c7e6dc4ded80f59fbf47dc62f385e933c2049d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Reset image source types to defaults\u0022 repeats the code it sits on: 4 of its 5 words (image, source, types, defaults) are already in \u0060const defaultImageSourceTypes: Record\u003Cstring, ImageSourceType\u003E = {};\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/react/src/components/test-client/hooks/useFormState.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec9cab54e85e62b53250c036d7cacf80dd5aaee8f6fe3458bde1a60449e3274"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Use the query parameter for the selected example\u0022 repeats the code it sits on: 4 of its 5 words (use, query, selected, example) are already in \u0060const [selectedExample] = useQueryState(\u0027example\u0027, exampleParser);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/react/src/components/test-client/index.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a958934536b568a83f9f6f10175a167aa0efad5aecf0707e01d53cfcac04e48"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get the hook config for the selected example\u0022 repeats the code it sits on: 5 of its 5 words (get, hook, config, selected, example) are already in \u0060const hookConfig = getHookConfig(selectedExample as FunctionNames);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/react/src/components/test-client/index.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c80e43de4bdf884f7344956b4aca0b10652ab92cc7a2b406f1bc295ed7a448"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get the content for this section\u0022 repeats the code it sits on: 3 of its 3 words (get, content, section) are already in \u0060const content = getContentForSection();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/react/src/components/test-client/response-card.tsx"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"4961ecc62933e3f1e7ee7ba48a59c2bb83cdc32050844d935d54b8d8e5f9470e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check if this example exists in the hook config map\u0022 repeats the code it sits on: 5 of its 6 words (check, example, hook, config, map) are already in \u0060if (!hookConfigMap[exampleKey])\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/react/src/lib/store.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f4b50a9366d522257c1828af4efc3f8cdc307ad9023e3a3965f8a7d9157525"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Set the inner HTML of the container\u0022 repeats the code it sits on: 4 of its 4 words (set, inner, html, container) are already in \u0060container.innerHTML = html;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/react/src/lib/use-markdown.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"45519c25b430f76cb17b34ba459f3092511c469edbe97e7e59886a3ea75de230"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get final response\u0022 repeats the code it sits on: 3 of its 3 words (get, final, response) are already in \u0060const finalResponse = await stream.getFinalResponse();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/typescript/tests/collector.test.ts"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbc8e41797cca735db9ce94b5470429269c9515b6daffe6463fdaacd6019e68"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Add values to RenderTestEnum\u0022 repeats the code it sits on: 5 of its 5 words (add, values, render, test, enum) are already in \u0060tb.RenderTestEnum.addValue(\u0022MOTORCYCLE\u0022).alias(\u0022motorized two-wheeler\u0022);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/typescript/tests/dynamic-enum-request.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7fed31a1c6afdbb2e655d5c3403d4351c981e371f6f6760fbeafbf654c48ac"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get final response\u0022 repeats the code it sits on: 3 of its 3 words (get, final, response) are already in \u0060const final = await stream.getFinalResponse();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/typescript/tests/streaming-retry.test.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4f3f09a254a3668ed2281e413cb06a2aac7f7786b0e927b59f6a64dff28b1a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Find the first function in the active file\u0022 repeats the code it sits on: 4 of its 5 words (find, function, active, file) are already in \u0060const func = functions.find((f) =\u003E f.span?.filePath === activeFileName);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_components/ProjectView.tsx"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2f32e90c89d18f3d88cc3c99d1ab2ed785ff739c3d3e42d7be4ad047c0164a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Set the HTML content for the webview panel\u0022 repeats the code it sits on: 5 of its 5 words (set, html, content, webview, panel) are already in \u0060this._panel.webview.html = this._getWebviewContent(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/panels/WebviewPanelHost.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2af5a1a44c74d4fee5b33547c06df9f9656c1a181ba904cde35f11f7bc8d891"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Record failure for backoff\u0022 repeats the code it sits on: 3 of its 3 words (record, failure, backoff) are already in \u0060backoffManager.recordFailure(cliVersion.version, bamlOutputChannel);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/plugins/language-server-client/cli-downloader/index.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"b807c82738659785cb9e8862f8a9e3b126aa10dbfdb1eb71009352cd9592c184"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check if requested version matches bundled version\u0022 repeats the code it sits on: 4 of its 5 words (check, requested, version, bundled) are already in \u0060if (\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/plugins/language-server-client/cli-downloader/index.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"952da7a47bc995d38945530388a62ba3bc087786d1946e45ebc09be5f7d6dc40"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Download failed - fallback to bundled CLI\u0022 repeats the code it sits on: 4 of its 5 words (download, failed, bundled, cli) are already in \u0060console.log(\u0060Download failed for version ${requestedVersion}. Falling back to bundled CLI.\u0060);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/plugins/language-server-client/cli-downloader/index.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"63458c73a8ffc3b5ff69cd77bc545595eb7c8f0d32d674d1f9ab0858abf5d51c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get current BAML settings for initialization\u0022 repeats the code it sits on: 4 of its 5 words (get, current, baml, settings) are already in \u0060const currentBamlSettings = workspace.getConfiguration(\u0027baml\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/plugins/language-server-client/index.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4e250efdf94f5dc01b6f5ce2c18e709812d84b5d8fc1489f63b46a6424905f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022First select the function\u0022 repeats the code it sits on: 3 of its 3 words (first, select, function) are already in \u0060sdk.navigation.selectFunction(firstArg.functionName);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/baml_wasm_web/message-handlers.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"a261fe800f1dd6e4f6abdc40b68968ee61c5a5a4f872897c078026c16524a4be"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Initialize local API keys from user API keys\u0022 repeats the code it sits on: 4 of its 5 words (initialize, local, api, keys) are already in \u0060export const initializeLocalApiKeysAtom = atom(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/components/api-keys-dialog/atoms.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2af297400a31c5e2d5c5b6545f373bbfe876a28e8afa924c07a11b65f01eeb8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Computed atom for rendered API keys\u0022 repeats the code it sits on: 4 of its 5 words (atom, rendered, api, keys) are already in \u0060export const renderedApiKeysAtom = atom((get) =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/components/api-keys-dialog/atoms.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"2145caf35ba2f990b9c74ea8b657447117717c7c9e9d4a764b3aea383d3bb5f8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get current files from SDK\u0022 repeats the code it sits on: 4 of its 4 words (get, current, files, sdk) are already in \u0060const currentFiles = sdk.files.getCurrent();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/debug-panel/components/DebugPanel.tsx"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"009246607426fa97c2f0a754865dbd183ecb0af3f720f81859eef01a4e0b50f4"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Extended ReactFlow node that can have children\u0022 repeats the code it sits on: 4 of its 5 words (extended, react, flow, node) are already in \u0060type ReactFlowNodeExtended = ReactflowNodeWithData \u0026 {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/node/algorithms/elk-mermaid.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cc7d0e3bdaeb8ef4ee261a9120b7cadf0318eae8d1a549bcab63ed5345db33"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Set labels in ELK node\u0022 repeats the code it sits on: 4 of its 4 words (set, labels, elk, node) are already in \u0060elkNode.labels = nodeEntry.labels;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/node/algorithms/elk-mermaid.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2881a63fbed0b6be3ebde9f27ce44ed9fe5118353dd660ea935041163a79c81"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Defaults - horizontal layout\u0022 repeats the code it sits on: 3 of its 3 words (defaults, horizontal, layout) are already in \u0060const MERMAID_DEFAULTS = {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/node/index.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e303e424a7d02909f98fb5dfdba6b1c0905e75f6db26b1fb28b8dccac0fcd17e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Use Mermaid\u0027s ELK layout with defaults\u0022 repeats the code it sits on: 4 of its 5 words (mermaid, elk, layout, defaults) are already in \u0060const result = await layoutELKMermaid({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/node/index.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45da5df568a47369a4f08e5d69186c383a8468d6d762984840dd46220d27bfd"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: 6 comments in this file only repeat the code they sit on (lines 141, 156, 175, 186, 253, 382), for example \u0022Update env vars\u0022. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/__tests__/runtime-integration.test.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"a979dc2c938bfaae6ad0a830e425eef993ba7f99614580dd8daab45391798492"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Initialize with debug BAML files (same as debug mode)\u0022 repeats the code it sits on: 4 of its 5 words (initialize, debug, baml, files) are already in \u0060await sdk.initialize(DEBUG_BAML_FILES);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/__tests__/selection-integration.test.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3dd91f6e58bd9ab19c5ea8022c4d995dfff022278e1eace1834e2d54d010446"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Set to empty state\u0022 repeats the code it sits on: 3 of its 3 words (set, empty, state) are already in \u0060store.set(unifiedSelectionStateAtom, { mode: \u0027empty\u0027 });\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/__tests__/selection-integration.test.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5598f4e824fd3a4acbc9155f33ec072fd43ad00468e31134e73791b8b971f9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Add execution state to node data\u0022 repeats the code it sits on: 4 of its 5 words (execution, state, node, data) are already in \u0060const styledNode = {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/adapter.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c3d9aba9e9004f2429fa19dd1eef7307325f411ce6067ced3ec43bdbcb7fee"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create runtime with env vars and feature flags\u0022 repeats the code it sits on: 5 of its 6 words (runtime, env, vars, feature, flags) are already in \u0060wasmRuntime = wasmProject.runtime(envVars, featureFlags);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/runtime/BamlRuntime.ts"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e17313e5958d9b564a0f28ad02c5c7a9ee6731192e957a27d9ad0a065ea6fe8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check if it\u0027s a WasmDiagnosticError\u0022 repeats the code it sits on: 4 of its 4 words (check, wasm, diagnostic, error) are already in \u0060if (wasm.WasmDiagnosticError \u0026\u0026 e instanceof wasm.WasmDiagnosticError)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/runtime/BamlRuntime.ts"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b42d0c06cd157b8046b2e25b501041dcd3f0ce6aea934257bc7fcf18980d59a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Clear node states\u0022 repeats the code it sits on: 3 of its 3 words (clear, node, states) are already in \u0060this.storage.clearAllNodeStates();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/sdk.ts"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"6285590e648b50767534a5f2572953294ab904e51cc43bcc6017d5ae19555cf0"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Send telemetry about the panic\u0022 repeats the code it sits on: 3 of its 3 words (send, telemetry, panic) are already in \u0060vscode.sendTelemetry({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/atoms.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b738f982383bb36fa5afbc57794a0e6713eea18a065ec23b359b2ae076cb687"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Update cursor position via SDK navigation\u0022 repeats the code it sits on: 4 of its 5 words (update, cursor, sdk, navigation) are already in \u0060sdk.navigation.updateCursor({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/codemirror-panel/code-mirror-viewer.tsx"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa3ef09da2cd77c80618d640272342ebe68a2894ffcfe7f519d72f31ad9a4d3"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Feature flags atom for standalone playground\u0022 repeats the code it sits on: 4 of its 5 words (feature, flags, atom, standalone) are already in \u0060export const standaloneFeatureFlagsAtom = atomWithStorage\u003Cstring[]\u003E(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/feature-flags.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81ff9f8ebf2c5adbda425ac4f2f3367aa47cec0de9fa18aadeb155bd402efb3"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check if we\u0027re in a workflow context (workflow mode)\u0022 repeats the code it sits on: 4 of its 5 words (check, workflow, context, mode) are already in \u0060const isWorkflowContext = !selectedFn \u0026\u0026 unifiedSelection.mode === \u0027workflow\u0027;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/preview-toolbar.tsx"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ef885655db0739bd639e29a4f6b22dc144d87ed8afc1895bafcebbe07e6b4f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get the global offset for this component\u0027s matches\u0022 repeats the code it sits on: 5 of its 5 words (get, global, offset, component, matches) are already in \u0060const globalOffset = matchOffsets.get(componentId) ?? 0;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/prompt-preview-curl.tsx"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a2349df592ef57424b1249eb394d2cbb1a95929ef45a9ee30509c694ccf798"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get the global offset for this component\u0027s matches\u0022 repeats the code it sits on: 5 of its 5 words (get, global, offset, component, matches) are already in \u0060const globalOffset = matchOffsets.get(componentId) ?? 0;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/render-text.tsx"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a65bf5780e8235f2df13e4db61fc6b874e52c9a07c4d8f8a6e07dfba9aac6ef"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Register a custom error renderer\u0022 repeats the code it sits on: 4 of its 4 words (register, custom, error, renderer) are already in \u0060export const registerErrorRenderer = (renderer: CustomErrorRenderer) =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/components/EnhancedErrorRenderer.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66e99c2e14fd825532a6aaf1387febaa9f142994de8db16975ba7ad3800c56b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022WASM panic error renderer\u0022 repeats the code it sits on: 4 of its 4 words (wasm, panic, error, renderer) are already in \u0060const WasmPanicErrorRenderer: CustomErrorRenderer = {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/components/EnhancedErrorRenderer.tsx"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a4d663321b4c46854075a123a7b0429a36b23d6df4195d019623b726f344e6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Initialize default renderers\u0022 repeats the code it sits on: 3 of its 3 words (initialize, default, renderers) are already in \u0060initializeDefaultRenderers();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/components/EnhancedErrorRenderer.tsx"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c204ed696090fd21b5d02e69a32fdf7fc3c4080a4b190e3af9c0ab28ee8f1c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check if any test is running\u0022 repeats the code it sits on: 3 of its 3 words (check, test, running) are already in \u0060const hasRunning = tests.some((test) =\u003E test.response.status === \u0027running\u0027)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/components/TestMenu.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb68c97dead97a303f0cc49ad591bdbb39dbf377473ba6bfc32a03fca9787da3"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Send telemetry about the panic\u0022 repeats the code it sits on: 3 of its 3 words (send, telemetry, panic) are already in \u0060vscode.sendTelemetry({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/test-runner.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6b04ad50af855bac17c35a4b5f9a7098c18266f6b4f5fb9b4b96092d052c33"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Cancel tests via SDK\u0022 repeats the code it sits on: 3 of its 3 words (cancel, tests, sdk) are already in \u0060sdk.tests.cancel()\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/test-runner.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d27d1402fa3ab668195ddb181c53f1561050c66e565c8ca76d0a4c883456f4"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create and return blob URL\u0022 repeats the code it sits on: 4 of its 4 words (create, return, blob, url) are already in \u0060return URL.createObjectURL(blob);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"724beca53d97d0a07486e5411cc7019bdabffc7551f57b314b5aefe16d68124a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Copy status state\u0022 repeats the code it sits on: 3 of its 3 words (copy, status, state) are already in \u0060const [copyStatus, setCopyStatus] = useState\u003C\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"71dcae091b4551b122fe13f9150e988cf00cc34baef546d8e0211aa55663a794"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check if it\u0027s a direct video file\u0022 repeats the code it sits on: 4 of its 4 words (check, direct, video, file) are already in \u0060if (isDirectVideoFile(url))\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"3000c130bfff1b261300ecd2f038a695109149dce6ff9eb64a4c7492c9953805"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Check if any of this function\u0027s tests are running\u0022 repeats the code it sits on: 4 of its 4 words (check, function, tests, running) are already in \u0060const isFunctionRunning = currentRun?.tests.some(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/index.tsx"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"dece58c0a163c9f82681768b39800b7280453f34b9af7693aac9cde8124b57e6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022This sets the cookie to keep the sidebar state.\u0022 repeats the code it sits on: 4 of its 5 words (sets, cookie, sidebar, state) are already in \u0060document.cookie = \u0060${SIDEBAR_COOKIE_NAME}=${openState}; path=/; max-age=${SIDEBAR_COOKIE_MAX_AGE}\u0060\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/sidebar.tsx"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa9da2b50955ce8555fe3625a11f4c39db691194ef2393ae0564e23fb0b4283"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Update status to analyzing\u0022 repeats the code it sits on: 3 of its 3 words (update, status, analyzing) are already in \u0060await ctx.runMutation(internal.analysisJobs.updateStatus, {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/analysisJobsNode.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7af66ccb7c4dd66bfe12d7fda33c24b9303b498501d701d9c86bacff3eae801"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get analysis context\u0022 repeats the code it sits on: 3 of its 3 words (get, analysis, context) are already in \u0060const context = await ctx.runQuery(internal.analysisJobs.getAnalysisContext, {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/analysisJobsNode.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"104a03278266de69db9e0b4e3d9c39a9a6aa84617a3f452746bfcb9d16472cb1"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Update job with result\u0022 repeats the code it sits on: 3 of its 3 words (update, job, result) are already in \u0060await ctx.runMutation(internal.analysisJobs.updateStatus, {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/analysisJobsNode.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab7f4d1703f45ac5de14f45affd55f8f7c8bcd45aa7fb395c529e05818948c0"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Update job with error\u0022 repeats the code it sits on: 3 of its 3 words (update, job, error) are already in \u0060await ctx.runMutation(internal.analysisJobs.updateStatus, {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/analysisJobsNode.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"73775e8ed20e8ead0f61d675501a1aa54a6dccfbbbdb6443d2ff87e960c81492"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get pages, comments, decisions, issues, versions, shepherds, and implementers\u0022 repeats the code it sits on: 7 of its 8 words (pages, comments, decisions, issues, versions, shepherds, implementers) are already in \u0060const [pages, comments, decisions, issues, versions, shepherds, implementers] =\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c5199c08752e032fbe1277a536761f0e7c3fcd8012b39292306f549f74274b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Internal query to get all versions for a BEP\u0022 repeats the code it sits on: 5 of its 5 words (internal, query, get, versions, bep) are already in \u0060export const getVersionsByBep = internalQuery({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f34ebe3d88d10d104d91284d2277618df51054094f34a3b6d4b3ea5ae397807"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Notify Slack about the new version\u0022 repeats the code it sits on: 4 of its 4 words (notify, slack, new, version) are already in \u0060await ctx.scheduler.runAfter(0, internal.slack.notifyBepVersionCreated, {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b30df264898dcb331344c462aa7e7e01fb7676fbd57e3f92c372f729164e885"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create a map of existing pages by slug\u0022 repeats the code it sits on: 5 of its 5 words (create, map, existing, pages, slug) are already in \u0060const existingPagesBySlug = new Map(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d391706fb6bd3cffed135282da4967c03f6ea505c48ed20896b7277df51cbd0"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Enrich decisions with participant names\u0022 repeats the code it sits on: 4 of its 4 words (enrich, decisions, participant, names) are already in \u0060const enrichedDecisions = decisions.map((decision) =\u003E ({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/export.ts"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2387d6f9d812e2eab09340412ce24c97b1d503fb80a1224a0ba23bdfa82c15"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Enrich issues with user names\u0022 repeats the code it sits on: 4 of its 4 words (enrich, issues, user, names) are already in \u0060const enrichedIssues = issues.map((issue) =\u003E ({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/export.ts"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ead95ede5cfb5ade7f201cf7ebc2cd138585d3ceabee6160bf31264cb2cc6f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Enrich versions with editor names\u0022 repeats the code it sits on: 4 of its 4 words (enrich, versions, editor, names) are already in \u0060const enrichedVersions = versions.map((version) =\u003E ({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/export.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60cfc6ee99f3a276463950a750e34bbd05fca31297568e4f20fe5ee6508c2c7"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Enrich summaries with reviewer names\u0022 repeats the code it sits on: 4 of its 4 words (enrich, summaries, reviewer, names) are already in \u0060const enrichedSummaries = summaries.map((summary) =\u003E ({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/export.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f6930fa2afc167214244529f10d9fd22ff2d09aca3a575026c30ef07536d29"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Internal mutation to link Slack user ID\u0022 repeats the code it sits on: 6 of its 6 words (internal, mutation, link, slack, user, id) are already in \u0060export const linkSlackUserId = internalMutation({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/users.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"286e3839e85cfee6080a98c5548b42666fa9783e0ce9867f73c0244fb4982e6c"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Display names for languages\u0022 repeats the code it sits on: 3 of its 3 words (display, names, languages) are already in \u0060const languageDisplayNames: Record\u003Cstring, string\u003E = {\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/shiki-code-block.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f9320a7f3c0595638bd07c1df05cedcb0ecf7c0cfbd60fdcfbb96000db4af0"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022NEW-BEP instructions\u0022 repeats the code it sits on: 3 of its 3 words (new, bep, instructions) are already in \u0060files.push({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/export-all-utils.ts"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"b360c82021f6ef7e114e73a1d3e21b23c9ded25c5800d00c2f12e3b8ba33bb1a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Main content file (README.md)\u0022 repeats the code it sits on: 4 of its 5 words (content, file, readme, md) are already in \u0060files.push({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/export-all-utils.ts"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca29fbecccb9cb426e465c7d0c5971197a8232c944e424d6587adae107f6361e"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Watch lessons folder\u0022 repeats the code it sits on: 3 of its 3 words (watch, lessons, folder) are already in \u0060fs.watch(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lessons/watcher.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20b099d3f61766da8e94da43a2c837ebab81deef22c73032c351213b94e35da"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get ffmpeg options\u0022 repeats the code it sits on: 3 of its 3 words (get, ffmpeg, options) are already in \u0060const ffmpegOptions = await getFfmpegOptions();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/scripts/convert-videos.ts"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7e261dea004b3a5ebf76a2f331bbdd77d0561adb8f52222e95a52ca9c4f4bc"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Find video files\u0022 repeats the code it sits on: 3 of its 3 words (find, video, files) are already in \u0060const videoFiles = await findVideoFiles(argv.dir);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/scripts/convert-videos.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa0d1fb9d266b82853bb5fe05ea24cdce5ff2f8aaf880bae8538bf39ffd0fe6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Handle existing files\u0022 repeats the code it sits on: 3 of its 3 words (handle, existing, files) are already in \u0060filesToConvert = await handleExistingFiles(filesToConvert);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/scripts/convert-videos.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"d844b55e334afe4cc6f3eec0cf7509da09df5fa68dded0974bec32515bcad9e2"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Process files in batches\u0022 repeats the code it sits on: 3 of its 3 words (process, files, batches) are already in \u0060await processBatch(filesToConvert, ffmpegOptions, batchSize);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/scripts/convert-videos.ts"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafcfbb9ee5bbc69bd0ceabc2e341fa87181d2d342338babeeea95bc962c554f"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7c1a93c25baa43f7ae3e8890b21a4b4d8d93aef55e20bef83b8e9b08854b352d"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7441e2b965ed785f9e7db98de3015b6c096efac636e29bb4d61cceef0386df0f"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc7c3fc570a9688b52d6065ac082b204e7e87a0697b0e4f4192d98674f5e1b12"},"properties":{"commitSha":"f749f2b19b247de2f050beccd1fe8e50b7625757"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d9c070d3b67d70dbdb665981132ff2cb81722666656e00d7dc2fd05268656a1d"},"properties":{"commitSha":"f749f2b19b247de2f050beccd1fe8e50b7625757"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"44d71faa2f8dcf9c2b0db7dc80e6012e70ff18cd209514e76231f5d7cc535176"},"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":"86d1e53c6c9df2f28548d2f9fd131f90d890007487958d72257d58664abe0f0c"},"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":"eda211cd7b78a8f673aef1174f03aacdc4bb68d328a0f54d1a902e805a206b48"},"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":"ed30eec8d6008ac144b108837b6a118a3ef3b5c425a00c62203f0ff89e142661"},"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":"a47699642d9e51c5e0a26149e43fc831be0cd89faae70ed0c9e5f9cb5dec3db2"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"0fe80e51469e5c26c741407288cc5e13a130ef71aa1e35a84851d3c326939549"},"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":"a11330039b68a57fa2af44621182381069f33f2fe421e04b874904aa3af133d8"},"taxa":[{"id":"CWE-78","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":"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":"129949ebe159fd831635d7907e5baf686c75a720eebf384f5775d35b6dcdf5b3"},"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":"aaeb17a291c183f3ceb735183c9eb67efe11042a34fe125e79caeef652f82e9a"},"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":"06a30bb728baa2dc70d6f180da0203b96cabca7d2e44b809dd744525842a573f"},"taxa":[{"id":"CWE-78","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":"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":"3331d6de71e9c14c964e6a7de58de4ef306daac7363552879bbcb6060bfc063d"},"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":"bf7997e4468fceacab92d4921dd423c1b156f8855955622619f4b3ba255139ba"},"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":"d45ec846c3dacd01c5ce943015ec0acbb349c17484eef344d07dff5bdaeb245c"},"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":"7a47cfb987b0af1670acc1d6ce9ccb3a27a9d9564099343112bf4f8e92b07245"},"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":"03678d0a2ac30ffca3109f6aa61ffdc6347823ff1b1363431e26cbf3d210b329"},"taxa":[{"id":"CWE-78","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":"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":"8aa45899ebfc0a8bfaf584d6b9d69808441d99b4f7459b53dc43952966ec3f57"},"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":"af3016dde55dda9efaa02d5529707ea6598a7278656af6708d0cf15958636324"},"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":"7af2c34dc363005aaefb4803196842109276e3c66cdefb55dd8682d09cd999d9"},"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":"5e86054038c5d53f0fd63885586b054d4f9cbd6b0b4b66a531e23834cc749cd3"},"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":"6c2cae61b4067169556d55a569437f502a45b183b66b252555c1cdd41f431b1c"},"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":"c93fe594c209cd3a301ff27103dfad5ff7d13e5a29ebdec64b739ff902ba54f9"},"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":"6fbef22e96e665a5f7537a14d3e2ff7f8bbf365e806666ec7b5ce8796eede474"},"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":"85c7fbae85657db3e1103b1275d884711a2cff859f0aa688b4c7d823d6eb0f48"},"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":"41ee471ba87e7456342e5ce8417f849235e16e879e3659a585f60a089688a7c0"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"c488203be813ec86edeea30ea766f82cb3ce5af6ea465e1d882ff12bb923f36d"},"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":"75a25799ff806ca27dc7f5d5c45f42e20b732a2d40a5ed2100331a1f7ad7c789"},"taxa":[{"id":"CWE-78","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":"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":"8b237d8fb1403595edbf4efac345ca63452efd7ddd9c7a873d2099098a576a2f"},"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":"aeead56b6596b1fba3f3d22cb3f42cc425c7fa0c9b5880610fb524043df7dc25"},"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":"18b19f247152b5c87af5bf97aaa161568436f75019f31efd50a5da36ae6eea4e"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"9ce6b4e0e6437fb2464d2c90909e73e6b96d33b30875f14e339f913182711891"},"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":"80301495d4fe4f05662d0ae98591539030ee77afdb695a3d8dbabdd651e9930e"},"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":"1f3296644789eafaf58162db65992a054bce802e436fa20ddcd2170b14f89c48"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"fe4aa0a45a1e8a091a27372a6448d4995698023eea3cff9aba656919c597ceca"},"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":"97e61f19f1c9af055fcd1c6474efa6ba33a368c046791e802997988965a9c49b"},"taxa":[{"id":"CWE-78","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":"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":"0c3683245354f88345800f1ccf08a030182ff7cd2ad10bfbc8fc871a0748daa5"},"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":"ea4c83df2a22b37f5512eb6db61e00a780ba6c920c2e3f97409792a1561bec4b"},"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":"b0beab9ea743b4433443364e98e5bcf1d968a85f2597de129edafae531f52cfe"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"f282c1ce697168f57f792f5cb4152331823e3884cda9880970af45b1662b3588"},"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":"850e19d3ac6d67c0bb38e9657ba7febe9ca76fbe4189af35c3256ba2cda690bb"},"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":"671165101965daf589954762d13008329014ba96e8c346342b1bdea7fb588aaa"},"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":"840eef1a51b8c825793fb29da98a76614e6dbf7a8c0e7b647acb93fa8eb69d29"},"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":"27bb2a80a1d0f25cf0bf5d5551c4dbd084cc94a8b009c6dcf7449400d8aa5c01"},"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":"f55b30362debc974414d506394591ff56fe847571ab8fc6b1de256c067688b28"},"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":"fb115ae802c63da79c2aba93d12f61ebf6008638c845d30b5bb7014d41f36602"},"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":"cebb9e94e5caa07bbe44d2cbbb6475f9cb2a2b9d2806e1cbec7c640b0b2c4445"},"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":"e716648314c445fcf81965a7abd617b400cc9ea18aab39538ee00ec3a713596e"},"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":"dd5361035b680ed14c0e954e89dcd17ec34890c430389b128f9e7d009c278e08"},"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":"efd8ac20bed55f0a396ac6e35dd2bb9789f2e9fea56a668ec034d0e4a6e9ec45"},"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":"7f8fffb7aae3a987898bf1a02ca2b3d058266a8833273fb48658c38be8d3c33e"},"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":"611d715d16f8a2634275fadce039b0f8417d62d2a32f5f3a1cac7c9b82b9764f"},"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":"5d12489eb49eb5c14b34d7a52f01cfa3cdeec18ff9a4bce9abdd9fdbdc1cfca9"},"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":"53f82ff9b565a80b670c74a72409193f99e144b783a4a70591b0c12b8c78b647"},"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":"b531e37d775628d8b6565722f8ff027f92090adc7521c0782d5db6e1182c27e9"},"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":"635cc12861806bedd166efcd1a08c9b01996c3ede22107e2ac598ca367f6fb55"},"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":"71cb1f4b2a0c97539ba24899b8429feb2b894073237de92005688228ea589eac"},"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":"9df57a5678d3ec964072cab28b9383c4cfbae1c84311471b61479d8b1d563b39"},"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":"f4b6145b9aab9986248cb0b36844226aae1983c3ab1f706c9d3397739d399c81"},"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":"9e2e0f9d896e94b384ed70497fd0853f327a22f75f7d74020f36ca3965ab8e33"},"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":"5f2ba5afda90d2982fa658466e31129ccbee50353a5f25b706a33e714ff5907b"},"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":"adc735537813cc2a2351ef757cf47521979fb4a5dc7c7c119ab4173a1693d30a"},"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":"d5803223c0983bf09cab74c403866ff774a884088c6da44c5572b63785bff6cb"},"taxa":[{"id":"CWE-78","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":"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":"e16873bb76fb4a9ecb61caf6c28595f365b5668ae5c9f244652344459f137f1b"},"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":"2adeea586285bcc7ea2b9267008c1b19789b8669cdcdf69ce1a5597092e4446c"},"taxa":[{"id":"CWE-78","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":"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":"2b7fb6b1eea1b4e8e8322ad08a3e43347e30df1a4db5a324da974595ddbc279e"},"taxa":[{"id":"CWE-78","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":"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":"0a7fa24db865aefde1d87d2d28db17371ca76f951e277721cc35e638ccb181da"},"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":"3e683453b3da188389a289e9b65df78af53a734458c252b2a5c435bd2d68bcfa"},"taxa":[{"id":"CWE-78","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":"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":"fb5b0e79e09ce80a2ba83816e14404ae11dd59e79d29967a6bd233cee663dccc"},"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":"35c66cb02a9646263376776766983df88cd1bb5bde79319f8ac1be647601fb07"},"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":"2be9586ee9ffe69e9c29ea99601b77a1ea662fac6b712269302ec23311b95b9c"},"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":"fc59f592530df77db85397136ea833b09a60bee558caba95ba689f71df3e2a62"},"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":"57da78838d4d8332d15c202011fd7796cfea81e023a97213a1821a93d2c12f6d"},"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":"c4428821f114bc215c74823046b1ce54d7a5e66831ac7a68fb4b4bc267326a2f"},"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":"204dca45f02a2645700b81e8e932e517c2b9b122806253c9aacce7a3c447b3da"},"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":"309e214486f132910b0b7dd7f40cf373b6c47a6b1cbb6284f43add2cbabd2d2a"},"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":"0b6ce075d0def8cf25df721af41a531962483aeba4ea650096f72ba7d8569293"},"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":"8ff958d5b0d97c496a833b8f1580421555887904193bcb31266afdad43bb4a39"},"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":"e98b5f6349efac4286f6ed0e7c365564ac8c6f4e0ebbe73eb9fcf46da936b6dc"},"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":"835e64adefcd12568e092fa180a6bc1bbd16462badf025222145c73a4a7b0f27"},"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":"13a4470bd80330e4eef380e3fac9a10a1abb76cda194e8940b81c65ab773e5e4"},"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":"a2087a3ede986ee77f9839b7a3d8f72224fd4da15b086590035df83073c3bda1"},"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":"e196fc5c7237ce95fcb152badb049672898a5c19dc9063b6b0c06a1e51f98d32"},"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":"dd2f2a9548a07f6843d60ee2536bba3d8962d4fe51df8ee296d73e6d43f70cd2"},"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":"a2b450082c9c947877018ef084419250c202503f8bc92f26ed93bd7109f1c43b"},"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":"e3dd7c248297d7708d0fbdcb6b6888e3bfc1dd3259e9ecc6c8d0b0164ee52b49"},"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":"9073488a5d9896776818e4dcb5d2354cd0aa866e98af9c4cd3690b81e742080e"},"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":"6942f73ab538fce59e327f21e3bf80109d9f136af51a37971231e6143a5c490f"},"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":"cd0d208520c2bce06281ee5768f68b583c0e0d2a5788834be9d87746aa6dd3a5"},"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":"e4e1e5fe831eb61fb977f31b4ebf6ed795c82c41105923b699fac88943e287f2"},"taxa":[{"id":"CWE-78","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":"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":"5f2c6b246a17338f1ae0ab3d89e2b38eeac49883957b5dfa84ffff1ae4a9d408"},"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":"acfe4f703643c4a515b11daebd15d41629f6460745bee20991c41365d90f0438"},"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":"717b5bb1330386b1c8a1448412d2d009b074b96c107db927328e84e83e3ac45f"},"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":"6c555ff91ce48ef77a02f95baacd05326f75d7908e39184a614d124927aa82a4"},"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":"7c090d613685e1686c0630483c5813845968a6355569e0834929b147ff970a61"},"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":"6c0820e8ddbd123896c401f6fe8353e53a29522287aefc45dedbb9c260f94116"},"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":"741c84d00252f27b9fece69d0a848b47838a9868922963be970636c418fd666d"},"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":"2d05b1b25e068c9b894ee216f16a55780933b31770ddad6e9dbe990459fdcb97"},"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":"082ebc78f83d57413fc0badd095172e9e9c91dc75f47c4e1489c334d1935e116"},"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":"fea556225f82bc386840078237fedfa89c5dbc67bbff71aa8195468f11a5757f"},"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":"5dab2f3e4fafbd71ac73fcbe8d2f4ea074178627c88163c6324b1419587cd0b6"},"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":"78f88677db0dff3c27cd88c665597270dfc222a32dcaa3969d8c087726e43e66"},"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":"900408daf24f952f11a26333e74c539790bcf368c7e639cd927daa7838a5cdf9"},"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":"905bdcbb6b482e7ac749607fc586fbcd25ef8c375c1c4d729112c63672502a10"},"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":"3b417d5d7426195036e5c5772f67eed06dfd0f974004111ba31a1b68ab6f245c"},"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":"5bd004cf4c53ed1fcedaec3eadba35dcd3e02c295e6e5b20681e6737dd2fce96"},"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":"6b840d8e8cb214ad0bec433c76af19952e9e8c46065dce905596607563a3838a"},"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":"4e505dca225799d3468afd9970a4f0cd8b106fe96554295e9b62273334639d82"},"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":"8102f4643328ad1e8bee5c7ce16ad6e5e9114f26b120073eb14d92b71be13059"},"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":"69b93f25c9487a786dfcd9803ea14cf5d72294f6d0acdbd529c1a3506cd395e5"},"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":"00c6d0697285634e39e79ed0462867cfc72f487cdf7932f5dfb7016d6ce997cb"},"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":"c3bb2146ed80f92133558e7cf1bad40d68458293a773d8fd7719fcc25e908216"},"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":"7375ee5ab852fb10b8ebf2b8f2e2b2e9682b7ba92d50adf425e5afe19b725d52"},"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":"a8c9346fe1a043de26a3712d2a242e25ab009f575d1601a96ba6b788a4ddc421"},"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":"5911efd2a151587a71f2d7ab3a68df9f052ffbd651d75923c3b5687b30998d43"},"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":"594013da2d1060687e3ce03c8af43bd0ef6bcbab338138cfd5ffe077d568190f"},"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":"b7cd776cb12981910ff83115a26e900060a816360bdaa87d41cb828524bbfe16"},"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":"53fac933ba36ceeba3f687ad8e32d9d57659186cc8a242c0a6c569785b1c7ddb"},"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":"4181f4925f2b4d2ef860008242a5bd37fdbe6bea48c67de975e209e9b80f84b9"},"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":"ee6e49199c9ff297cbbd08ab2158e017b6309ddea2073334fcaf236cd4fa6a14"},"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":"446fe3d28577e6fc9e9959fd63a7142cbe2b5bd35f5f1a713ac13abd3666e017"},"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":"7eae79442b7559e5b76ad670aad96ecae185c56f76c18eed16b297630990296a"},"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":"9c47264f450894ecc217b4a31962a2e0de1c1e352a647976afb6ae570c699e63"},"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":"ce3276a2c8b6de6a82b2055b3609f37008816eb25efc648520afadf9c6c97cf6"},"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":"2c154d2d2de4228a408d3340e67ca4fd68b4f962c0dd3fd8a57fea7780cb21c9"},"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":"06f1383f5a2bc7d8260d5d6ab6871918507445e5f05175ca02f148539f986c60"},"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":"2f2961cd7aa4e8d5c520a16577b78df5b1406beaa9a58e31ceabb209ff174b87"},"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":"f7bf5e2004efd73fed564e36b6f06900a22f112c89abd6434e11bad6fe1a2670"},"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":"659a741272298d71e7d7b69f00c218cd5b73371bfde87d98dac94f86f97eb11d"},"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":"00522520e4da736daa7ca787488cbd2c1f2692de3f9bfd767ba2d5238cdf6ebd"},"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":"a68e888c71ffc59ca35262743151d2eed4d3a3f55381334f9eed1a5c6e55558c"},"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":"a5f938cdc7874417f5e4b1b723a3c8fddca11291158160ec3c81ed3df43292d3"},"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":"ebd5ff8f577bb72f13edc446841e0f0d9d479424ad1649e8fb031d9aa248aef2"},"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":"802036c466343bcde98468744e66178ff4ee3e11942a616247a42e87d635e6b0"},"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":"bbac15b8157663aa8f5250c4bb3638c27bb272940c10db57ce1415f7e5e19f75"},"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":"6d39c46a1b751b94318c7f38b990c75688e83cef204f06b5039e3170b457718e"},"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":"352fbf8904dc8a8fdac9d667e4397a8114dba9adf47112183488b629a083ccb2"},"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":"f8215072bc48668ba91ff2fb714e727ed1a110f4261068bee823dc15dcff392a"},"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":"73c2e0333e81ea027163fa800d790ec145de8bbf11f1d1dc693b26e69960210b"},"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":"8b65d9e42395e694d5fb8c42ccebbede1dcee7aae9605f1219b8a9b73df0a8d9"},"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":"201693a9d040495f58803f7dffd5c92a0f113dc2729771fff1c3e21555bf1401"},"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":"146ced6698ae01dde2a703be6c87e8e3805a62499c830990aca55d4be5c22408"},"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":"50bf0d7f41e6563553cfacb37832fd75574ae25a2cb28d5d0a3efddf8b5c3ffc"},"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":"fb17b69ec1007f3eb89be001fe1db8b9ff56d158ec30d9013887449d05d1f7a9"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"36b9064dd8e0a05a20381a9955cbd4c23ffc5e3f6d6c891a46c1970b1cc225dc"},"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":"444a327a2477129640b10310bfe1610c8ef713735712e336d255759b5af39a27"},"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":"05d88250e8965add8299ddd138e967377e3ef873afa9977b78510c186b7edcf2"},"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":"a069375068131e3052af94823e2090010a43c5504441c505d3ee83cf89d97a77"},"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":"073893b3bc0fa510ec095a3c0a89beb31b9d7123b5c4647efdf01bc8a2b59345"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"96fd9c229bf41db5f5532d8ca53722806751a485a7332f1c91786aeddc14ab1e"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"aaf127e2c1b9ed8074d3ab2d2342f97734d66a5bb36d39b4c67eb2406bf8b022"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"64f872994cb841956f02d2eb2d8d11c192a93dc7e856fa2da116006eae3adc62"},"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":"90af386039e632e8674495ee182ef4367aafb713614cd0563f4a677788f693ac"},"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":"920d4eca847bb88816dda0c1fe6353f4b08fe58290ff52079506a434fb709c5e"},"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":"462d39540b2716ff2fa9da3a93dddc28e0202ab7cbd47190bdbcdc7105f7f6f7"},"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":"a1e086ec6371086c98424268c1b44193b84a763b9202e491b4ad1b0e2aeff16d"},"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":"2741da4214825ea77dd5f6202cfad891215a6377e0bdefe431b25baa6fd7667f"},"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":"9d6908eec14208e7cf883a754a72f328321ba5d9665f8f32b0c30912cd4500a3"},"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":"5bf3c57647a421fd0ee76fc86b3fcf861fd4656d64cd58aa86d7f963fd046519"},"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":"78fbe589a117e5ad75431dbc9f2c88171edbfe0905af01f6fb0e6b3bd8a928e7"},"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":"f051576303f275804cbe8400875bd11c3192a68aa843f15c2af206eb281027b3"},"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":"714c0a82ebc32f7a6e9a99d91c2a7aa7eda06c5484689fbda8f7fc9677cd322c"},"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":"b698769bf2f2d03d9fc720aed45edcf9b1f4ab3c3fa8ca5a55140e78a4605cca"},"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":"44fff4b34c57eb8ea5049cefd9461e4b23d70e28480ee957c6d88c1184d75799"},"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":"7a63414760ad2624f3f89f0db1365098ec1f204023a3360432e4ed601a75a97e"},"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":"ff49c2883de43ab552958587733ecc124a12efeae691a37b4f55fd7ce898fbfa"},"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":"da42ab86fa5f3d1f1650d04fd29153fb105c3c33e722df063cab873acc6bec61"},"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":"775241d2e1559eaacc2b927908afa5725feb3dfec50371aadc5062b2404d49a6"},"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":"086ed6e6b204a12c91bf633b7eb8cde8bb17b9eb029889e51b182bd82686d42c"},"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":"b3499402c56669b19d0bf36b7c576e6af57c730913a66ddcb946cf88d4a3271b"},"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":"d1bc864230eedfc96d8f0ac755b6cd6b3b2495f7ca581151fe2814090a07c81b"},"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":"d6138814091dfb7e8fe6b34aa2150c28711ee18ac47dc425dae7964786ae1d7e"},"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":"782bf41a640aa0596a01ef4a48326a5dd8dc474509d9fb0ac161d376d1865fda"},"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":"6743db40caf2580d06c604533f01ebec0eb66f8b9bd95d23b90b9d81e146ecb8"},"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":"bd4c6a6a95069ccdb03aa0414db4e8fa64707a0a5a3b81c852a88062ee140dce"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"90939e5131a83fedfa9e687ffd028579f653c05ecafa0b5d2ba0819848edc676"},"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":"5714bd3778e0857bfb449349895f6b0f6823503d4e954d945a5908b43dad79e7"},"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":"f0b28dee7f42a42b4f759b10d07659d58d59828c3d57159c5d4d51432ac20b30"},"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":"abe980ce8dcaffde7c38db576cfce645046267fb5ccddbb83ec8fa65f9a49a51"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"13a63fb9cc53a992ed94dacfcb0f22ce2b61aa4effe0abecf42545790caeda87"},"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":"21345684810fe5e99d296e1ad5e602a793e6472bd809b602d34dcf6043a3d9d9"},"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":"a0496c488ed86c3bddd5f1daf2613cc02248a48e9efb1558f1cdd632b447dc88"},"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":"78bb578ee8d0dd490d2bd47d5d9945f755c5b836f31694ddd65f122117414916"},"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":"8e507d23030ee8bc678df9f3f40a10e0e06de1786131c53a1d4c434cee393170"},"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":"5bd003f7da1b4618d7d3c329a9528a257d284e3d3859bbd9875f84f04f3c6994"},"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"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"d475a0161da52bc0c98db4ac12d305f0fb28d89ef75978e19a301dc828db6930"},"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":"e43164e71262a7ce1c5eb59e1697d85854173fa38d3f00fbdabde4e37b6d945b"},"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":"3b87e093ea67c0ee37b41d708c0d4e4cf80ef943235ab6527da184989e6de23a"},"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":"cb99c57ff4f394978f4c586fb1cf9e44031ea860b96c462cbe9d2291b6c92f1d"},"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":"3a99a867f130290ed1b9cf0375b849684bb0f47e628984b44c3849e22a3f9112"},"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":"a7a27785c926b87dbc6224d632817a641e84c66e04d819d39e1615523cd7457b"},"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":"e3dbc78e776d947cf2d4ede3d007958c77e2856a4cac8af35734f2316bfc670a"},"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":"a19eb9b707a20054bc23a473f9a84b13bececc432919a9ecf0a6c822f8bf49bf"},"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":"912a90006e5d3971d2b994c61a514345e4b0cbdb55f3b8041e33f6f306de3532"},"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":"b764a89b1e568ec5aabe11f3770e342439dcbd081c79a68d8f561af8e50d26a7"},"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":"9714c19d4e10445e507a22a9f6adb56d87a2bfedb1e1144adcf5311e42b61201"},"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":"a9ccbd31ec9f07553ea0c09a3cfd2518d92ad80d3be8e35c780702cb07217eb2"},"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":"ea56607b57e8cdd1b7dd04e246ff37e36d3dc66ad8979399ad61b5d9ce040ded"},"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":"9acf7fda0e771434c6dec44a690c688e7772153c7adc90daa9510e1ae2960814"},"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":"f7c7d278f9a1d5d3d97ef3463f9cadec511b09f5a1ee90655717c613aa487736"},"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":"8590aacfc8e470615028caa12479fca8531a0c39fefdf0a39a3a9a0ba54664e8"},"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":"bc0051f89369bcddd3648ef72bdc3aca679b79634ca41e768e981273e6abc1af"},"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":"2e7da5168b7613d0cbb3bed65e205717dc92c4984d40a5326d73627809e7619c"},"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":"38b11c2e7472a55ada233cf049f4f9cbb6ce41a9077b1c2ec9afed633dde2090"},"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":"31608a30df8df49889f6fc9ef4d39221d0ccac7fc1b68bc7fa4a773b0914a761"},"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":"18ba8dc073f8fde30063f32d8324a772efaf21c84c43611dfa78f15486e07bbd"},"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":"a66de42aee294b275babaa6a8a1ec6376c25417a66a5a1a7a873fddf07452a79"},"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":"450456614b14f9aac339d6a494dd6e88f1ed7aecc18c6d3846c3dd2d0979581c"},"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":"eb7315bc143c97a031ea1c510d269b6765f3342909807c180581842d066ad613"},"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":"a8b7ca8d1978573873b89a8104936a004e85ae7ba657ecb36c1c7790c2f3bd59"},"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":"188a00da7646821468893269e4c06a197d14564aaa99669c24f52e3d21b3f9a4"},"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":"c208d8e299953a0e03a0a070418552b087c3f9152328b52222e7b0f8ee20cf1f"},"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":"67213df05a276e60f6b4ce25a02cabd0f92d760c908db5c59d9144d89f895310"},"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":"c1ac1f4b9e81b52cdd5b7e4e079a319313a802095188731c0f4e82b537679861"},"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":"b6fb8fa24b15551135701e685a809701d6717f5b855962d3ea112f88c21052bf"},"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":"388edbf964ecb062823dabbc6db2429e3fad292ad20cff0f90eaeaad2d89e1a2"},"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":"7275af6e857f26e904a99c67be101cf20db70696daf1413dddfbb8c9137a1d7a"},"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":"96a39d7449eb84aaf68e860a347489f1c5e269e03c3fdcf76692433569c12c8c"},"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":"1873359596311dd83c79692965576a4f29c0ba4073e225253baec18a188267aa"},"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":"a3b08a1dc3c86b5104c344a7c900d0ef1fcf48a3f2f236c65fa2f7d67dfbde16"},"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":"a86b68c918a3287efba81b40ab8449030faee4f7b936a3062397082702202ea3"},"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":"98b08db28fc253bb0b20f4dc62c159fb5002f3475325908b081f971305ff8cc9"},"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":"75a0b7167b61b93d09cedeb1f4558638d23d151b80b862e70706b58b61a71fc0"},"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":"c9fb0097ffe5eca84b709d96cbec04bd61ac0f1f0042a49d1bdd75a6ae8bcacc"},"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":"e658c8a5d0371cb6fe9421f87b85de0f83ffba3170d64305aebbf6d287684c28"},"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":"a0d26635b5c91a9382a2f943b741e39610fc8f871750c3e434893fd804ea9be0"},"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":"000ab9a16176cf59a6000473dd2407bab347ad7aa09131d16e33d48bee5db47f"},"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":"3043ff5a9b5242bb846234a1cc302c1b5a61948afad36f1548eea02700dfde0d"},"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":"36d429b53cf2295397a56cfe7878c13c6ff02500accac6500cb3ca5d8dc2bbb1"},"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":"76c7863e82d2569b29145f3f36d74cc9cbe37ff5a2eea937343aecc8523536a4"},"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":"8e88fa873a011f86501c66caa4169dcdc3c7423b8902b9804e8b8d7f80c2128f"},"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":"6cfa9bc562d709dcca567381de54bad7c6e5e92a6db554bb7d8b0aba2f032c2f"},"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":"de76e860ea8791dcacb118b64d42dbce58a81f8b3424de7f40bf770417654cf3"},"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":"6360ea2de3728d5b9703c146cafc758a3f960791a0912a78ce6267e1821f72d0"},"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":"8721d44bd6b5a8cd24c6148929d17e4bae2868dada69e8151a4c613b67ed584d"},"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":"7738784f4c25f8ee85e7396714cd05cdd9ed8d82cd12411d8fb221c494b63229"},"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":"bb583dfc86c79805e6cca5f2b215724474930acab0f2825e54549b2d5b9fe1fe"},"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":"edbf2f7f301e93e71133cddfeb1bbc188ff92fa4ae6729cf26505e3f35979422"},"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":"791db6e042c324459403113f4e252a87b8705bed0efe93f1675edd61b670e743"},"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":"3e6ad7926e9ce454e782797f8b6883f9200484fdaed5270389428495eafb425f"},"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":"26ec41bcc9edc28ea3f2d30ca654bd18908f70d3b6398706f32dbc1d1bdf8a57"},"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":"5eb329186d45babbd9581185437a2d31bf8eeb43f27c4fec8bd9fa9f0ada4c9d"},"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":"225c8c4320581c1104b9cf563c702ddf30154834e742bed8400bf8a1126eab92"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"2d6826087e1beee44f55f7c21fb4a0c5a54951be6409fa090fef2450d3223ed8"},"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":"32e6f4cb2f790f7a42883663fd4bdb9e9d6a14e1a3413aafe71326d05a648e41"},"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":"e0a6e73ff204d2d801262d52573dcbaa138270daf0f05b9548b3b0f6413102d5"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"15e401085dd1a8509e277db5f9fd8a3da3cd1d2a86670cb8ca1a011a19803502"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"46ed5088e372a1645841089d14aca0a25845741310820ce62e7cb1a6cd16763b"},"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":"18347ca1869d75899b77c08a77ff1d7856e215bfc1c29a14eb9e368a028967f7"},"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":"994b8585a943122e50bc0c688e76d9ff54f9de793bee4d76c6da07f9bcda98f1"},"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":"99d52bbf9126bf169819a4ade375bdb1d792c17b65f7b1572de3eb9102628213"},"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":"a81b4246f51fd90ea45ea6f92a59470ed0ea77414d78d8f9f1a7b0a612d81919"},"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":"658cc8a0c6c88d8c6cae5d5a0dfc354ef92e0334a8de2534f7e2f680a22723fc"},"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":"e4cb465e1f0d2eae4c574d9bbda594dca37b461c20ca4391a9a1ab1fb76b76e5"},"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":"34f998d59eaff18b05f62f3ffd53eb1d86ddd758e021a3b06f3dd141181d69a1"},"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":"1616f8d749e43ef106878a0e8114c5cb2ced8818a690387c28d42cfc70e34c21"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"b7b0d221cd64523c0dcb5286734e1f06c479107ff43880d36880e0802d843780"},"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":"c6c2bc1bbfc2f0ba88d22f4cf32e7ab0993d0cf613d5fa6519b18d591810f79a"},"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":"1e00bdb00f7b94d66044432d8a0108e75788241a4f22bd2e5fbf41378ab82610"},"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":"1d149c3d63cb73a338bca0e0e2323e5c6be2ce79de79535409d3dfa476b5bcdf"},"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":"f1ee553d883fe3c0c3988aaaf01bfeac3513c8effa1a5563cb165e8166f0eebc"},"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":"440f3845f57c4a929e174e081c1046cb4eb14b2020addfd4ac56686d2d93f729"},"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":"84e0eef2e6746c284c6dfbbfa6e9bf47848800a420075d80ee14f32c38e51bbb"},"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":"328e2412c2213394fc41fa9b42b2c7a3abde17298cfbdcfc0cd996f16eff054d"},"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":"a507af3927aaf78a0145981f966a02222ca057ef2ff3774d58a7dfc39660e7e6"},"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":"d2b6cc46577a79eeec0fc9abe8916d76dd9ed784c4b2e662d0612b5ec13ff37a"},"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":"e2f523b1119e5fb2860dca8897ef85f18d41064f3a15fcb9c9359c6323386680"},"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":"2eb836cae77493844cc9a0bc01382373a4a7842ee088d745f9e4482acb73ca1c"},"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":"e3787351650cbd1d9d291da952c354e9a11fb2c060c2d183d3123fb3e1383341"},"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":"94e6542eff78812bae993afa7dd5e280a9f2f9670cbb71f63cb34bb124582db7"},"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":"80525ac928835b66cceacb7d60cf7c52429315219b9eb20d4974f88a88a842ac"},"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":"d9e61d07457d1b7ee8b5d6af3f163a8b138bcdc6559902e30fd496a03f8571c0"},"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":"0ecb052dd355b762716eab73a9ccc1d0b8e4c67aa496583233fa44aa0d52397d"},"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":"736fa966dcabb97b7076e88f6de6cb3f893b118d26b38d79584176d00881c1d5"},"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":"c46e0e7a0437c198c5f80c037ff7f7b691aa432119649d9f5f06ce2fa9e78133"},"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":"1cd587136d75586ad315deedff5ae4476451d1a8552756d36b6d5392abb7873d"},"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":"41dde78d001f13afedc8c0fee5b79c900e6b03611df9e9d603256712f0470bda"},"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":"092fd2daa6d38d6f471943c7a096efee9652fa232596b961ff7102da61aaf1f7"},"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":"3f5368925d7a67c3f6136a4529fa68353ddbe47e7a8b2cbae1947cc35c732a32"},"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":"7b8209c9fa6cb804698285d3867879a4b626284d7809fc9329294b039d1c1d67"},"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":"c1c7a414777de150021206260c07467e800bb2866a4607f56c8d9546f56ee40e"},"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":"861286504dd9494342bb0b5c0b6a5412b338395f6e22a92efba1d72fab5c03ff"},"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":"6caa1021a3430d645ad59227c63469633c061adf22cae4343f0ef5762b85d90d"},"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":"112e294b52d5ea2a55e0ef71b994206f73a08e0d09e8a7bba29218063db05832"},"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":"28239a4f5fd09a4a562bda81ba8ce02ca3d48f16e46eb4f06813e399789f591f"},"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":"6042adc825f01d72c6e57285271c67d169b02686a122568d6bde82ca2779fc41"},"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":"e22c27e2643c53f1fcc2f4aa2f3cb55f936279925658acde5e26ada52509a419"},"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":"e7f16663a005de8991949ac8832288f78c3ace7899ca12ef2ac2fae8e82011a6"},"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":"5f6506455bd5df21b900d4dac96bb094a721caa573838cab350a5d56b60a000d"},"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":"018ccffd308e083483d8a6f1413374624e4ab81e747a795f45c128282a6123b5"},"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":"6a3f82a00f2bb50d76abc2019fc37903a4af1a3650edcdc44e3cf3a09ea9e0a8"},"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":"f6a2e9e3ee8828bc9335f91bd1e26d463287911abd9e6a37409b8ca29355aa8f"},"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":"a03c53437571e78e9b856ac4677e0aac7894a85c60063940741bfd1e409d8815"},"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":"d19f0065ad296902c9bfa3bfa91ba7f2ac7ce2b33aeccc09ee36e165b664363b"},"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":"1e6504d6078dc425780b449e43e6d6e6893ef7183500b702d998cae10a07b3d7"},"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":"cbdeb490857c1cf26bad763d0a9691d428d37f0f5677aa28be70f0bffba4cf5d"},"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":"0f411a0d9d080ae4f741b83d6734fb8974f280398b60dd9944f0df86dae9e10c"},"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":"3f2ca3be4f431254bcc190914a5f7293e39ee4cac1b319eed321211892698ee3"},"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":"fb0b7fdea7656dd48444cc0ff3cba1a779a0ceff2635f23b5783327050f19840"},"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":"cb9a2c642f2593affe1ac7a3d9acd4cf87c2c2c58c7c4b11f5be52c994aec2bd"},"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":"99b8d4fd4c25d704eac76cec6b29e17ef83978910432f2e78102262493c9c4ce"},"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":"10bcab55a07025fa577569745720318ec9b021802a88058b3bdc4867b88f34fe"},"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":"d4b7f00c49f00148a523e82c6d556d95cd1a7730f722eca340b03b96772a030d"},"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":"d51c6ccd8b7384172b0054689daea8900b9e8b8809337ba6e62254c18631ba2b"},"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":"7454719cf94b72ae57fa3d3b32f788257324f997695b2aed6c905f69c70a9ad3"},"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":"5ad5af5974e2fc952e84487997ee335a9fcaf000c1a7b9736639b36ee253ba4d"},"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":"e3b2cd104b42b6ac35c061927d31abc05c5861c24ea137330f09ca3ddafaa3cc"},"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":"f8ab19a79b9f4489e4f62835e57fcacb1fb45b35deb82539972376320f66bd17"},"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":"3390db53196782b25d06c29329e197af947fe6c0baaec14cff28f56a84326385"},"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":"293a50721fbab9adf76761cb0f9bcd615eaa1b5b163160948b599036291731f2"},"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":"d5d5343bdd8a5158c52a4e42c942ac2b4dff56c419f7fc735dbbc6cba91dad52"},"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":"ffac67bcdf865c4214dbc36096ba6e3986281263df72036247bfd80f298b3ad3"},"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":"bba7f18f2c6a2313cac77df592585fccb4148a478fb45201861cda74b7c1b5d3"},"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":"8c332076a2eef850934ec50200c8c6f41c6330deadb2ca6aaf69f8ea3984e349"},"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":"3558083d1a45f34a3ab37edff279810da4c28c5caddeae3028ab2e7329363fd6"},"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":"61b9dfcb5735138200279945f8021a77f39c452a8fc962924d72c2ae7a4b3ea3"},"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":"6f84c59d9f82a8451ecf9dc923d6d141f705773e63ec663199b5ffefa69f969b"},"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":"62f5eb66516084611ebf193540e07eb9856a0af7b89d1afe2c01394a44036040"},"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":"8809438ea01124045fed7ab77b8db5b187a468ae9c60a34b5d301e2ceb1ad234"},"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":"e037322e090ad72cd7ea6f3f35a64151ee4f610367672574015f2278c763c2f8"},"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":"710645360b53bedac585aa996b82af9ae860c04fa5defb8614dd6e38a17e70a8"},"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":"f42fbcc251689a04ddd163b0efa2fb04a1996514346c1823fa878e3db9e63bb5"},"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":"3cc3073cefe0f56ee7fca4d765222ff8b11218f61f3b63b91dc0f8b8b59a8e2f"},"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":"8de414b1a1d1864929c72e9362ad59e0d72f1c99789b0ac043c2dd9ebb3a623e"},"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":"15469086935ac6c3e1018864103e0b051515083ed32d53769412d3286eba6c3f"},"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":"11b8a81227a1c828e0da325422b3e539dd83bb8353b0e08fc2e69944362ef16a"},"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":"ec61be7a4e7aafd83cc76e7d3b397603d579f5a6a55bf369e5a0673ca7779f9a"},"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":"646e4aff6f87348b269c2d49701444c067cce260fb3cee75e58d1cc632c0524f"},"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":"39e8f626553a6998765582cf5ed29757c69dc2392987c98297224bacb082c757"},"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":"ca0e4311d3eae20b24f7e55fc876a0ad48c2b59e61b83e5d0794bbc88e0cebc6"},"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":"c69eb4b4af10330531b19345edbf7351fa56a274a435769dc98369ee553b9fce"},"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":"57c50130d8d48126df18b910c86a100c944d8cf807f546bbb30be3d6cda2169f"},"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":"5fbb76116154740d01a021518160b62d2b27b699eb8988534a937ac54899a79b"},"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":"230f8be774793accc7c703162842eed1304fa27d8cd79d7db132833106fbf1ce"},"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":"a50f04b490ca8b1b2fa17c6dfeda96f7baeaddf96782e603d3e2c6926346001d"},"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":"5680dd7152c543ef148c0dd3cf8bb4e125960e5f2516f1525c3595c17f040f26"},"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":"84e4c356128727cac272368c7dee78d92907dd7de5ee1f1cad2fa872b89e5435"},"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":"47a9e4fc151956cf3e721e11c70ff76c10d72f546a7c8ffd90a13c849f29708d"},"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":"a8cdd3ecbe5d0d852f27225efd3d57f5b1867f9fdf2e5c49ed7ca5a040a81c09"},"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":"a554bdb96a112f592634c1c823fdbbcaf6d6fcb9fab2cd486cdf3392f0f5c5a6"},"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":"e04f1d00d700a1c7cfd7d5080fee9ee0b1f9fb9db1e49158a6abff6540c07862"},"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":"956624b968d51b98f23568486f90c721f52e13c77a79d7f259a1308713119411"},"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":"ce7859c7b5b33e5a962501370a31196dd52f1d39f2c549312335746c195fd852"},"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":"e941113ff1caba19e508d5b68c049d6c635566e0b2a3e671c3d1c0d8f25d424a"},"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":"eb9c59f8fb75a7095423e4c1049ee19d13d2c3c23180a89010450c71c163af66"},"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":"409f213a605b71e3956df4a5aa4b7bdc2fd57138cd766f7766afdcda336e517a"},"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":"f858cab44d9b7895113cac998557091d021cac42bf31c9a68ce5710306f9f4cc"},"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":"4788d5e168b980c82d3f929133f1153b73fbf6b660587dd23171ebfa1013af56"},"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":"bcac52d705d60b97d786702ef282fcd95e6112bd9267a70817fbc986783ea514"},"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":"af23e86403d9fccfaeeef7bee7c4b43ad86e5e71d079edbaa2e42e36ae0c5a0c"},"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":"33af43f632f9c4e22b7335b78ce0471c68e902cfb7b0b3f24e4107ef41061edb"},"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":"6fceb0280214c6e59499db1fbb600ce16ab0f90fc9d515afff6fe6b62a720ef5"},"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":"a1d2262caafafa6578d2a26991fe679b4cc3777facb2e1f960dc47556cec2405"},"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":"2ff6d9987eb9b052169335233b131959a4dee3448b80e5ff5ff12b4caa943c30"},"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":"fb339fda1c6bc7f887ec8d0da51f32dc54054e170834c064a1191b9e48bd4401"},"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":"99dced3f9bed68b724cf7e1eb8f767fcb67faef794d494058a5b6c20c59efc6c"},"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":"b09ebf352103084e07c414ccdb35d73fa6071e75db0f5bf7e300ffddb4a2ee02"},"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":"564872b0ed38690c07bbc8fa37075e6e1f9efefb5a36917d9973bed2c8ec35b7"},"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":"2b4194ea6ab15d9d44eb724f0a24138a6f55582bcb9188743ced7d5f2cb340f4"},"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":"84f3df648a1a1b069295cba020f72d93614b2b44a63c10fb5a53696ba2a65889"},"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":"469d2758d93b53947b14f497b2c124d8079d7ea76268bed509a858191d9ecefb"},"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":"2ef69497ebf2c76e66f7b154b2b302507f37e4d6f75e5173ca8b6005f9011e49"},"taxa":[{"id":"CWE-78","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":"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":"80a1d11a5a2247a4ca54fbb54ee2bdaf77d00f88cb79b90be02bd2f985acbd6c"},"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":"b21ef51d97f04d1a8b921e635aca9ef4e877341aa2c3b0f6eaeabc61234774b6"},"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":"2121e53db2df9bc4cdf10bec2dab13c184e66969f51dabe037b7dcca67527e81"},"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":"c32f3257be0f3133e70554dea51af904e2ed0a1f9ff20884a71300a85ee6f36c"},"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":"6504d8d1633fd2629c17cb911821ef9d4b240f323d5e1ebac2df01ac4726a04a"},"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":"f61da5ce13fc969d40a77b7889cc4090dc8f0e8130f69c8fd2b646acb753a376"},"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":"8d46bdcf42c1c606bdd786623bb0af01ceec881af0d3bbc48f063beab9197add"},"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":"a3a5d31b74273d2357bff4d48673dad74f82040bbb917ffc7b90c5f85096cc8f"},"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":"e7aea5ad354bb944fe749ff0e5f574830ccdd11e2edd1cb16678dd3d93b52205"},"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":"9317c6bff8cff2e4a88424157c1618dbad988ca014793c84ac07ed03b4dc6dca"},"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":"fb4a23173542d7a1718b502d857067e50a3ab2bcd9e6cbc8252c0d9b2bd57371"},"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":"82561501977fec0b46655a8368d81e78746b8ad586ca9a50ed529ed4d66c8b14"},"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":"d2542699b904854fe2d3bb29c559aae2c03652694d5ce26390e798fe91bdf8a8"},"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":"1de4e8df69f8ea88743a72dc79ebdff0df14ccb12667fe14ae5c33266501ddc5"},"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":"d541a0eb3b2dbe5998fdd42a98fc8d42f993bd63318277a56aeb54e15c268e50"},"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":"5a0307a0e95589e470722eaa1f6edefde899ff9d045423b92eaede73ef396b02"},"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":"f82a94b547e583107475ce443fc06e8d421287b4914413339b69fa88eebfa9dd"},"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":"59bdb5a1e8e9e2536fc49c741fcb4259a61a8678fc811d3adeb596662203897f"},"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":"2e92484af1fef3b4dcb7c78ad7c99b2e3ef9afcbadf8a52158104508ba920832"},"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":"9e05a9afdb159c3b4e03fba36ee6c997dfff609cf8e7411f86b673ca79d09a53"},"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":"1d11b483dfcf915b1cf80342d758e26c1a3f32b269afb2615b61f8aa4d116443"},"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":"d3863a2595bb228753ae718bfb2db02eb99929aa10f09e1bd606c6259c16041d"},"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":"957b150e90b8de065e3fab913d6db8aa84cc38085b4826b482eaabde0c4cf347"},"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":"865c1256b0af6cac7fabd52ec1703a6840a81e82c2cc09619e5e78e47af02756"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"0e392ba67e11ae052790a06c78c644ef3fd9bc5dbf69d7416b2809b1d51102f1"},"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":"c913cbb7c9044a71c411bd3d17e913455b95a32e1b1cc560bff5f6500d3821fe"},"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":"51191f041d8deed15f063c8f707acc2f0876f1903fa2f6a41f96d5f8e2fb2d9c"},"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":"e0db670617b7e44e8dfa3e5d770bd7e86344aca08e28a47b60a375c4fb6a465d"},"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":"b8edf7785fafc3d35b36ff02a42f8ed8f46dce1a8371fb1e0fd44ece0a50e6e9"},"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":"43760a999a97f3d8e1bb5c6a6b6d464dec82b4ea6c1aa846f741862949b1a984"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"3ce3431e473d09676705abf6bbad77e4ed689cc95cd28d94b55c73416189ab9b"},"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":"9fa80602266dcdb526d5c36348e5c8a8b1bc053ec669e5ea175c45685ff28113"},"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":"3cc30db9311745b35caa3d6bd0b38ecf788b5713977d4cf6055fc5ed56e2a9d8"},"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":"f7394578457bd51c1863339257fb6683f73ae4b13707a1fd334593b760c51e35"},"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":"d350e05d6a70c154827698857cc138cdf5abddb59474b95edf3c8c3eb1929c13"},"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":"dadd26198b04483b068174f7cb8b825d961df8ac8fe3bd5cefba21065f68f5b1"},"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":"217798b245ea5b3a77c77d70e9ab89fc65fb029e60c2d448001c183d4dde3e0a"},"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":"456795f63d21ce2b004dca36c3a6828acbd67108549d7c030190ee89c8d81ae5"},"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":"e130116f9f643d9ec533f80a44ec32c574e20c2881746ed69736d3b79ed283b6"},"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":"5e8f6604bb52b9e4ad2dc18b60c036e2ec9b3f3a485d5562b9c0eb730a836b28"},"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":"7d483f38a74d3d9a40777fb948e92d4eff85b7da81e9471b5eef1d6a50ed5d1a"},"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":"2c15b455d591340e00f36b9f9d4c70a289fcb4b4fe264abaed86b8d7fccf5a47"},"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":"5e0ac576464515405a51d6a441b92fe2f61809c8b4de182264b9bfc06aaa7802"},"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":"a15bc5ba0e85057537e4cc0eee40576a62d37789724224625c8ca04b2ae63b83"},"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":"bb2d5b796ac6facbc511ee6c3f188bc0e4f98e70f69422b64f47dc96ee3164ba"},"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":"0c8d6a5b56e134a60c5ca7e23e105c22ec9bd69239ebb8c6fac66e2fc5336c9e"},"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":"ef6e56fd882940e0306ec367d77f03256ef37ebc402fa52281b96d68dcbf136e"},"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":"7d68b146c790b1a543d37ce7a1f0d36162e0c024ab512d53a194a7e20fd1861f"},"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":"0229561d7d5a2768378e1f64ff3bc0c8a55d31271796003db014e2392d1137b6"},"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":"abe14eebb87db41814fb5ec0c3a74beb1959640bc8d5071e5e2fa2a4d24479c3"},"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":"945aaf6c7394fa816525b9a7d3dda57bf1acda5e0d38658782822d3a038f790d"},"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":"7b1ec728df3509cfe63e2220858e509cb17f904fa667f203b28f6cd0a97a7616"},"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":"55335fdfaf69d33b3ec765fb655f56fb1cda7f4be2294fb90223a6268ea0d1cb"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"f524bfaac6382aaf444745aad061042b5afd0897261e9eedd57acd8af1ba8d3e"},"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":"c172e1473d9c4d2441bb90126dd3ded60c86e72bc24882e79b067a5abc3471f8"},"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":"da0ed92502a49c77805a29d59b657530fa39ff9c97b6bcb6fc4611b4bf9cd990"},"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":"f2a18e07a36c69ff2eb3b744cfbdc1e96543d363ffc48119eb981fa5fffd1467"},"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":"27978f3e937185ef07e8e177c5b4262f863cf39f94ed1ae11b2d4e6b11367c4b"},"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":"d221a7d940e2eea4c721a5ad6413b7b106799119018247b7dc729494696f05ae"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"c11291c1344ee1223a1d067d9eb816959c651671709ed5a168d45c046baa39d4"},"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":"f43f6f0536e4bf56da84eb61c8ebd5dc697e725859dad4047d880add9e235be4"},"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":"b7264220fc6189a6531399ac2485dcffb2156ff10a71eb30c1ea4c43bce0ba07"},"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":"a6a06a6f8fffc0ea2746927b43dcc3a50c0dcee14cc7b6ee3359bcf41d71b89b"},"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":"d19475c2e5516a61ca861f37512e541afe7fc17f7eda972bf53c4c4690a34e0c"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"1619fa4f557e531385375e5441463aa29456bed4b606f3a66a08c382e4ac2b3d"},"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":"b4356b3448cf6fdbadf95e0b690739f279cdce5186d3016e195faedb96e9b778"},"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":"f9524ba99db145bf335f7d47049d72c1ddd09eb2453bb79ab231858dbc96c7f3"},"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":"73e607ffcc897644b10fa900ea94906658c1ed58cfc13966824edde738c9a06a"},"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":"8dede2756459652f948a1d606a7ffd4b61df2fc49b2c537009ee76100b94a0b4"},"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":"9735d4dddcff83cec114c247fcf81671d8cf0ebd97a259e6bd5fc18c4f85cda4"},"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":"90c8954d7597f3e93123cc95750cf4f199e798a1d269d895eb2aac1d3b1ea236"},"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":"e5ab46a35cfb8ad69291bccfe9a5b8e2c5486eb8092d7896edc337f28d3df23a"},"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":"4b5d521850276b8546dad375695739935b36d1699ddaa3b1d1aaba327a60f69a"},"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":"d9e9c71eb2953b7b6174c80f253f82eb6857614f12f57ba2fac4707d2768a706"},"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":"010cf2111050075853273497c62a616fdc89c7790070d7308d433bc2f234c572"},"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":"f4dec1b9f53ea44643621d419a7400114dd20452b009f19f778aab17d84be490"},"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":"fb057e00bbf6fb7c8afd02b9636d0175c95921ff365c69a7d4d8b8e362aa6beb"},"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":"806f87ff224ff28b82bed59a8a09dbae54857eb90d0c96daa0e455c32e0bad36"},"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":"5adf1d51285c7b7e15af0f62fffda52115a21fa86d11b0a0b757b01c56632d6a"},"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":"6cc502dc33c093eb55da3af9bd0b57fea214e767c350b4185724aa15ebdf1edf"},"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":"42be4b4bc0080c60a456e4f2653398b2b8fdef39c1e9b158093a44ca7fd8d3fe"},"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":"929e4b9d56d67ebb916f2cae7ed934e6bfee8a6fbe01f7969d378f3922ffedd2"},"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":"d621633b01bf3e92618353ed7b700f8603cf712bb1a2c4a94e7d5bd8d2680e5c"},"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":"ab6712ff30526cacc8dfbba1b5c94086c6a908cb63d4302894f9279ec3b99810"},"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":"28394fdddd960c192251f8fe7d425459e4b437439ae0c6d1b2a5dad6155d93fc"},"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":"4c830f6552d2110435f3a57148d6a334399e0f8d1e460f9c308d9a4182b4d6dc"},"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":"f98e61832d341e8b7d2882ae1267a30cd1b142deedaf9091fb947fce4805dd46"},"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":"752d7c7e2c64237ac5abfa987433fb0a1c3ef9eb146b75819bdd59c7fcd01831"},"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":"d71225cce04131af52adda3de908afdacd334f062182860930802e63b28fd2c4"},"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":"722c6e4bbc30751fe56d44e6bcb27ee76d8f68f72a8e3fb18ab2d924e5b035ba"},"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":"6003ef9f0810e85377469682518f3155f23bf332ed17ceb6f548d3127713eb89"},"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":"7aa5afe1a59fb3d0a683db7bc4320e8d2ce0b5a74b08883503dda03c3e79b52e"},"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":"7f0c76e2e402e82a50c6a646e3eb1bb8519406d5eab344231ba1d4a562f8a695"},"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":"3b62712c58d4adc56b7533630cefa150a2916bb154935640ededa35392de3e2c"},"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":"809a64c0b47291d820ad8bf3254ef85e9d35702511a4b8ac37474d5304028458"},"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":"ffc8dcb67a466858b3ccd70fbb97ba86cbdf0a7076815055e82b7346b237906a"},"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":"4b70e2d939b3e8bfcc5eef862aeccd101c9bf9d9538c3b0d34620657f56d7516"},"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":"4edc3f51d41f58a6ceabefb8083ac6ae9ae4065e02bdf20c658c7cb5010bc907"},"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":"89f687807a99ab8aee4c341dc744f352e03c5c0eb487b8455f4d61ee90e37069"},"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":"ce3d093cd1794f35ce79249b8af61151f102787fc101a8c80ca2b13de9046196"},"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":"460e0f7359a5a12c4967003277d454418a195e3c238f7e39c67376a67a02271a"},"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":"f74c368f282f3f227c431bc2cba8d1693e717a8ce5882f59904240ee16b0803e"},"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":"d7406a8fa4b8af0eba957caa01900fa097e1ce0cb7d8751a5b16350bfe1e3e0d"},"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":"d09f09a5169870caa32900e0fe9512456037f9a6f8a85a4a6cf6c42b47b25436"},"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":"6b8f9fd4c0c8a1fcd9e6fe2a19665eea024480f66a37c67f906d0749072e704a"},"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":"1dfb2fc9b415c4cc76e28a7f0c23af694d070433da87a034e17606472309db07"},"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":"9f6d45f99fa89edb1ebc9dd7766bf0e8983b39b9c7d9dbb5e86ca05c5d81e8f5"},"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":"5f54feff75d72e0282621e6247fb8911d4ed6fedd1f98acc55ebbf7ee7a6f49e"},"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":"f1ca700daa37fadfb90016e25e333910d7dbe2d4e75bb918dcb61a6cb69513f3"},"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":"5791f7a1ae86d6721857eda13e7f23de61c91aa699848b0c13468343332f6942"},"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":"b7658519b94ddb602f0225d9ce9e31c19855c30f9f54aa6d7f28bb1302928a31"},"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":"bb55e08e78adc72225de33d253145b0743d0e358ff891c319078bea0efeffe87"},"taxa":[{"id":"CWE-89","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":"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":"8e9a43acd9dfae7bf3c8229fdf7ba5edc5a27dbc405ae510b4af0b673c3c27a9"},"taxa":[{"id":"CWE-89","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":"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":"6b45074fd6aa762f1feb7a9f09bd4ca399d40616f56ac1294f0d9ec9e5121fdb"},"taxa":[{"id":"CWE-89","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":"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":"f0a1ea4a0ac65cd257500f169e02ec04c520b532de485b50837736bd7e500909"},"taxa":[{"id":"CWE-89","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":"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":"422a9af7fe7c86d53e6a4ab0959b523ead5c87c8c6056cd1fd56235a63cc6781"},"taxa":[{"id":"CWE-89","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":"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":"f7896f28454ba034c381f8466d1ba77f0dc3706376a7852b54e7b854c919de52"},"taxa":[{"id":"CWE-89","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":"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":"d34db4812032ef52ec6f7bd6a6e4c70419d0f6fe1cc1671c525efe642779c8cb"},"taxa":[{"id":"CWE-89","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":"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":"73df93df31792287a6f6118123b83fc7d1f926df590e75330a378d3f65787ea1"},"taxa":[{"id":"CWE-89","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":"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":"7e58fe79eb70a8450ee5f6a44ed459985dfc9ff20dfbd99550c20fd235e1710d"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"2fc8bc2befe2e1933439f0a636c23291679a2fe16c41ffb31389afe6006fe334"},"taxa":[{"id":"CWE-95","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":"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":"c0851733be55a54c9bc324d311215ca147e77b40025216a1d04179615c3da514"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"8d71dc45a6a774d21a60318d2b5f3dd39b57e892af8e918b6c1fed00d4ca70b2"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"5beca6ca0fc7c61fc25efa244ef694feca95aea554e67595e5343a850d508d69"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"3ebe35d9dd6c7981e7559933f043aa25e6c4d1e1b222d7f37407582d8e0ef58e"},"taxa":[{"id":"CWE-94","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":"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":"ec6c8fa4573e9c0628c5860a11e2a021fe9bbd2c74481ef23bdb29d40e958b44"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"7cf8a78c4a993aecafcb4fe2b18ecb6ff3aced137586a07de2812771fcf18756"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"1498825690ee691422757d83c6c8726aaf69040fa62a3b6b71a03075f0880320"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"85f99189d964cdde824a816d83f2290af0a3f7efe42feb1d6495743a90e33e22"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"b6e72f96a41a75c444fd767174a50661984c7e5415d2a425ac735818f30eeb32"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"853e461a368155db4c69c0423a3d8212f62ae9218bfff16a482aa563f74eb72f"},"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":"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":"4c328bc938ee6022e45ab991b73ff51199a1b922ca8f765bbb89e54e7ab189db"},"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":"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":"3e460a4e6046c53b495a6f41471d36ce42afd4167f0c67b3636323e5edde4561"},"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":"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":"220dc5b17ba68b72d192b79917c65acf99e0187f257396dbf21b1c25cc811016"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"3343db20f6a05c2c3cf444f5046f0eafd4be7124e28554619cd8a10aba8cfb58"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"48d6365bf4ec7bba4285ef4732689ed885c0eeff2d3da811f8a40f2f1d0434bc"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"111ca1f3f706bfb8ca5283bb8d4a0109100b61a4ada92ec7818d3fb7120dd095"},"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":"75de2ecb39b9ce0dbecb94e8856b9d65a7ec667cff9c152e4f075486c99d8c81"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"88d145392025ea9bfaa20af2984cf7442ffc24b9895ae0c63a16627ed50034de"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"17b792dda23a220038db7cebe03823fad8de83f94f169f8decf91def00f2e9e3"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9fceccb436bb34213da8e1e96cecab123c2e0264a740b2f0a990f316cfcc4b07"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b92ae276ea08a2da3cc9fece79c365366c8ecb019e06773c7c3e0fe8f8a0221e"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"69bb582282b85cca418be9ba7f33b7de1ea6178191d5bec5468cf50649c7bdec"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0fe66dc62638fc46a7e5ca119a0aa3d0a94fa76e019dbbb0aff10aa5ae87e9d2"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"337165d8fa9ddecfaf228fc75052bd3486325761b63b33241d0e4d962c50bc24"},"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":"348efeb315a74f8b89a20aaf565b1915ba1c65ec00ef1999c79dce42cdd3f16a"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"6e2ecb23878f6fbe5137c3d8b5ce16d780d581d0b28333fe125d5ae7ddbb0877"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"88e9f636202601747272eee2641c9edb871e03268ba73f171fd36dccf6f35c1f"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"5d46b72ce5934931c10c3040e6f5402294e2960225e15344565fd1d3ac8bfb38"},"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":"0a672ffeccd98f77d3374d24c1e6615cb40dca5696bb22543219e2b86bf8219e"},"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":"0bc6acc567d25e16b6b7bc95f9e20ef6b3783250869a8e69a5a5871da8ced434"},"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":"baaf492a1d1620ab0c7ca57c171eb32c583ce6df63b860c988ba1ec3933a1e71"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"839e5e492f264b31c0bb75e988997e14bbbac72c35d4770b489a948f30757785"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"67382bed0ce1db148a08291f768fe2796b93f4eb246b8df98cbb0a82efed8556"},"taxa":[{"id":"CWE-78","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":"3ff95592f6970e0ab467b376031a5ca43da03ddc884a244959f0a52b8c3142a3"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"0f17b5e47e00b4f8bc4b75b344c4ea91f0c7acbf3b949459f357d28ec5899995"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"ddad385f72b8480b42c6443147f053d037e7fe4c0659c8e8f87d17b75f205900"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"e51d052cd65bb9e905372db0712e040f7b66e89832a69f4f722c4daee3f800d4"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"71b6e5634a70f3d4c310fd115d92ccf8b69b163e4f802b9e8f73d941596a2c81"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"730e48931475c70c8756ec72f40268f276ef73f68b47529e24107f443baf320d"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"776089734aff29f1d141596d66b8f36f32393c38587a73f80487f1753ba5a37a"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"400b88efce65a9b78e4f432ca1b5aa24dcea8d106e8185d1d9556c7cb61c5f55"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"182f1f5493c854a500bdf5f0d8eb9f5268d36e6803530d16bb16ee0c66512f6d"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"3e34f23b6534a4b9456f9f1844b22e19fc69dd1cd56049fcd0d9ab447d1e78b2"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"a858e6ab4eed6a53dcad35d468619ba677b214b733bc97a34f30c4596dcbc5ae"},"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":"bfbb49b972b3f555de1c268874b4028a6619cba6e0197833bee8ac7e83030ce7"},"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":"ab9949a54665414bb7f1dfd1c5c317b60d48b15b50b42c31c464db7098756a1a"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"adc8844a82ffa9e31e14384459e8f24b93eff15d4377da41a0cc111a70ec799c"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"8c92fccfc727a9725d7e0346041a7c6c6adbda1ff8b34cf6e160c3058decf33e"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"000b6abec1b31b56db7e6d0ad0d8b4b1a621b28f8bb08d75f54648f0b80469c8"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"a7bf909a1af36fafaf4cb76333a8dfa4aaf925e2880d68a5c8ecb33d374199a2"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"7db9a53521be7655ac3320501eb223ed2138d3333277dd5bbf39c674a8b34f94"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dc6244ae9092f2548ba4c6336329441a6fbe1f41ca083206912ac3a97048c0cb"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae2550c248d01688f379d5cfb13ab678a5d3466e65e1eec6484561627d8ddf43"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"d8e3e379bb944a0b19700034392d873c95aea60c70d902b92453e221c7e47ad5"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"a4c4d49372d0f478b109adecb51224e6153d3d23e826f2900f5cb6ada73403b2"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"de22f124060669dd9951a205b49f576dfec2bb6cfdf8e829c596d32c1bf0da23"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"c57cee496aa3dbf9fd596da72ad9c678d5322aed24568b074ccdb77d0bfdbd5d"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"a1d1ff65bea457103e8163585c78885ba63036e48eacf214595e290511dccc2c"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"143cd68aff9af3c64496b2f7ce7e374cd2980fc0be188f0fe295cca3cc647ef0"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"6e690243a6fff9e5a3b4488d90e1539a9de2d82f62683ccca468df41b993da9e"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"bed8f4065c0cb9a839dac99ff10781ec65f4458f23cf6ff2c061f589e3afe4e7"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"78c057ec85dc4c6ab6ad0fa26ee582ba4149d37d9c72b75f5dc00842fd8236c4"},"taxa":[{"id":"CWE-117","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"fac2b911af6213cfdc778bb89ca0c2df8ad86516a8627b5572ffffdd23bb7b4a"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"59d14a127c3b65c3d8f33c5c675098fcd9c607fba60dd9b16faa81990f0afd4d"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"7a8181fa1756af879055e290fa96af89d73cb8d260e79119cbda7a54bcd4e123"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"c81f393345d898f46a0dcbb1c9a2b0aa39b1223db6bdecafa2ca6e37dad30b86"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bb3fd321c7f910ec78f480f0d213d1caf46ad3ca0ac3f88a96eede651ea82aaa"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"b8194912359f0298f273302f0142d946a292c13d59179e915584735949110ed9"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"821d0c05350a2752d419f520cb8d7559906d110fbcbbaf9561869d7e36d3d6c6"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"193390cf7ce4ff0e1c082a5080f79e8f36b2ca66f67b11070608621cd3237640"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"5e3e24d34af42a979b55f81f1e467cc07abebd10100cec935e6c2ea992c5fdda"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d29bf9261ab21bc799d7f71497bd0ceddd7f238961351a82bd16e7e96ed2d64"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b92417274de4f0a004ab72ef217f0a4ac92c5238817f285d900bbd9c1c1bdc0"},"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":"088256ef1bddde0584f58b65b9d61ac174da3a41c09ccd3337ae7e8f5be3e7f7"},"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":"f9a55bd9d1978b1639ea4902c86b9d683bb0d3a3158796c8fd226c7294b7f9d2"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"513329b2e04aea0b9aac852eb2a048e6e5b988d90966e0349ecf1755222ca0c8"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b48b0a63488a5e4b7f4523aff34d5693921dfcfa4c7cf267ac3300ffefd2c79d"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dadceeafd2088677229f141cff9a9757d53b647a617e3370a05b5321fc4537a1"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"30de3978500c33e70ff2636ed16d073fdcd7559e6a2cac8c236eef532b5a3617"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10: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":"ff37bd31dc62bbf94142113bc841e97e559d6c611e03bbce2e5513237c53d223"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46205038c32e2a493053627c96719ac096cd61ddecc653cf3436d0eb267183c9"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d84af02800495d652261cd708a78f973022d1d5bbc7756e84cf26ed99cd38e3d"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f8cd4d35a094b5afa51c1066bcd3a7299f405868f568f8b283ea8970bd0f691"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"59153427920f5861461713d0620bc7a31f0ce0e4d725ae957d2f04215cedf573"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"ffbcfc9449e55ca94007a95b7b715c7466b92931c0ee260309cc1f40731bc138"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"1a82242b0fc9cd9ab983a9d7a7b926f42574a19272e4c3f6f5e866ee854a00ba"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"15c8a995dd3c83f9b7a25ab8abc75e78177666b0f003b8d13bc2ba9cd8553644"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"3b82a2d84c1580cb31d0245807edb21489af84fcfc8446d35d959973484131ab"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"875111958a2d8baf88c7fd3a325cdb6e05bc4a621a5bcac20c9b22c74bcc3cc3"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"b392ae710ffdf00ddac1016e4418ccd47c7873849a2429ed18f45ea76572c1c2"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"06e8ceeee655131fd21afa55e26f01f7e0494218b8d8b96251d589ab4b295e99"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"f574d66b9352838c5d47a450022f8c89e2d5ccf1152d7d24457f35efb2f643c4"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"fd44b7d9e4b89731a1e7f525c535302cf854b04ee8979362aad5000f087d0932"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"dc3a4eaab3165639bd0e21e0efe340fa6aa84d5347495ed81422d9e9bf946e12"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"e110fe83a2ec529e2e217cb29844d53822f2976db04609ba82a3293adfe87f32"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"096c21a7e98f9af0e34929c24d7231bc69de3d07c2b9d014cd3f70c06662a211"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"896eb8bfc49c6521da608f0bf335d2b5155ceb0d2919cb409bdf3cb7f5e144f5"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"accbdef1e015f02f02b3b48523193785efb987e25d26414176e2726cd62abc5d"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"f9100e79c58ea04e60ec9d5f19fa755bdb4cc1b5481090bc2d7d9f8f56a09b85"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"4dceab364215b8a430c4318a747d9a06a5a03fcbe3c0c0d65c1e178b4e6f0913"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"0b890170fe881456bace4ff0ff356d14439ae49670a1955f1f970940d72f9385"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"021cdf1839f9290ad3463651bcd2f261de310438318e0613c5a9982e97de94dd"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"23c34b4892b3a148d5882ae6d89dd3a9cc45b23c005a13ff73009a1e46715b2b"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"793d189db65c21e359487c430443dc0f09363e9186a6fb1b2d31363f7619ba41"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"c571c516e173ce78a401b141b253d5f99b47dd12f3157527efeb85aee52ed458"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"9637973ab54c6488b61fae808008244a7324689b55b35fcfaa73c37eda80e56a"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"b9366fde2c5f00baef1514ecc8cd4d17d0b7d6a064d1d02c5a6c2cee0d98385e"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"29503dc8129e2f930b432038c087bcc0bda7ca907ee2982bee6f9e0aa55dab07"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"133ae011761ae003f85a192ef415aa5a33bafd5c0c295f25f5ad67152d77b388"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"940d1c87a9913efa0b69f9c8d32e6325d5dfd9e19bb06d0f1b157ae19593d793"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"c0216097b512353e06fb30cf8553325f451057be209e7054c4a211e29afd96d8"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"1da6d02c8f14928f2353383ab28a778b8a5b4390d1d98c82848ca368980ad04a"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"e17e0defc3bfa317da5035573c2b80fcf3daf3b6b5c89e7fdfe1693dcfd0518b"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"af07ba5abe61a03612c83d9571ef39728c34a055186c253dede917c663d40c35"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"87751567c9e593237792c6bb162bc90e18232891ec4652891097acee00774146"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"9e9273f9dfd6ae75759969f06d1f52623a6001840182f6321b492d63b70cfb0f"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"28284a82b5a0a781dd052d758d233da9f6850a1a9ec21f305263ede244366f23"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"697123ec9f172c02106eda656b58fe94dd8a055f1df241359561fdba5dcb5692"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"b8c869ebad5b0dc64a6df0f61317eaf19df1a2511d6008524ff4a2211e47ee77"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"0c3847adc399881f5a5a7b7272e586d430b23ab66477369d9b5ea062be325a7d"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"4d90bc905be4876359986e6a3bfcbfb09777179cbd0adcb8cad380ed5f8607ad"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"fce5d8cf46f9331eee17d019b8db2d73b6d45184ce6120f6a0eb715f6acef01f"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"76ad9b102ad5681f2279608c09c3cd997ddffaf84095ebc2bbbf7e7d669c287e"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"aa147902705868082c852b78d312cc7c0bd64563b0e756ad0ff42555ff29a84c"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"028f07741336cdb05d495c2350442dfc13d98920328fa3b32e130dd38c6a66d5"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"736c990a02605f0945cc82ee9a5dc330c294610d0cc9ff891cc1b8151dd3893c"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"1042ef440f94e47cb1f0c297f6625144aad27a75b554c33e1a5c837916e090bf"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"434637193370433e2f03c1cde6108377dc4b7dcb02a2c809f73c1cf133f36767"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"352b5a658434a3e5de09bd54c219520ef0953c937e7a7195980186937b64fdde"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"9520890e06381a8eddb0ea6f6bd05be03b4cf76d87d98326cac93cb8f1031791"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"6f630b4af3553d12c3a161388e0d1813e3ba9e79456e7b06e0401a39b5242987"},"taxa":[{"id":"CWE-78","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":"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":"bd42af28cf0689bc5a5281a927af9ef0881e492fe695fd563c27bb0806072b8e"},"taxa":[{"id":"CWE-78","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":"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":"19769d70e87344b09fa6ff98b323436c5de0aafc8fe223dd2287f8765df83b9e"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"00aa00d33518a6e1f2e6739278b38099010981f88582f08dc28d86a0f21a4de4"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"3dfbec89e6443122ff3d8fcc3af07d48d1617211c21cf8572b5a2714cc81c9df"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"c6fb857e6f676f5cba1c5b25ad69427f66d8a2f0136173d6ee4cf4e278ee879b"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"fcdc9fed2a2e26a67aec34463beb9a6bff9dffe44dff842fc690a5e0897a3432"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"87f0637824fdd55c91987d612c47227b2a0e1b49f998b78142df647b49ac7ad2"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"6da8a12453bfc20e9f26c00ac0a589e921c1615d7b20b9018ddca2cb02130dbc"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"50a589266b36edbab31b2698e4c1c3f53d4cabaf68f7561e6d21d7987c1ef702"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"e90491da7b90177d9a013c6b2e49e99ef560bd21345c56ef9b41dbd47b75e877"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"90890485ac586a1d556b378a56f1369b8c28ff57e0adc887d464d1a53dcbb706"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"8158e7d302dbead3a50eedc55b83e82a21250662cc124d18a11dd4a30d0be3f6"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"195bf9f428902220f2346c86504dccc71769811000275b5897f74fe95f54692a"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"5977666a998c8c0dc7218c8ea7812c04bf2abad1a4180bd77162595ad798ccc9"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"8386fb1732bb720c50d3d45eb63391cd37886d6da12a0d755dbf144accd8cec1"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"f6fc77fae31c4772e342a8d77edb8a27ac10fccbfabd0b53173f90ccab59be01"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"7f72ab07cbed2b47b93289ecaf96d6ba4749b8f274e69c1458beb2f04c7e4052"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"526cc043b02f34a95eaf5baf3c43e80f0abc09cf6f652120ed261fc948f6c2d7"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"3dfa3a1da61fbfb3a0542fc79e8779265f240948a4a1f03064e61abb119a8ea6"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"83a89a8876fa99cbc4087269b4f860abec3273d7c879e41769100cb23984474a"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"0d7361f029f76cd345a4ad34a79c4237fb108da969ca2fca7d89d508a5022a00"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"73a8bdf88f28cd4549d499ad6a54cf7ee1541fcb9fc72ae192f799116691fb24"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"80b472f129ff39655df3dbf43aaa04af8bf3b7bb8db2fa28655f2db7c9ff6596"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"bc8d407596f096ee744b6eea45553876922b870f691b6bd6452137faf536b46c"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"eb76e4e98030442de8767e0123cbeec4e6141a1d4b7fbf173c781d5a5dafd787"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"49f7d0da99eb51210ead97e269462726461793affa6a827371ae63f4ff4d8fb9"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"e0e1e94b093409a92e2caa1b8a67e71b7a95e856474db12683e9f827d4ef99f1"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"129f9612ab7dc88fe8e2ea22c4691c4723f8565d34833043dbcdbdd72cbed378"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","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":"c9375da0565b671451ef16d7e07597c526e39dfad3639e2d37b8351c10695885"},"properties":{"dependency":{"package":"zip","version":"2.4.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0367","RUSTSEC-2026-0368","RUSTSEC-2026-0369","RUSTSEC-2026-0429"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"31e6d20192215a536ff7315590440c76f53fc910cef7ee9151e86ec6f3db6813"},"properties":{"dependency":{"package":"tinypool","version":"1.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"2d7dc572c0104f6c7b52a40827f0b9d64b79c6ae49022fb7733a0f71c1c71684"},"properties":{"dependency":{"package":"next","version":"15.5.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"d1914a339f1f56ff7b5f7288eb82c4983f15ea28418c7895ca6f39f9cab314d3"},"properties":{"dependency":{"package":"next","version":"15.2.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"01fe70e0f074e73e286dd718179dd173c06cfcc3d89ddc2d4c166e2fdce8a6f0"},"properties":{"dependency":{"package":"vitest","version":"3.2.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"07874224b6df451b13dba6e16dc5e58a18c01548cd8bdee02acddd41d4f31085"},"properties":{"dependency":{"package":"@storybook/core","version":"8.6.14","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"281c8a6c08fc1f45b2feac0b0cf2659e058a05f468488b2c8e9db6decc564656"},"properties":{"dependency":{"package":"fast-xml-parser","version":"4.4.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"57fa8d7530ef15d24dd3c814499a3964da71d091b8e29a98266e77d4195fb9b5"},"properties":{"dependency":{"package":"fast-xml-parser","version":"5.2.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"9e32a448cc007ced35f574ac851d62d56116470e427182b0cdc6268bd3dd0048"},"properties":{"dependency":{"package":"form-data","version":"4.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"e5533c2d149eea07ed065c5fde61196816d01a4a3eb50ba7bc43ead963babea5"},"properties":{"dependency":{"package":"proxy-addr","version":"2.0.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"23ba285768a9717c3d5085841ef10597e7a5569e449b29f35de771059c9ed2a9"},"properties":{"dependency":{"package":"sandbox","version":"2.5.6","advisory":"[GHSA redacted]","aliases":["[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"29827ff1862f4841c892ec8b8867f048f1bfa9d96110dfe90e22961d0aa8306d"},"properties":{"dependency":{"package":"shell-quote","version":"1.8.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"3d210fff63e95f7d0c37419bfd83c66d83bfe791756d35c611bb45329301b7da"},"properties":{"dependency":{"package":"storybook","version":"8.6.14","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"e4abbe2113bbd7ef8eef0d99c18a51a38b3c3fa8eb609c63aeb0aa3c30b70291"},"properties":{"dependency":{"package":"tar","version":"6.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"typescript/apps/vscode-ext/src/plugins/language-server-client/cli-downloader/extraction.ts","line":6}}}},{"ruleId":"D30","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":"811686aef83c467acb8ca8de57229b6d20d41db8474e701650aced47d1504324"},"properties":{"dependency":{"package":"tar","version":"7.5.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"typescript/apps/vscode-ext/src/plugins/language-server-client/cli-downloader/extraction.ts","line":6}}}},{"ruleId":"D30","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":"d74aeba34c20ef883320d58ae3a9ebc2ca37676b56ad245f77891a27afcd5d2d"},"properties":{"dependency":{"package":"tinypool","version":"1.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"6e73274327a59fde3d7525c32eb900b994ffa4778e21ba83ba71c18747bd32c8"},"properties":{"dependency":{"package":"vitest","version":"4.0.15","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"baml_language/sdks/typescript/bridge_typescript_web/vitest.web.config.ts","line":3}}}},{"ruleId":"D30","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":"ec2094f92bfc5495049a4ab96529117242d5d872f25c7f4fafb996f335e59c68"},"properties":{"dependency":{"package":"next","version":"15.4.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"497c5e2d57fe4f792ea3d6840a6ebb0dc2fd108f52e147a667528abd2adf92e6"},"properties":{"dependency":{"package":"vitest","version":"3.2.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"7b6ab91a50937928779fbc86b211ccaa82ed965a5b589896b89ca6b87719716e"},"properties":{"dependency":{"package":"tar","version":"7.4.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"4e4b7681763022b8b9e0068bded1fd459166b123b16821f458c749f975b185bb"},"properties":{"dependency":{"package":"vitest","version":"3.2.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"53f2ad6b0e9156bc047d0268ddd42163c80de9546a0f176c332fea87986ca0cb"},"properties":{"dependency":{"package":"next","version":"15.3.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"46746c5b1e70d70c3ce93b64a98c8607e996570819cf156e098981d05e94404a"},"properties":{"dependency":{"package":"next","version":"15.3.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"9326a4f93dc319f7575d8844a14471e6392b6d29431ca2ac1a438883f0b5cb19"},"properties":{"dependency":{"package":"dompurify","version":"3.4.12","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"9a0831809c9572fd26ed1799277be78ca86508ff0c51b2008871cebb4dcadef6"},"properties":{"dependency":{"package":"next","version":"15.5.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"typescript2/app-beps/src/app/api/agent/bcs/[number]/route.ts","line":3}}}},{"ruleId":"D30","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":"f7678bc6adefc3505a7b9ce3871ea82475062691b0e463d4a658d8309b97f847"},"properties":{"dependency":{"package":"shell-quote","version":"1.8.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"30f7e47487b7c464e4f9cfdd9168e76591d4f0bf03307be116e6d60c8468cc99"},"properties":{"dependency":{"package":"next","version":"16.3.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"4b0d954830f54c389b9cf9b57ffe296676304e40c62ee6becbe35caca6fa2409"},"properties":{"dependency":{"package":"next","version":"15.5.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"dafa64593a44c4cb8a2b9e2a52d295ce4c9f5160f69190ecedf2b44449fd8eb8"},"properties":{"dependency":{"package":"@vitest/browser","version":"4.0.16","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"typescript2/app-vscode-webview/package.json"}}}},{"ruleId":"D30","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":"aa4e8e63b41a7e8bde3355d91a63717ef0f75a031250a712e9b19b9e45718a9b"},"properties":{"dependency":{"package":"dompurify","version":"3.4.12","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"950e02636ff5d4b1142d073a75675d0893fe509f36308029e797a8989ffdd69f"},"properties":{"dependency":{"package":"fast-xml-parser","version":"5.3.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"f6ff8a2fd0daaff26fd0b886a45615e05bc8ca4bf5f6de37f408632b2a8467bf"},"properties":{"dependency":{"package":"next","version":"14.2.35","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"typescript2/app-beps/src/app/api/agent/bcs/[number]/route.ts","line":3}}}},{"ruleId":"D30","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":"2808c1ea0e9bf681173bb016947805a0d1b5dfbfd64c4d1444cfb2ae28ad1f7f"},"properties":{"dependency":{"package":"proxy-addr","version":"2.0.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"aa375772ece0c685e813d0b571b07d929a2de2f944f204e6858cec3ffdd36c1b"},"properties":{"dependency":{"package":"shell-quote","version":"1.10.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"7b769039930bd1e1a0897360ace3eecb8e8b7257594abb1ebfd7b08ddfb3626e"},"properties":{"dependency":{"package":"tar","version":"7.5.16","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"724a50125c8aa12abf53ecf8ab3d979670aaaa6492067197a06f7cf3a35f0e2c"},"properties":{"dependency":{"package":"vitest","version":"4.0.16","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"typescript2/app-vscode-webview/vitest.setup.browser.ts","line":2}}}},{"ruleId":"D30","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":"904f22517114f172e1edf178208afd4066e029e343ac5aae991b1c3a73a25425"},"properties":{"dependency":{"package":"pyo3","version":"0.28.3","advisory":"[GHSA redacted]","aliases":["[GHSA redacted]","RUSTSEC-2026-0176","RUSTSEC-2026-0177"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"9c4b5e7d096b97b49eac9a1b39f6fc0df6c7bc873da9e4a348f010ed79d9b2c9"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.14","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0185","RUSTSEC-2026-0338","RUSTSEC-2026-0339","RUSTSEC-2026-0340","RUSTSEC-2026-0342","RUSTSEC-2026-0523","RUSTSEC-2026-0524"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"15eea4bdc38474f82ce5851957c7152eb946828b9eeb2cddb6984a5a65458809"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.14","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0185","RUSTSEC-2026-0338","RUSTSEC-2026-0339","RUSTSEC-2026-0340","RUSTSEC-2026-0342","RUSTSEC-2026-0523","RUSTSEC-2026-0524"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"d11be2f6a0e9ae6f5b344e9230073f702e5c0bb8e17bad0030468cfc1d17db24"},"properties":{"dependency":{"package":"aws-smithy-json","version":"0.60.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"ece825ae475b42a9055122b14acbd09e9503c12e4fbe6b0530a9449c6e780185"},"properties":{"dependency":{"package":"aws-smithy-json","version":"0.61.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"71408cb5e63a9f37334978e3ea25488191ad730a6f372409019b1119aed437d6"},"properties":{"dependency":{"package":"pyo3","version":"0.23.5","advisory":"[GHSA redacted]","aliases":["[GHSA redacted]","[GHSA redacted]","RUSTSEC-2025-0020","RUSTSEC-2026-0176","RUSTSEC-2026-0177"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"a6943f597c800ae3ba01872f1a7152de40b962ecb7a13a94311663225aa27929"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.13","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0037","RUSTSEC-2026-0185","RUSTSEC-2026-0338","RUSTSEC-2026-0339","RUSTSEC-2026-0340","RUSTSEC-2026-0342","RUSTSEC-2026-0523","RUSTSEC-2026-0524"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"1ff97200451c80ab9a14407cebf4ff3ab744b21dec3d0c64ac672046e317d558"},"properties":{"dependency":{"package":"pyo3","version":"0.21.1","advisory":"[GHSA redacted]","aliases":["[GHSA redacted]","[GHSA redacted]","RUSTSEC-2025-0020","RUSTSEC-2026-0176","RUSTSEC-2026-0177"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"9d03362ec24ad939cef6d2aeac62a17b3a51f1b0e211e6f09d74552dcee6d86e"},"properties":{"dependency":{"package":"gopkg.in/yaml.v2","version":"2.2.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2020-0036","GO-2021-0061","GO-2022-0956"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"087def91022e3e41d4696ac77f324d3ea976eae07da8c40e6db62d8134c8e74c"},"properties":{"dependency":{"package":"minimatch","version":"3.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"a9cd1b1097158cc4ee12a5199db4affc5ef0a36adff502e3669daaa8e902d18c"},"properties":{"dependency":{"package":"js-yaml","version":"4.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"4c267c69de16490c3f8d35e0d4e97f2490f63d37dfcb8c351a672f318f81e8af"},"properties":{"dependency":{"package":"zod","version":"4.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"b219436c45018cf24e3d682b1f9e75873c171a14ff061dcb7785d47844bff612"},"properties":{"dependency":{"package":"brace-expansion","version":"2.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"19bdaed375694343f23b4cfb484a3463ed8da1a65e5fe7fd3e4beda7140c0833"},"properties":{"dependency":{"package":"js-yaml","version":"4.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"da0e3d7e3e6964e364b7fddae8e401e661be2a661846275f55d8813c3a9f71ad"},"properties":{"dependency":{"package":"linkify-it","version":"5.0.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"0a384b1f8a606d03ef1219193eab52e695c7260ca807abd635a51bbf2fa02b05"},"properties":{"dependency":{"package":"markdown-it","version":"14.2.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"2f5a690e32ff6957525f6a957e971cef4e4b0d06d349868058a6689b2c780b39"},"properties":{"dependency":{"package":"nanoid","version":"3.3.12","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"45657c1d7a7ef2fab933875f381c3736c9db9d41b5925755fded20fb27ebc5b7"},"properties":{"dependency":{"package":"postcss","version":"8.5.15","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"2ad00eeec679e7092c7ada1edf4a85757bf5e2d32849644aa164bc39e6caec30"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"a1a46760381dd26a996d91ea8661f26eb2408687a98b5ec22f196ce5a5869e0d"},"properties":{"dependency":{"package":"vite","version":"7.3.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"0a096a22acbddff61d88ed93313dd8ab1e5b778020c139dcd6b058ce9ef6db2d"},"properties":{"dependency":{"package":"nanoid","version":"3.3.16","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"6b24680dca7e70cf0a3f3775f22fffe469db8beeab50b515a2e97fa549ec0425"},"properties":{"dependency":{"package":"sharp","version":"0.34.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"2ba920f5922c64363eb3c0b7aee13a8e878eec3859e3e857ae0b3edbd06cb94a"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"85ca8fd27e9373b37ee47fbe22fc47c6f530d0fbd03c8a4f0122c15b82caeecc"},"properties":{"dependency":{"package":"undici","version":"7.28.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"7c29ce11d89f9815a34650698bae6ac87d5bb1c584ec792aa312c5d85b7c7ec4"},"properties":{"dependency":{"package":"vite","version":"8.1.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"7b5a730ca2bdb4545231674e2778f9c5a1ed6d4c76f273d1209fa699266f6512"},"properties":{"dependency":{"package":"zod","version":"3.25.76","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"ab60144f72350bc6b244277fd20f8ab378b7ab71f58282c300a32a698af9d35c"},"properties":{"dependency":{"package":"zod","version":"3.24.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"ade2ec05eea7eeb40c8bbb1232c54baa6b828119562466727fcfc7e0314b6463"},"properties":{"dependency":{"package":"pnpm","version":"9.12.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"d0750c389d9c152bf1d4e31dfc91f23aff8c134e832845da27b3738c33162b18"},"properties":{"dependency":{"package":"@fastify/busboy","version":"2.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"8f5c2dc6d5d2b526b4268f6d97f3b8165d45a7dc2b2aa1188cffe0d1643af079"},"properties":{"dependency":{"package":"@isaacs/brace-expansion","version":"5.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"85fe4c90c629c087da41d26f2b686efcc2e5a210d7f5e7ef803b0e4e2d09c164"},"properties":{"dependency":{"package":"basic-ftp","version":"5.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"2eae5ae78d85cd537b0fb3020ddcfb60e7b62739c2b4fe6fee05aac434877c13"},"properties":{"dependency":{"package":"body-parser","version":"2.2.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"0ee89ee3ff405f611b640acf7f2d3a5ac1bc78f1322af7776adb90b84dbdc399"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.12","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"ef44a3a7db433bcfa1810bf42eb415664150ec9e90afdcae5c6e9f1901b6e9d3"},"properties":{"dependency":{"package":"brace-expansion","version":"2.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"df088442ce939a8183a33407cb73c233e2b82be4beefec797de0b30fc3c2bb4d"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"ce9bbfea95fe015374ae86e03b9373fd15c82feee84c4ee070b765207d8d9476"},"properties":{"dependency":{"package":"browserslist","version":"4.25.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"f88fc00ec7861a56df42bb26114ca872e3309402838f7cfa4c001103d41b71a1"},"properties":{"dependency":{"package":"dompurify","version":"3.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"06593c39ce911a216ed914a471d9cdd931bac450d9675076e44dd756bcb35a60"},"properties":{"dependency":{"package":"fast-uri","version":"3.0.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"bc0d4bfbc2dbf13b7b4678c7f750f00c9c46698f61534d37a6a18fd133b243d5"},"properties":{"dependency":{"package":"flatted","version":"3.3.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"73e19071d1f29d293fa680f013d3f1f8d6bea8dcb7362cf8d2bd56e313309008"},"properties":{"dependency":{"package":"glob","version":"10.4.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"typescript2/app-website/scripts/convert-videos.ts","line":21}}}},{"ruleId":"D30","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":"cb29d5769674081f1d9beab5a423e3ded1860b0fb331910f3d29e42d88c4693b"},"properties":{"dependency":{"package":"glob","version":"11.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"typescript2/app-website/scripts/convert-videos.ts","line":21}}}},{"ruleId":"D30","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":"81e20134920e68a9b48bec226545a8737d18275f531fc9d757fec6cd0f3c9b5f"},"properties":{"dependency":{"package":"image-size","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"691b7e2bf95c8af84df5ce832211dd11cd5da521b87c95df1fe446031c2b4fca"},"properties":{"dependency":{"package":"immutable","version":"4.3.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"6d66865a895be83070d47ca5389552eea8c6cee10a32818c70a3443fc659d917"},"properties":{"dependency":{"package":"ip-address","version":"10.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"7aabb4429e1316d15cda57088dde18de68ae5ecc7ef8147681396f51277a2298"},"properties":{"dependency":{"package":"js-yaml","version":"3.14.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"integ-tests/react/src/components/test-client/format-renderers.tsx","line":4}}}},{"ruleId":"D30","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":"927acfad56ba9301ae25577fd550f93d15ad39f768a1b4b0405add2ce82c1d36"},"properties":{"dependency":{"package":"js-yaml","version":"4.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"integ-tests/react/src/components/test-client/format-renderers.tsx","line":4}}}},{"ruleId":"D30","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":"4c68507fe16ced978c1068f9c376402828cfdd335dbca8b9c218f89ed69d2c3e"},"properties":{"dependency":{"package":"js-yaml","version":"4.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"integ-tests/react/src/components/test-client/format-renderers.tsx","line":4}}}},{"ruleId":"D30","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":"5402c61ab90b9ddad6879ac5cbcbc5f93a1ff01d4f5bcbc090a44fc5eca4c817"},"properties":{"dependency":{"package":"jsondiffpatch","version":"0.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"974f06a708ed9b9c593a31108a1a843eb8724644181a7989436b2d2c4702cf9d"},"properties":{"dependency":{"package":"jws","version":"3.2.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"443f53f434df524f765a296caf681c9d394db05e316bd20b1e186e62cf35dc6a"},"properties":{"dependency":{"package":"jws","version":"4.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"bd35a72e6722ab54649b8f90b26091aedbff60323fea941d92430016c01956ae"},"properties":{"dependency":{"package":"linkify-it","version":"5.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"2a14ea48d0884c57b3b8de5e1ecaef3cfa17da6b30b57c3a8be999de1330b2be"},"properties":{"dependency":{"package":"lodash-es","version":"4.17.21","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"typescript2/app-website/scripts/new-post.ts","line":21}}}},{"ruleId":"D30","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":"0b08ef5542c9f4398d4acaa9e077492a1beb95ce9cfd45d321a25b7170404c97"},"properties":{"dependency":{"package":"markdown-it","version":"14.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"eea567f67a265a2aa9cce8850cd3d7db5b079c25d91916599b604cf2434a7818"},"properties":{"dependency":{"package":"minimatch","version":"10.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"d4817816a45f307477e85abb3b8992c8b158a6e5cc5010716d42b19385053d99"},"properties":{"dependency":{"package":"minimatch","version":"10.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"b33e4f59095cef856c745d3e6ddfabb601c9669aa128bbb3a27dadbc1161a7a7"},"properties":{"dependency":{"package":"minimatch","version":"3.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"5710c68fc5903144d8ab95a6fe8cd7113b5e2485c7cfa0d18f7f9a4a5845cc13"},"properties":{"dependency":{"package":"minimatch","version":"5.1.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"2761547fc85bbdd4a5c5c349085548eb7302031a55da5a14ba3f94504d1e257e"},"properties":{"dependency":{"package":"minimatch","version":"9.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"2ea65af982fbfa7ee58dbe3fa40bd975ecb648d209c563eae9269b519d2be2a6"},"properties":{"dependency":{"package":"nanoid","version":"3.3.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"typescript/apps/fiddle-web-app/app/actions.ts","line":3}}}},{"ruleId":"D30","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":"f91f455cf9d54a5747fa7ffacc5b1f4ca9c2de3a78a1fae7acaf2a13ba35649b"},"properties":{"dependency":{"package":"path-to-regexp","version":"6.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"270da552c849fcb2a02fb77e3df45e0ef89b0ca6c38f4c5e76e120c3f4275c2e"},"properties":{"dependency":{"package":"path-to-regexp","version":"8.2.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"69eb2e0c0d9b5b11b847f35588c072e411c862f832149042e2d943efc5b9a108"},"properties":{"dependency":{"package":"path-to-regexp","version":"8.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"f27a124d5de3878d490ee73dc0f417deb0da59a6215a5136a3ce3e23abef25f5"},"properties":{"dependency":{"package":"picomatch","version":"2.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"36fe7e2caa457a4c2c63a2ed88221eb2a37338b951c94df2f1fb4a2a40e5f762"},"properties":{"dependency":{"package":"picomatch","version":"4.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"b9cd077c524f3d0a48006ee46aa7bc9da8c34ac492a38f90ebee1f90fb08f864"},"properties":{"dependency":{"package":"picomatch","version":"4.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"f0aad28ef026f432ea775831a497c9919ebce9d39f93ae9fbe73c19d95c4e237"},"properties":{"dependency":{"package":"playwright","version":"1.53.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"typescript2/app-product-metrics/src/jobs/send-slack-report.ts","line":2}}}},{"ruleId":"D30","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":"94c6ff14ea54b382a61d2f966f77a9032450e908372d7ab5d8acd1b161983573"},"properties":{"dependency":{"package":"postcss","version":"8.4.31","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"integ-tests/react/package.json"}}}},{"ruleId":"D30","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":"7226dc01873ef2dc55cb85b4c38fb4f77f22aa91acb417ba07392bc725b8afbc"},"properties":{"dependency":{"package":"postcss","version":"8.5.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"integ-tests/react/package.json"}}}},{"ruleId":"D30","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":"55bb3986aec1e2e40294c46650ceeadc2ea24e7e4b8482cdd51746604ddded6a"},"properties":{"dependency":{"package":"preact","version":"10.26.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"b5acb87db0a18ef78319fc1be20418d042c9ca5e1a1ef365fde58c7b45c434c1"},"properties":{"dependency":{"package":"protobufjs-cli","version":"1.2.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"baml_language/sdks/typescript/bridge_typescript/package.json"}}}},{"ruleId":"D30","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":"549bcf508709afd19b2bed6db704d7a1425c76c084a0453fcd8e812b00abc0f5"},"properties":{"dependency":{"package":"rollup","version":"4.43.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"addbeeceadb4c5bc8ee5caeb04de03ac44d22d147c99d7f88af5a778dea0b9c6"},"properties":{"dependency":{"package":"serialize-javascript","version":"6.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"5f538739e89f76b0971a5390fa8cddbf706f34980e213deea9c68f7ff3476760"},"properties":{"dependency":{"package":"sharp","version":"0.33.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"typescript2/app-product-metrics/src/chart-image.ts","line":1}}}},{"ruleId":"D30","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":"aa397a2ed490eaccc85ab9cc3ffcf3a96b11f48e16f70a3267ced7e9444c4923"},"properties":{"dependency":{"package":"sharp","version":"0.34.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"typescript2/app-product-metrics/src/chart-image.ts","line":1}}}},{"ruleId":"D30","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":"b9e6ed2f1c3b9d06c1ae728ca0754a134c8b09e532a74b14e5e76708e01e4c58"},"properties":{"dependency":{"package":"smol-toml","version":"1.5.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"0bf997523edcbfd004b0e48079d2d03fc36b5b8058c165442d7b3299bf52fe16"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"34c634dd8d84f5e47277186547eb9356311f344db4759e892016881dfc707f13"},"properties":{"dependency":{"package":"tar-fs","version":"2.1.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"5fd66fed6cbabf2ebcb54e1348a619847d0bc5632ed65037101ab132a4a74a93"},"properties":{"dependency":{"package":"tmp","version":"0.2.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"c7424c94094dad37a163d385a8906880f2e4cabe67ebe544b80401bdc249ec37"},"properties":{"dependency":{"package":"underscore","version":"1.13.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"c2a7a8d3f51796fc26d4e18a3c56d3c444a80db213b5c71931e0d4fa3a1f5ff1"},"properties":{"dependency":{"package":"undici","version":"5.28.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"86a08e1fad64c07483e92b307d31c7a58780a3df3e75218f4c2a8d9f900214de"},"properties":{"dependency":{"package":"undici","version":"6.25.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"a26b1c9d8f009a7f4fa46f053a8d8c071451fe2a76bf8960fc4ebfa7b63ae674"},"properties":{"dependency":{"package":"undici","version":"7.12.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"95c156490e4a9b0b13e3b20bcd02188d863c78553cf5da8a8eb456c471f53856"},"properties":{"dependency":{"package":"undici","version":"7.25.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"7713653c1cd2e524df06e4e81d883565ceb6482ea97f6eea94f00d39b4a4d989"},"properties":{"dependency":{"package":"vite","version":"5.4.21","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"engine/baml-runtime/tests/viz-runtime/web/vite.config.ts","line":1}}}},{"ruleId":"D30","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":"c0c337269349bd1bb2738b32d05242d1e293e069aa8c53a2eb7067781bbf8d1d"},"properties":{"dependency":{"package":"ws","version":"6.2.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"typescript2/app-website/lessons/watcher.ts","line":7}}}},{"ruleId":"D30","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":"b2974bc353dbda315d3f06eda09abd1e5c3941a67cdc1f3a6db11c6aaf3e5ee8"},"properties":{"dependency":{"package":"ws","version":"7.5.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"typescript2/app-website/lessons/watcher.ts","line":7}}}},{"ruleId":"D30","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":"025221a456fe9c6d9bc3241ba0504fde0e0206e6cfe4fe022f7629472969a855"},"properties":{"dependency":{"package":"ws","version":"8.18.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"typescript2/app-website/lessons/watcher.ts","line":7}}}},{"ruleId":"D30","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":"daafc45644bcdaeb47108e4794f17a5a7f3f7bd78007ed1c7bfb2d8b51662341"},"properties":{"dependency":{"package":"ws","version":"8.18.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"typescript2/app-website/lessons/watcher.ts","line":7}}}},{"ruleId":"D30","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":"5c68317aa5c1f3c1c8398f77001f4a6de3d56e5d5b4eb4d522b9380433b6d18b"},"properties":{"dependency":{"package":"zod","version":"3.22.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"typescript/apps/vscode-ext/src/plugins/language-server-client/bamlConfig.ts","line":4}}}},{"ruleId":"D30","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":"6f6766de947caf9e6d36318878344ddf3bf57d1a6f2babb4d90cfc478705cc57"},"properties":{"dependency":{"package":"zod","version":"3.24.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"typescript/apps/vscode-ext/src/plugins/language-server-client/bamlConfig.ts","line":4}}}},{"ruleId":"D30","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":"7858e84184314dc95f034961c60d49d39a25fcccabbce3ab097b771dbde51482"},"properties":{"dependency":{"package":"zod","version":"4.3.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"typescript/apps/vscode-ext/src/plugins/language-server-client/bamlConfig.ts","line":4}}}},{"ruleId":"D30","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":"9849de74ff71be137b7df1d7b9fb50324425c96a48334583e3f534ed7048b4ff"},"properties":{"dependency":{"package":"aws-cdk-lib","version":"2.257.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"tools/pkg_boundaryml_com/bin/pkg_boundaryml_com.ts","line":3}}}},{"ruleId":"D30","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":"07c9c49059c41aea9b434739e1fa9f81c0b7c42f3ef9792b4f81cbc60d99d988"},"properties":{"dependency":{"package":"nanoid","version":"5.1.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"31c32a77167524ccb4590f3351de493e029c43574644e8a16da8d83cb30fb986"},"properties":{"dependency":{"package":"vite","version":"7.2.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"9010c56120363fe36f3e7ee3b501d57acdce49efd2b4b1abc3200c5464d51fac"},"properties":{"dependency":{"package":"adm-zip","version":"0.5.16","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"c4b4d3b2e9fd183d998e2fc7b9334a76f358c9fde025a3c3f9d588b874dd7538"},"properties":{"dependency":{"package":"axios","version":"1.10.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"e330d49853b6ceed9be7b58cfa6b71ca3cbec4db880fd8fffd74c885ce87b020"},"properties":{"dependency":{"package":"http-proxy-middleware","version":"3.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"02cf53e218801944895f6119ac6ea912b897cae407b460d625547b535b968b64"},"properties":{"dependency":{"package":"zod","version":"3.25.66","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"c3408519804f0e46195e920b20cc8d81c0f6519f2bcbd357aa3abb4ae24fee85"},"properties":{"dependency":{"package":"zod","version":"3.25.66","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"8d26f1cfc81fb83091cff12922d6bdb38a771dfb7b17297266061d7713c88722"},"properties":{"dependency":{"package":"lodash","version":"4.17.21","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"18de27ddb56ebd91e3054a6ce2e45a19c552a2742c542c538ec9c01ae2957225"},"properties":{"dependency":{"package":"zod","version":"3.25.66","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"33f278e313e2e672905a6f83309cd0b9bfc6711db9ed471b5c08dc1c6fad7427"},"properties":{"dependency":{"package":"nanoid","version":"5.1.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"e6572227e6d6990d6a54e5b5deed16ecc3eec79959296f2e0cffbe2864171a18"},"properties":{"dependency":{"package":"zod","version":"3.25.66","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"c775be621a3320c2dd54ceb2a45af1c05b5ef78daf73ddfc6d3de9a88774542b"},"properties":{"dependency":{"package":"js-yaml","version":"4.3.0","advisory":"[CVE redacted]","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}},"taxa":[{"id":"CWE-400","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-407","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","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":"22de446894f7c8fca3644e6edc8640402c65fe7f31bfcca3253ff1c131b07515"},"properties":{"dependency":{"package":"brace-expansion","version":"2.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"7f85b110955d6d7d17ff8774d341cfc7dd43c663a490fc1b6fc4f656dc4d581a"},"properties":{"dependency":{"package":"minimatch","version":"9.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"263218bb3e3dbba34a67bbb302927ef2a2b2b4a6b9bc935a66809fd6627657b8"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.12","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"9ddddf25760ade545f8b913041302f196b51f43e5f27145e3cb9cd6cdb1a8185"},"properties":{"dependency":{"package":"flatted","version":"3.3.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"2e24f5131353d8064b6ea3387c939f20bc778b6d096bc3493390b42bcfc9e5bb"},"properties":{"dependency":{"package":"js-yaml","version":"4.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"b4868c5fb54330bdd6871d7724c0183e7ed7fdee5a1000fcf28bcac6eff834da"},"properties":{"dependency":{"package":"nanoid","version":"3.3.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"d2085b632a99b104feeb78edee2b10d112010d87052bf038a3c2caf9700a6d06"},"properties":{"dependency":{"package":"postcss","version":"8.4.31","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"289412f3b2fdc1e1f4ec8eb0c57cfd7b036479a3a4e17d3a65f46e059f22c964"},"properties":{"dependency":{"package":"picomatch","version":"2.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"fc8365c86cf4a6a8c205a57ef1884f81ce3a50a5215fc198d25a01323b405c05"},"properties":{"dependency":{"package":"postcss","version":"8.5.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"ae13d44f888d488a6dc8a7726d8fc6bea7ec8f04d4c020f2af1a34b073fecde5"},"properties":{"dependency":{"package":"sharp","version":"0.34.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"a7594b272f1745e2230a283271d8ab133b5b41e7b36c88d0e268778cc34cb7d6"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"bb3420ea897e10b7fba2c0995f7b641063cf7de91e81c2c1811c9ba282a85595"},"properties":{"dependency":{"package":"picomatch","version":"4.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"ede6e7ded93d3866093273779dee11436905eac9c18a296b4c32793ea21e3fe6"},"properties":{"dependency":{"package":"js-yaml","version":"4.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"57e84d2cbd74d4737e8cb0d29b6c25be6f99cad70bd1f58f1802c11c33bbf15b"},"properties":{"dependency":{"package":"zod","version":"4.0.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"68584e44488e3e66ccd4e876e70f6ca37a7a836e58abfef41bba093c492fa7c8"},"properties":{"dependency":{"package":"glob","version":"11.0.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"86da882f260eeeaa17fa61b11b6bf7d75097112fad035e29907fda25ea9ebcb4"},"properties":{"dependency":{"package":"lodash-es","version":"4.17.21","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"638b2dc166ac4de961b6bd6b865f87e36bd6804ddfb6d22b7711eb1579951be9"},"properties":{"dependency":{"package":"ws","version":"8.18.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"757404610f638191ba8b6a918fbf75b435c3f440e54704a5f90e3802803ff607"},"properties":{"dependency":{"package":"zod","version":"4.0.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"21cf3555650094e7e3146eda9828dd12c5fdebd66edfcd135a72e1346c539570"},"properties":{"dependency":{"package":"postcss","version":"8.5.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"a9bbdde2559f95d898b198a24c08c26ea75818a700b7b5429694dc039eff01e8"},"properties":{"dependency":{"package":"@modelcontextprotocol/sdk","version":"1.29.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"ecc064107c69308da608035080aad6e864ba50ed331307de75d64897bdced517"},"properties":{"dependency":{"package":"@xmldom/xmldom","version":"0.9.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"b2255ec56cd1e86604350ac1bd5a41fb47bc94b757c25dc089432b92d382a75f"},"properties":{"dependency":{"package":"axios","version":"1.17.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"cc1a7a07b2825bf727f2dc887ac40277a313931981080a5888fe397cea1ccb81"},"properties":{"dependency":{"package":"body-parser","version":"2.2.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"15da1aac25357fae3a5dbb6ffdc8c59b1e795444bdcc1886687be8b1935b9de3"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.12","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"e2e90e628de76fd478842edef979759574779e06bea4e5bf616ad25b542495c6"},"properties":{"dependency":{"package":"brace-expansion","version":"2.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"a17cfaf6e9168ac5fd80dcb52caa4b0c3b7549ea811f9ef5dbb41f8716c96af6"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"2019225fb0114500eab6062a50a25af6b1133cc4595738979454d274e032242f"},"properties":{"dependency":{"package":"browserslist","version":"4.28.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"85907780e70378ccbf6eccde0d21cc1a96d4923b61f3359190897cb31f005a04"},"properties":{"dependency":{"package":"deepmerge-ts","version":"7.1.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"f6f837fcf11d2401016057c23f957a1f2bde9aad4d1f0e5de53ea98511e14739"},"properties":{"dependency":{"package":"dompurify","version":"3.2.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"cfd3ee2c8305a43f34b210701346196e4c96d54dadfa53606e1040cb4d7a0e22"},"properties":{"dependency":{"package":"dompurify","version":"3.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"19afccbc7143c649c0017d64401a9aefd8a66bbc8ebe32864c7276cbaad5cbf1"},"properties":{"dependency":{"package":"fast-uri","version":"3.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"1bc4e19c4c1507a9cfc970a4382bb4b590273ebaacd42a7648e6163680adebbf"},"properties":{"dependency":{"package":"flatted","version":"3.3.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"ba9d3aae70f2a49835c01997390f4ab32862cdff222af0d70dd9a2a8106a7e5a"},"properties":{"dependency":{"package":"follow-redirects","version":"1.16.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"1e136885815982c7afbc47f73657f12912830a2943681f20a141eee7bcb89a4c"},"properties":{"dependency":{"package":"form-data","version":"4.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"ffeff3105e6acf4d1ad40bb9812ee343cd75854c5a1c967d1734a7fdfbcc7e31"},"properties":{"dependency":{"package":"glob","version":"10.3.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"typescript2/app-website/scripts/convert-videos.ts","line":21}}}},{"ruleId":"D30","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":"8a8745eff44c7e656ccb76e35c62a9a298f7c730b185f8b500d1459ea75f0bd8"},"properties":{"dependency":{"package":"hono","version":"4.12.23","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"11feab2c8135cb6712e14827be51937d0e2b74d9f3b59d4071f4e228043d7746"},"properties":{"dependency":{"package":"immutable","version":"4.3.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"5b15cdbba8d2175c1342a58677f5539cd35eec3fbd329c25f7e32fb705a002d3"},"properties":{"dependency":{"package":"ip-address","version":"10.2.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"6851952696862a707736caae6b9aa308317b9c3714a8e09e5b6bc881beb7c063"},"properties":{"dependency":{"package":"js-yaml","version":"3.14.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"typescript2/app-developer-docs/lib/content/bridges.ts","line":4}}}},{"ruleId":"D30","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":"0cf5a51986b1d9dfb6d2f2a6f71289e47ae913d747745ca4aeff8c7354dda80a"},"properties":{"dependency":{"package":"jsondiffpatch","version":"0.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"1fc80a81e3bda61f2e94e1ef38fdaf79aa7a6c83cb988862ba31c08790180554"},"properties":{"dependency":{"package":"jsondiffpatch","version":"0.6.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"47208c6485d0a7899e0a49df8fa38400d5edc3711c68496e7539e5f8e092019e"},"properties":{"dependency":{"package":"minimatch","version":"3.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"7550d603248aa1b5e8f57bfa0b033fb309def42b448823fd94624ad391ccc9aa"},"properties":{"dependency":{"package":"minimatch","version":"5.1.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"ac6aa147e8d333148117434e594a6eabef3a4938d1123c10757fe2213b678d0b"},"properties":{"dependency":{"package":"minimatch","version":"9.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"56600d8a901e2468dcd3acb657e4920532353f038a5629035c4ca6b0f5bfb192"},"properties":{"dependency":{"package":"mysql2","version":"3.15.3","advisory":"[GHSA redacted]","aliases":["[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"474787efc2ca79e3c0cbea08516690c2730f1b3aa8bf88b5816498dceef4f90b"},"properties":{"dependency":{"package":"nanoid","version":"3.3.12","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"a814f145dc0e9d450599d9d4fcf7d4fb6f37de848e1caca49ed684d147262c91"},"properties":{"dependency":{"package":"postcss","version":"8.4.31","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"typescript2/app-website/package.json"}}}},{"ruleId":"D30","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":"4a19fb50127e83b47951709a4fa7a61370794b86ce27b2978da2375fbf9f8102"},"properties":{"dependency":{"package":"postcss","version":"8.5.15","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"typescript2/app-website/package.json"}}}},{"ruleId":"D30","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":"972ce6357965a3899c83a477d1f9df165bdb51d8d16853b2d293c8cf59540aac"},"properties":{"dependency":{"package":"rollup","version":"4.54.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"9cbcd2bfcc0771cc018a6b58fbd5308633285a8d723f2616a6c1bbc674c02846"},"properties":{"dependency":{"package":"sharp","version":"0.34.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"typescript2/app-product-metrics/src/chart-image.ts","line":1}}}},{"ruleId":"D30","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":"e6c6079ee584e593c7a0a0b460e72d72b97a5fddddd02dbf0e006bc10e33e2c6"},"properties":{"dependency":{"package":"sharp","version":"0.35.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"typescript2/app-product-metrics/src/chart-image.ts","line":1}}}},{"ruleId":"D30","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":"bdba13a2a54c94e4c1789900cc9c33038e4bbd171041666daf955776031c5f44"},"properties":{"dependency":{"package":"sharp","version":"0.35.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"typescript2/app-product-metrics/src/chart-image.ts","line":1}}}},{"ruleId":"D30","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":"191912c05f50cc81ce3da5d2434fc0de528e0168d082e2f2fbd3e11800c6a884"},"properties":{"dependency":{"package":"smol-toml","version":"1.6.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"54b471998e33e5cfaee639f399947acc479bbd83476db3ed09a168efa478d035"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"5636d267bd1c965df8862ae326b3cf0d8284b6321ddc83d3d668b8a7d2fa7616"},"properties":{"dependency":{"package":"vite","version":"6.4.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"typescript2/app-speedtest/vite.config.ts","line":2}}}},{"ruleId":"D30","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":"7018a1ce0947f36103a25b2c00c4f456ad1b88e9c36fc11e859b5585a03d6bdc"},"properties":{"dependency":{"package":"vite","version":"7.3.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"typescript2/app-speedtest/vite.config.ts","line":2}}}},{"ruleId":"D30","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":"fc5565be9ffbe8ce877f24aaaa588381c0e606c7ef23999a2935fc0aca0b8a3f"},"properties":{"dependency":{"package":"vite","version":"8.0.14","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"typescript2/app-speedtest/vite.config.ts","line":2}}}},{"ruleId":"D30","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":"917d8612fb91e9f7d6a37d888c05e40ede5e1bae65c558ea31925808e2c06c10"},"properties":{"dependency":{"package":"ws","version":"8.20.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"typescript2/app-website/lessons/watcher.ts","line":7}}}},{"ruleId":"D30","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":"2e7f674e1f7aed2b4389720e1bb055ad82b0908b258e0a8a7722bbbc9576e55d"},"properties":{"dependency":{"package":"zod","version":"3.25.76","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"typescript2/app-developer-docs/components/docs-sidebar.tsx","line":7}}}},{"ruleId":"D30","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":"6bd8a6c363e85ce78195858635ecbaa1dd87ac901da8c4780900d2904d618ee4"},"properties":{"dependency":{"package":"zod","version":"4.5.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"typescript2/app-developer-docs/components/docs-sidebar.tsx","line":7}}}},{"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":"f228e9674525742551d710208c172c987fd5717852a02375b43b2da90526918b"},"properties":{"dependency":{"package":"basic-toml","version":"0.1.10","advisory":"RUSTSEC-2026-0374","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf6bd00e89d82c7799c3a3de8d3c305d4eaf649016d245e36125ae54a96caee2"},"properties":{"dependency":{"package":"ctutils","version":"0.4.2","advisory":"RUSTSEC-2026-0385","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"53597855bd62b382163d39a3e6cdbe73004612801dec7359d7ee0472152149c7"},"properties":{"dependency":{"package":"instant","version":"0.1.13","advisory":"RUSTSEC-2024-0384","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ea191f1bfb9913ef4cd730c141b4e4146bc04555df165e8344b217fdbc8fb987"},"properties":{"dependency":{"package":"libsqlite3-sys","version":"0.35.0","advisory":"RUSTSEC-2026-0459","aliases":["[CVE redacted]","[GHSA redacted]","RUSTSEC-2026-0502"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ffb2c5a9b8ca60320f4c54c49b7ea70875bb0e8145d82d263c4da062070645a"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ce28b4d31dc906c23f68d250c2e6eec856f77faf329fc4bd0f21f4afd4d2bfc"},"properties":{"dependency":{"package":"pulldown-cmark","version":"0.13.5","advisory":"RUSTSEC-2026-0433","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"74288fa64d206468b6d619009d5b282cb06ff21be0885bf0d827192ff7432970"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.14","advisory":"RUSTSEC-2026-0538","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6729741ea1097f4c66a4f54f252288ef847bab0b45e3639e36b35a2b4df26e22"},"properties":{"dependency":{"package":"rsa","version":"0.9.10","advisory":"RUSTSEC-2023-0071","aliases":["[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"86dabb83e8c28aa759517ddc2efc5ea1fa03136ea7dc875713ddbf13e2338b50"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5c283bf091eef29bcd491777946d06ed15e66fe6aa32f7469ea324337a47b87"},"properties":{"dependency":{"package":"rustls-pemfile","version":"2.2.0","advisory":"RUSTSEC-2025-0134","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"154ee4010a9efaa33e31eb8f5908870ac6d7a36e462abdd9fd4f1bb4269e0eb3"},"properties":{"dependency":{"package":"tokio","version":"1.52.3","advisory":"RUSTSEC-2026-0386","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3a1b9384e06d2f3afea6fa33629a21e7eb94faad88c74be8c57f2add2302e6af"},"properties":{"dependency":{"package":"unic-char-property","version":"0.9.0","advisory":"RUSTSEC-2025-0081","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5f7a71cafba2c8ee5f5de251e4dfc41d0b622092627b67e8aa96b91059e2c47b"},"properties":{"dependency":{"package":"unic-char-range","version":"0.9.0","advisory":"RUSTSEC-2025-0075","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"117d1fdb5822ba7629fefb7864a6436755c6e1e103d904582f3a1dbb0fc8fbf9"},"properties":{"dependency":{"package":"unic-common","version":"0.9.0","advisory":"RUSTSEC-2025-0080","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"df938b57344fc3b9e62f32888f1e5f51d95e128ab9f9304308fafcb3e321d93f"},"properties":{"dependency":{"package":"unic-emoji-char","version":"0.9.0","advisory":"RUSTSEC-2025-0090","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"87fa3e55d455104a0cca03846cdf228b2c721daf4613a62ed508289962f1e7f8"},"properties":{"dependency":{"package":"unic-ucd-ident","version":"0.9.0","advisory":"RUSTSEC-2025-0100","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"77c4d8ce67635411e09f1ad750e22dd6dbf30093bff51f036d2b203f77f63077"},"properties":{"dependency":{"package":"unic-ucd-version","version":"0.9.0","advisory":"RUSTSEC-2025-0098","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ebfdec6e55fb1883feb287eccf6c52b5c66192927ceed8a3192496e5cdd1f254"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.14","advisory":"RUSTSEC-2026-0538","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63120c4c57bd73427d4334263b8fbcf3802dc7a44bd820340fcbd7e968bfe416"},"properties":{"dependency":{"package":"rustls","version":"0.23.40","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0285","RUSTSEC-2026-0346","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f75a1e940843aea13edce32edd0963022053065d36ff14b50753919df23a2eed"},"properties":{"dependency":{"package":"tokio","version":"1.52.3","advisory":"RUSTSEC-2026-0386","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b67cf23061abae12e8a28b642cf7d45bca15765a719a78570abe0ad091f35971"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.14","advisory":"RUSTSEC-2026-0538","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6adadfa7e8d658e2168c69cb70bf1576294f4ef0431d2a6718f771d7fe95122b"},"properties":{"dependency":{"package":"rsa","version":"0.9.10","advisory":"RUSTSEC-2023-0071","aliases":["[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d4bf9a26662c45452fb91180b56810db8cc0ff426202cc74ac224224604305c1"},"properties":{"dependency":{"package":"rustls","version":"0.23.40","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0285","RUSTSEC-2026-0346","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46aaca9d96ba12af063e707d29e21119376b9af337eca441e84f9275b17114f4"},"properties":{"dependency":{"package":"tokio","version":"1.52.3","advisory":"RUSTSEC-2026-0386","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"94d4a9b4fde951afcaca73b18337bf9c11d402954b74d673feb0b6762dc7c286"},"properties":{"dependency":{"package":"stdlib","version":"1.23.99","advisory":"GO-2025-4006","aliases":["BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"baml_language/sdks/go/baml_go/runtime_artifact.go","line":486,"symbol":"http.NewRequestWithContext"}}}},{"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":"d104f024a08dd44f5f5c8f6aeb3da2c079b2b77b5cc8550c16704c8fb2526d26"},"properties":{"dependency":{"package":"pygments","version":"2.19.2","advisory":"PYSEC-2026-2987","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf71a2cbc328f4a7e55b3927c844e7bf7d6540960c1e80f0a1c173861a5cc36a"},"properties":{"dependency":{"package":"pytest","version":"9.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-1845"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7388d74f887a86bd0ef3c7d85888e6e585c4dc6d9c7a758051b4d984c2fea9e"},"properties":{"dependency":{"package":"setuptools","version":"82.0.0","advisory":"[GHSA redacted]","aliases":["BIT-setuptools-2026-59890","[CVE redacted]","[GHSA redacted]","PYSEC-2026-3447"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e4692809ada193410264672b33b538b988fbcbf2f800ce4e9dca731edca485a8"},"properties":{"dependency":{"package":"setuptools","version":"82.0.1","advisory":"[GHSA redacted]","aliases":["BIT-setuptools-2026-59890","[CVE redacted]","[GHSA redacted]","PYSEC-2026-3447"],"reachability":{"kind":"not-imported"}}}},{"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":"c16b5612293922aefc0a6fc276810c370ef2e184af60b08483e9101fd8f58ad9"},"properties":{"dependency":{"package":"setuptools","version":"82.0.1","advisory":"[GHSA redacted]","aliases":["BIT-setuptools-2026-59890","[CVE redacted]","[GHSA redacted]","PYSEC-2026-3447"],"reachability":{"kind":"not-imported"}}}},{"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":"62d70d90467112749dc625f18674d38bce0f26bacedf11dddbe903353c9f1af4"},"properties":{"dependency":{"package":"anyhow","version":"1.0.98","advisory":"RUSTSEC-2026-0190","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e7a64b7b3dcfb0ef23d0337676b54a828f854e8a26a712bcdf2837c5b212e4f9"},"properties":{"dependency":{"package":"async-std","version":"1.13.1","advisory":"RUSTSEC-2025-0052","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"802cd679da6b94e51ac32ef37c8a88b5113961c0b508dc352ddbb225db454fc8"},"properties":{"dependency":{"package":"basic-toml","version":"0.1.10","advisory":"RUSTSEC-2026-0374","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"042b16212a223d44daf09e1002909e3f6160dd8de0518192bd56631725c49c53"},"properties":{"dependency":{"package":"bytes","version":"1.10.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","RUSTSEC-2026-0007"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed9a00be674d3a1fc2fa1a08d2e04f982ec78a59bece48ca1b3ebef6ce7da23c"},"properties":{"dependency":{"package":"crossbeam-epoch","version":"0.9.18","advisory":"RUSTSEC-2026-0204","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"80c2c346d5626a5a353511093cf882fcbf53b4042b612be163fc683f088338d4"},"properties":{"dependency":{"package":"difference","version":"2.0.0","advisory":"RUSTSEC-2020-0095","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6453c141f7cf298d51200bdcb0d407b06328b899e247ccbfe664cfb5502820c2"},"properties":{"dependency":{"package":"event-listener","version":"5.4.0","advisory":"RUSTSEC-2026-0221","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"df82aacf5566d59bdd22839b99fefafcc872834cabd0085d421480ab5b358ddd"},"properties":{"dependency":{"package":"h2","version":"0.4.12","advisory":"RUSTSEC-2026-0258","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f6ddb871063e4638c812e1f6314d880b82869d4cb233e89071a5a92ea83295c3"},"properties":{"dependency":{"package":"jsonwebtoken","version":"9.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2999413b54f73687e4aec61df9d26cff07053830b79877f4852afabd571c0c4c"},"properties":{"dependency":{"package":"lru","version":"0.12.5","advisory":"RUSTSEC-2026-0002","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb165fdac99807b72f7638ef5e7f671f7ad094bb20ffbc174f807662a5ba6229"},"properties":{"dependency":{"package":"lru","version":"0.12.5","advisory":"RUSTSEC-2026-0253","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9a6d189d0cbc8ba9834fa2a6a9fe3bed7237642e62f9bb15d3bd54a94c281119"},"properties":{"dependency":{"package":"number_prefix","version":"0.4.0","advisory":"RUSTSEC-2025-0119","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a50f37b3f84435a418103f25d49d743acca1983aa75ea269e15db07cf2de0409"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"26f551bc39ee5a7b7eadca24b409c5805f64144d9cf5b591e2e6db8f716d8a2c"},"properties":{"dependency":{"package":"pin-utils","version":"0.1.0","advisory":"RUSTSEC-2026-0441","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"74e59ea7c4418449169163a49e49b480ea860ae14e3f3ea0dc36e07f7d955429"},"properties":{"dependency":{"package":"pulldown-cmark","version":"0.13.0","advisory":"RUSTSEC-2026-0414","aliases":["RUSTSEC-2026-0433"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"393c15f195a716b6478168a33506a6fd72aa2543a18da75da86b0287cf85469b"},"properties":{"dependency":{"package":"quick-xml","version":"0.31.0","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a61cf9bea5f43152f3d959c429b426d354a0a3b366587df6749536adb86d1e56"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.14","advisory":"RUSTSEC-2026-0538","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"262d88ccd692d626adb9fe09463da128d966131b7eb9abbaf330b688ee48582a"},"properties":{"dependency":{"package":"rand","version":"0.8.5","advisory":"RUSTSEC-2026-0097","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"30b7654b89a9cad4ad4697e295572c0c15e009d075f4e0a604dddf6d8bed835f"},"properties":{"dependency":{"package":"rand","version":"0.9.2","advisory":"RUSTSEC-2026-0097","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fa46d1de8541ae124b6e218fc3c6149dc24a7db55973e64fcce064121aed5786"},"properties":{"dependency":{"package":"rustix","version":"1.0.7","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e0a970faa77b1ccce5e48c2c104b6b29c2b4029ddcf8f67030b29939c7a78254"},"properties":{"dependency":{"package":"rustls","version":"0.23.28","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0285","RUSTSEC-2026-0346","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7317254f59255c7711bca16a96be3146e513b9de558f7247d786d798d6348193"},"properties":{"dependency":{"package":"rustls-pemfile","version":"2.2.0","advisory":"RUSTSEC-2025-0134","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"513a07900c49587ea1bd54f946d6b8fd192f8a049d7bd2164d0c5dc5cba6eece"},"properties":{"dependency":{"package":"scc","version":"2.3.4","advisory":"RUSTSEC-2026-0205","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"33704196e7544eb55fe19584ff5d89c5f98c4809a5596f7868cb0bee7e169aa2"},"properties":{"dependency":{"package":"serde_with","version":"3.13.0","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b39048b1f5964a11552b1dd4a3206f30f3490d7f722f825c55570b3ac6db22c5"},"properties":{"dependency":{"package":"slab","version":"0.4.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","RUSTSEC-2025-0047"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"30e44f28e78153258fbb3471d5fdbbf703182513f543445941931a3245f89be5"},"properties":{"dependency":{"package":"tar","version":"0.4.44","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0067","RUSTSEC-2026-0068"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3fdf1cf5bc5cf29103eabb0f4a24cf2fb4b72c5932eea6565f910e51c1ff30a4"},"properties":{"dependency":{"package":"time","version":"0.3.43","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","RUSTSEC-2026-0009"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9e6fb448dde6fefe8f6f4c556b74367d95811805137ef86190675b31389024a0"},"properties":{"dependency":{"package":"tokio","version":"1.45.1","advisory":"RUSTSEC-2026-0386","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cf7314e90e9bdd9e3f5b3c99a05aad8ab673695c13801ebe7c0553ab52e10492"},"properties":{"dependency":{"package":"tracing-subscriber","version":"0.3.19","advisory":"RUSTSEC-2025-0055","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6097bcbdad0f98dcb5a565136155d6181bbda8b6d17833276df9b9c8d04e0658"},"properties":{"dependency":{"package":"unsafe-libyaml","version":"0.2.11","advisory":"RUSTSEC-2024-0449","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"55dbe8f53f6ed1a6e2f25fdd4afb180abd2e4ad281ab3ca111f222b0f4c43e85"},"properties":{"dependency":{"package":"webbrowser","version":"0.8.15","advisory":"RUSTSEC-2026-0257","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5bf3c70e70a67ff74a2b538cc5d7cad094d5d739c1e38a2793abd02eeac09d39"},"properties":{"dependency":{"package":"webbrowser","version":"1.0.5","advisory":"RUSTSEC-2026-0257","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"245bb230f0d05a5b5408e2d7cdbcfa9ea8820223d1c401f43d277e92ae107986"},"properties":{"dependency":{"package":"stdlib","version":"1.24.0","advisory":"GO-2025-3503","aliases":["BIT-golang-2025-0913","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-22874","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-3563","GO-2025-3749","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"not-imported"}}}},{"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":"5e976f2e42e2342b6de169952d056a0c981266e3a0b2d82c290f97f039ae8d4a"},"properties":{"dependency":{"package":"stdlib","version":"1.24.0","advisory":"GO-2025-3503","aliases":["BIT-golang-2025-0913","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-22874","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-3563","GO-2025-3749","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"not-imported"}}}},{"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":"ccabad8f9fe490e47eb0a402e7c08a7d21a3d4f81cc41f5b5377bbb6c1d7148e"},"properties":{"dependency":{"package":"stdlib","version":"1.24.0","advisory":"GO-2025-3503","aliases":["BIT-golang-2025-0913","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-22874","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-3563","GO-2025-3749","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"not-imported"}}}},{"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":"e3ac72bcc03f9dc22764869b7a56afbd1c31f134b8020368789a208bbdbb3d97"},"properties":{"dependency":{"package":"stdlib","version":"1.24.0","advisory":"GO-2025-3503","aliases":["BIT-golang-2025-0913","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-22874","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-3563","GO-2025-3749","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"not-imported"}}}},{"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":"b27e83ff51924029bebadb9b89ae8b139e4e6908172a04d510ab4054f836b3ce"},"properties":{"dependency":{"package":"stdlib","version":"1.24.0","advisory":"GO-2025-3503","aliases":["BIT-golang-2025-0913","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-22874","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-3563","GO-2025-3749","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"not-imported"}}}},{"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":"a27aa36a3c0683cb77f2468b19ece308126360aa14f90152df0411b7804aed1c"},"properties":{"dependency":{"package":"stdlib","version":"1.24.0","advisory":"GO-2025-3503","aliases":["BIT-golang-2025-0913","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-22874","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-3563","GO-2025-3749","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"not-imported"}}}},{"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":"eeabf3e7b3b189daada255a789030bd87099b3a481d5de5ee79a5bb78c8a0547"},"properties":{"dependency":{"package":"stdlib","version":"1.24.0","advisory":"GO-2025-3503","aliases":["BIT-golang-2025-0913","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-22874","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-3563","GO-2025-3749","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"not-imported"}}}},{"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":"b7ca3b33f8203cc8ca8bb099f32bf774f0017547e30fba5deff0ec824b0113b7"},"properties":{"dependency":{"package":"stdlib","version":"1.24.0","advisory":"GO-2025-3503","aliases":["BIT-golang-2025-0913","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-22874","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-3563","GO-2025-3749","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"not-imported"}}}},{"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":"851fa36ec0cd4870c3d235d01133e69f1e8aa97cf444fdb191fc4fa53b284be9"},"properties":{"dependency":{"package":"stdlib","version":"1.24.0","advisory":"GO-2025-3503","aliases":["BIT-golang-2025-0913","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-22874","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-3563","GO-2025-3749","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"not-imported"}}}},{"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":"6d53921e1810c9395f63d54b2d6dbd67d92b6612c48b9f9bdecf44f93de8ad73"},"properties":{"dependency":{"package":"stdlib","version":"1.24.0","advisory":"GO-2025-3503","aliases":["BIT-golang-2025-0913","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-22874","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-3563","GO-2025-3749","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"not-imported"}}}},{"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":"c2666d8e2ad601a00567c9031116f8858110c1c28b11f66511d64babd9a7e3c0"},"properties":{"dependency":{"package":"stdlib","version":"1.24.0","advisory":"GO-2025-3503","aliases":["BIT-golang-2025-0913","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-22874","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-3563","GO-2025-3749","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"not-imported"}}}},{"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":"39027f0b4b89daf4d85cb2e6bb255d1a1a719006cbbaff1dc547a0d248c0c5ca"},"properties":{"dependency":{"package":"stdlib","version":"1.24.0","advisory":"GO-2025-3503","aliases":["BIT-golang-2025-0913","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-22874","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-3563","GO-2025-3749","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"not-imported"}}}},{"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":"51c31846967297673a0c5ff0437b9e6211466b20af99638f17839a94b1e6cdd8"},"properties":{"dependency":{"package":"stdlib","version":"1.24.0","advisory":"GO-2025-3503","aliases":["BIT-golang-2025-0913","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-22874","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-3563","GO-2025-3749","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"not-imported"}}}},{"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":"20b4e3da2f942316e4bfcc21e4702df31e6928fdd3e4aae958b46a7e016380ff"},"properties":{"dependency":{"package":"stdlib","version":"1.24.0","advisory":"GO-2025-3503","aliases":["BIT-golang-2025-0913","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-22874","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-3563","GO-2025-3749","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"not-imported"}}}},{"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":"0cc1dc5ddb0397450c7ec9d39491c1065c17a68bc03963a01bc2e53f7c6f50fb"},"properties":{"dependency":{"package":"stdlib","version":"1.24.0","advisory":"GO-2025-3503","aliases":["BIT-golang-2025-0913","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-22874","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-3563","GO-2025-3749","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"not-imported"}}}},{"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":"ec9c1e1ca588eddc7fb83466cbe2159de3a3b309d63b4be4b0dfc04c3929ceef"},"properties":{"dependency":{"package":"stdlib","version":"1.24.0","advisory":"GO-2025-3503","aliases":["BIT-golang-2025-0913","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-22874","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-3563","GO-2025-3749","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"not-imported"}}}},{"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":"276ddd9f4b4f18c6c3dee43085e92a02d0cd9954c40e398a9d419089f6d7cf82"},"properties":{"dependency":{"package":"stdlib","version":"1.24.0","advisory":"GO-2025-3503","aliases":["BIT-golang-2025-0913","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-22874","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-3563","GO-2025-3749","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"not-imported"}}}},{"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":"9a540453ab5fe9346db676c63b4e53df6ffb278c359fff3b73191fc7c519227f"},"properties":{"dependency":{"package":"anyhow","version":"1.0.82","advisory":"RUSTSEC-2026-0190","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"feb04da4b66edcd654908bac6bf5f3238872c047b2428472f3587ee7dbde3b88"},"properties":{"dependency":{"package":"anyhow","version":"1.0.100","advisory":"RUSTSEC-2026-0190","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f6dd10838353f498abeda305d93228c2c89bee93e6a6a15ad8aad8b1356b130e"},"properties":{"dependency":{"package":"pin-utils","version":"0.1.0","advisory":"RUSTSEC-2026-0441","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1015d72eada832dbef6d9a1fe8da3c54ac3e7f340a51ef20d8d8494a510c5b0e"},"properties":{"dependency":{"package":"stdlib","version":"1.24.0","advisory":"GO-2025-3503","aliases":["BIT-golang-2025-0913","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-22874","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-3563","GO-2025-3749","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"baml_language/sdks/go/baml_go/runtime_artifact.go","line":486,"symbol":"http.NewRequestWithContext"}}}},{"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":"e76195978b162a45d3741040d6f92f7b5ca9470170093fc4a24a73142c301913"},"properties":{"dependency":{"package":"anyhow","version":"1.0.100","advisory":"RUSTSEC-2026-0190","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"02e3e608db8d5aa5bc7e6e2aefa2bedb05218ededd4ab9632fd4515d53cd4a2a"},"properties":{"dependency":{"package":"bytes","version":"1.11.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","RUSTSEC-2026-0007"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8b6fb565503d7e6a88b9a88792e60851a7749ebffef6dd7a22c450d0876fef44"},"properties":{"dependency":{"package":"event-listener","version":"5.4.1","advisory":"RUSTSEC-2026-0221","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4085986bb8bbcedcf0c5824416edda39b22114ca1d53c68af2099237a80a6993"},"properties":{"dependency":{"package":"pin-utils","version":"0.1.0","advisory":"RUSTSEC-2026-0441","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fc1ea0583f4373af597b979f9cea235719980d70c501665914b92e29ac4fa361"},"properties":{"dependency":{"package":"rustix","version":"1.1.2","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a63d80ca67d8a74657fa8693382701a34b8880148b3ffb36f17f73080b824c7b"},"properties":{"dependency":{"package":"rustls","version":"0.23.35","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0285","RUSTSEC-2026-0346","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b751d6ba6b63266833047736c5a320789e0e614ac0c57012899a998341b38cd"},"properties":{"dependency":{"package":"pygments","version":"2.19.1","advisory":"PYSEC-2026-2987","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"3cff787068b1123c6a2cadbdd195f7a208d9338c0898ee2221bbe5cb45d6d569"},"properties":{"dependency":{"package":"ajv","version":"6.12.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"1f00af2c2678424e8a3854b0ef90c18cd33437ac081c59ea1f71ada879da1964"},"properties":{"dependency":{"package":"@vitest/mocker","version":"3.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"afb636698d60f2aa91c511df7a70f49e1dc2f850baac7f5e1dc1fb380b7f0b5a"},"properties":{"dependency":{"package":"protobufjs-cli","version":"1.3.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"test-or-tooling","file":"baml_language/sdks/typescript/bridge_typescript/package.json"}}}},{"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":"51ee8d8041dfb28a33b346290d4effd628621ee68df23935e4ee8bf17d2f19d8"},"properties":{"dependency":{"package":"protobufjs","version":"7.6.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e849686b02798d604b2e4b469fa4780e1b143c9f011ff3615db4d4d550716cc9"},"properties":{"dependency":{"package":"vitest","version":"3.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"test-or-tooling","file":"baml_language/sdks/typescript/bridge_typescript/tests/host_callable.test.ts","line":34}}}},{"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":"2ce5db8a21b585afbd46f2f5742b54e4f5635c369cf8b8da42cff9374f10f711"},"properties":{"dependency":{"package":"@vitest/mocker","version":"4.1.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"3a16398b6af4d53f9bb312acd8899cdbff15066110ad3e8c31811ddc835de865"},"properties":{"dependency":{"package":"postcss","version":"8.5.19","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac406ca605a37a9e509ed323c98df7d0216e4d4e08fd0bfa46c85cced640ea6c"},"properties":{"dependency":{"package":"vitest","version":"4.1.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"baml_language/sdks/typescript/bridge_typescript_web/vitest.web.config.ts","line":3}}}},{"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":"c8e1d63b642ded470c1db458b3f7b362cac212e2fbb17044f82c64aa965bb4a4"},"properties":{"dependency":{"package":"turbo","version":"2.5.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b3d0afc611d5d7b36cd3dbb34ab0bb8b11bd365187e2a3204fbf3ec48a4a4acc"},"properties":{"dependency":{"package":"@vitest/mocker","version":"3.2.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"572de3f7a88fd28ecc11762a7547e863305db1147efb07c7d9bab2085ca42c9f"},"properties":{"dependency":{"package":"@vitest/mocker","version":"3.2.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"ad6aae0d642cbf2142356e4c4348e9623ce0a7f90111f9c4b5759dafe04e979d"},"properties":{"dependency":{"package":"@vitest/mocker","version":"4.0.15","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"b7bda289298f8c7b577c3df21f51a6fc17f92b7e23b2a76b5f7c4731a8327d8c"},"properties":{"dependency":{"package":"ajv","version":"8.17.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"92da29f94e263abea0ade968703748a9c42d1739d2b2b4fd0b3d8bd698b99428"},"properties":{"dependency":{"package":"ajv","version":"8.6.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"8ff4501a0b6eb84bb92385b6433ad1c9d658a3cd9dbc3a993388fb9e366aa074"},"properties":{"dependency":{"package":"esbuild","version":"0.21.5","advisory":"[GHSA redacted]","reachability":{"kind":"production","file":"baml_language/sdks/typescript/bridge_typescript_web/scripts/sync-node-runtime.mjs","line":4}}}},{"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":"807a0c81dbeea32151e3dd6d04af3aa1757b988b63b7510525a506848700c5d7"},"properties":{"dependency":{"package":"fflate","version":"0.4.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"bf95dbf62a2f67c642f4b6c25b4e17b0885bc3b472effe469ffe31b3e63b798b"},"properties":{"dependency":{"package":"fflate","version":"0.8.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"8ad99cb4954b0f40a074c9b419d41dde3c5238c306ff64bb372d7d4805267e0f"},"properties":{"dependency":{"package":"follow-redirects","version":"1.15.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"ea7e5354ab7cfc90dd177dde60810f39ea3e10b3fe5c807ca0b2b906b7004ac5"},"properties":{"dependency":{"package":"glob","version":"13.0.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"test-or-tooling","file":"typescript2/app-website/scripts/convert-videos.ts","line":21}}}},{"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":"77595ddeb2a6b879721911aadde164fd7862ca58273f1b37abcf5a8d19439247"},"properties":{"dependency":{"package":"mdast-util-to-hast","version":"13.2.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"9f9969cc1dcef0e64fdd2efb47b4f5e837c1cd854c95ddd0d8beef9c7c6a680f"},"properties":{"dependency":{"package":"mermaid","version":"11.9.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"engine/baml-runtime/src/control_flow/mermaid-sandbox/app/components/MermaidDiagram.tsx","line":3}}}},{"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":"c3bac0b956cc7625db5ffaa04443fc36030c2af44043a6f2dfd365abaf694f40"},"properties":{"dependency":{"package":"minimatch","version":"10.2.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"8da3c7423cde165bcf2b646f1c667dbc5629522142c55650a7273a26c1ab6153"},"properties":{"dependency":{"package":"postcss-selector-parser","version":"6.0.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"a7dea074b5caece6308d2a545b31465c9c4d16fe41b5507b0ced1c867ca96b4e"},"properties":{"dependency":{"package":"postcss-selector-parser","version":"6.1.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"c4a3d5aba9d7091ae3391a6d5d83846e94b8b62f11b9a2ec054dcd0706a5bc1b"},"properties":{"dependency":{"package":"protobufjs","version":"7.6.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9fa903053a3f312606416859cb67a9d184205be1a801337492ae8f642ebf9203"},"properties":{"dependency":{"package":"qs","version":"6.14.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"7814cce334b52f37373b221d1e431faf0f063fcfa3515d254ad139e207e66dae"},"properties":{"dependency":{"package":"srvx","version":"0.8.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"c67cee498677c2b62169175c358fc711086578321997d87223c1c0e899f525e6"},"properties":{"dependency":{"package":"uuid","version":"10.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"43a6a50e54e18eeb8064c6fab891ef51b9aa734eb782f825054b471baae0a16b"},"properties":{"dependency":{"package":"uuid","version":"8.3.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e57c74e648aa4d46b35aea7dd1b23993c8175ce070ab9d1954f1a639cd44e274"},"properties":{"dependency":{"package":"uuid","version":"9.0.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"db2027e46216bd7fc7003d7b210e080527329a773c8eac0bae7d21f06e7deec5"},"properties":{"dependency":{"package":"vercel","version":"52.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"test-or-tooling","file":"package.json"}}}},{"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":"5f6af5300f1264a3e8ac12c9a856a3dac688221c3097b6653eef5fe35530e227"},"properties":{"dependency":{"package":"vite-plugin-static-copy","version":"3.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"test-or-tooling","file":"typescript/apps/playground/vite.config.ts","line":7}}}},{"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":"cab2098e551f88d096756eea896ab201fc72ec0275bddc366f276c5eb947889d"},"properties":{"dependency":{"package":"yaml","version":"2.8.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"engine/baml-runtime/src/control_flow/mermaid-sandbox/app/page.tsx","line":3}}}},{"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":"59c79517bdd7e878b8c5d694c5505219e2ae0de115442b3270daedefe70df7f9"},"properties":{"dependency":{"package":"yauzl","version":"3.2.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"4fc59d2bb0bcfdf1caa9ee50292de689f101a69437def8b66be9ab9b2d2b2ac0"},"properties":{"dependency":{"package":"uuid","version":"11.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"333069e671945e55f0a035a05a7e597d82409b7d94a0bec57a034cb4ddabf55c"},"properties":{"dependency":{"package":"@humanfs/node","version":"0.16.7","advisory":"[GHSA redacted]","reachability":{"kind":"not-imported"}}}},{"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":"3df872513667baaa4fca375bbb3c364f0d2dd3dc42f84eb131f5af5271ec455c"},"properties":{"dependency":{"package":"mermaid","version":"11.16.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"typescript2/app-beps/src/components/ui/mermaid-diagram.tsx","line":36}}}},{"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":"f73a8accd315a7c27320318db41f3d57134edaff42c9963370d2d6d50e49ae91"},"properties":{"dependency":{"package":"postcss-selector-parser","version":"6.0.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"59be9cff08a3c88b4e223ba98495aec5fcdabc156deabdbf05de96de6144d679"},"properties":{"dependency":{"package":"uuid","version":"13.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"baa72544a0956015098dd00fe2d5d9dd8c48883d3cc273f7e39fa1160dfa4abc"},"properties":{"dependency":{"package":"zx","version":"8.7.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f52fadef870d0271c2f7c8449168f09763152824563f28eb1ed6f60d5380e8cb"},"properties":{"dependency":{"package":"turbo","version":"2.9.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"792af580fdf0ac52b0832b8f8949a38fee52001a05f9a42921f2d412c9bca15f"},"properties":{"dependency":{"package":"@hono/node-server","version":"1.19.14","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"01cc58c5f7844dc453df28aaccbf1445ca3183847808eb51ec5d97e0991ee240"},"properties":{"dependency":{"package":"@vitest/mocker","version":"4.0.16","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"4c46de1974c427ed132eb5023df528cfe60c95c444edad8e6761cc898571d9ed"},"properties":{"dependency":{"package":"ajv","version":"6.12.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"5d65db556d0e9e98608ce7b51a3a47586d4e9d9bcb2000da6238a9987a279153"},"properties":{"dependency":{"package":"glob","version":"13.0.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"test-or-tooling","file":"typescript2/app-website/scripts/convert-videos.ts","line":21}}}},{"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":"d3fa49a77c52694b6e115f7d5436ccd363681870a4cc3c21eaf60c668a696545"},"properties":{"dependency":{"package":"mermaid","version":"11.16.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"typescript2/app-beps/src/components/ui/mermaid-diagram.tsx","line":36}}}},{"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":"f7a2c63d72e9ee866e383dc1e6fc56cf7a1c39de5e58eff56b24e432ff115aab"},"properties":{"dependency":{"package":"minimatch","version":"10.2.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"1bbf6a1c4522d8ce2fbba41d3f911ee27fffa4b4f28a10a118bda7874e957a82"},"properties":{"dependency":{"package":"postcss-selector-parser","version":"6.0.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"a27d32e6d36fcffda084fe8e10a27059e2b37fad1a2b9e00cb9941bf61460605"},"properties":{"dependency":{"package":"postcss-selector-parser","version":"7.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"0070fdd5ae558814369087780bb723e6b511935a769098391e3f412f55a2aa52"},"properties":{"dependency":{"package":"qs","version":"6.15.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"6af1324f8099d86d329c8a80c10f0bcffb5263b68b23acbd50c20d89ec7441cb"},"properties":{"dependency":{"package":"turbo","version":"2.8.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"typescript2/package.json"}}}},{"ruleId":"D30","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":"d13daf0393069292728241e2112b3acdbb5c7756602c1c25c7a523d23d0e6646"},"properties":{"dependency":{"package":"xxhash-rust","version":"0.8.15","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"0ea02e71cb9ede717da6c5bc5a2e5848573852cc044d56a7f1aef7c5bcf342cf"},"properties":{"dependency":{"package":"aws-sdk-bedrockruntime","version":"1.106.0","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"a89a0078f9c90fa8dfe0d864c85e7a20afca65f246864c4ec0c9ae6f8deed1e9"},"properties":{"dependency":{"package":"aws-sdk-sso","version":"1.73.0","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"0eb5b87efcc3a4ea0ccaca8345b4900226f908559a84dfa4b04610ba02e9997d"},"properties":{"dependency":{"package":"aws-sdk-ssooidc","version":"1.74.0","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"23d6fac690042056335a654b61d937827f4abf4aed96aca42d1ffda3fe27797d"},"properties":{"dependency":{"package":"aws-sdk-sts","version":"1.75.0","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"5f9831291a2e000d06f10282272ed12db06ac3c2b7f1a37575dbd42b197200ba"},"properties":{"dependency":{"package":"diff","version":"5.2.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"0fadb5434ed47599807df84abfdb4a5de8acddaedae4a962c4ad22a1d0e09769"},"properties":{"dependency":{"package":"esbuild","version":"0.27.7","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"f392b1419f96aa208ac2115d3c34c2f00540ad0c5381e81423f8727e54319f35"},"properties":{"dependency":{"package":"@babel/core","version":"7.27.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"f7518778193e79315a047e2cc5376b03a6e62d47ab6e48e1fe6cc61f5a69e6b9"},"properties":{"dependency":{"package":"@babel/core","version":"7.28.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"941b055ebdbf591354ad9b9a0792cc77f8cec182a53cbaae480b92c0decd0e81"},"properties":{"dependency":{"package":"@smithy/config-resolver","version":"3.0.13","advisory":"[GHSA redacted]","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"3995edc49b21111f3f5118089a107f1a7db507f09d5407077da38cb308ff3cb5"},"properties":{"dependency":{"package":"@smithy/config-resolver","version":"4.1.4","advisory":"[GHSA redacted]","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"5129448c82676db9812f16d1847f207fb0320ddebb2fe2f699cbdb5b1cfbafe4"},"properties":{"dependency":{"package":"@smithy/config-resolver","version":"4.3.1","advisory":"[GHSA redacted]","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"986be8a9e3e6a6d872fe1ae6395a44a270132f5a5f578c7a3b3dbb6c999205d6"},"properties":{"dependency":{"package":"@tootallnate/once","version":"2.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"a861b1ab2fd6ac5a0cbbd2d1eaeca38914dcada77f7a5d62bbdd015efb9e974e"},"properties":{"dependency":{"package":"deepmerge","version":"4.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"23a2063051f9a1a60739a49c10e35379053acce3b40f027baf927ebcd5189fdc"},"properties":{"dependency":{"package":"diff","version":"4.0.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"775c9df1412849f91e4e34dd20e4d6e4fc31c35f73afd98c96efa904a6728f76"},"properties":{"dependency":{"package":"diff","version":"7.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"b7198a068b97a1af1f65e3196cdf11565ec276006632a836614e182488e4d847"},"properties":{"dependency":{"package":"katex","version":"0.16.22","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"f725ad925cf527603c81b184e74678a84b7e7fa9f0fbc2a67fdf2a7487746145"},"properties":{"dependency":{"package":"webpack","version":"5.99.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"typescript/packages/nextjs-plugin/src/index.ts","line":1}}}},{"ruleId":"D30","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":"929c9025374dc164967c6da0aebbae8a8eb6a6c9bc1d33a3d4ed026208587be9"},"properties":{"dependency":{"package":"diff","version":"5.2.0","advisory":"[CVE redacted]","reachability":{"kind":"not-imported"}}},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-400","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","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":"bdf6562a2c068ef8d0273435e0584c9e629dbbfa545a9dd312508dc65db5a663"},"properties":{"dependency":{"package":"katex","version":"0.16.47","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"a14c5df1af657359acddf5ed72947bf33f8060c388e9d337644ccfa0629b650a"},"properties":{"dependency":{"package":"ai","version":"4.3.19","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"848b24ffb302a4a511f07c7df1b26fb704e535394d372872130fc3077c803963"},"properties":{"dependency":{"package":"@ai-sdk/provider-utils","version":"2.2.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"df4e2b7da6073191f1ae72d86e8761c2556757e4bff117ee08b7914b126afe73"},"properties":{"dependency":{"package":"@babel/core","version":"7.28.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"97a1b119322dc8dbf41e25bc6792e898564bee6c409243e5daea9f9df729f926"},"properties":{"dependency":{"package":"deepmerge","version":"4.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"3569ebc80d4eeddcdbeb52bda97fca473b89f6eb82a5d2476cc5865acea747de"},"properties":{"dependency":{"package":"katex","version":"0.16.47","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3c163cf7f79a49dcd59ac4e25aad649d661042cfeb0b068534d39e7316fbac05"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"487742b1608b8eed4bfe20906aa0fb8811da293af7d1e6ee3683b2e6101cca24"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"318c8d3afde9adac507b50537ca3d2f20761ae0c45b65457a020c61ca4547944"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"75fc9d62f5690fe8e5a6f2678bfbca57d47c416874b57b754583f62269091b06"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9a31d2cc3d58ee42f0d23461220f1a9dc4fdd3c093cc4c536e6c4117c6a920aa"},"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":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"310e18186fb039def4e34ce575b2ce822dfe3625aa391a4d8933e8423e877ff9"},"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":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f4630e5a33d6b4718c993081c4233327d864a9158899da8ae2215645a8be8ca2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d65e18178ce3fda4f67dc5ecb6ba6972f5cafb69065748ad2b243bf0f924d29"},"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":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a9df4e83949930906ff0bcfdfaaf30228ae2d38dbce84c5d851a3fd8381ed8a0"},"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":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a43a278d02ff0e4ab01e7239cbe3274b04d9682c495b1ef741ea2f62a0484428"},"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":"D31","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":"3b1568673c97a5ce9b1ec5a08dba083d705b7ca92047378b6f33333438b27491"},"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":"D31","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":"a0253cdb433485d93f1259fe935cad7c5df0486a99bae72ae65dbbacb158f6f3"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","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":"46eb56ca90f14ff58240ac181de64c98cab210a78b41d8e834bd882a2763a646"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","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":"b99553f3f9bebee5ca58f9eddba50d8512045c85b384b8c5a181ed0a044b218b"}},{"ruleId":"D32","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":"e0044c4dc3ed0edaaf48a3f13eadc5b0f3de5324fad9997edfb6bb4f269e35ee"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/tui.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c189d481f1a36c16a1e0bf50ccf5cb055b80b78023b2515d24a5dcf8dffcb6d"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/baml_vis/mermaid_debug.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d136dfc86a1142d8a842f36379a95f648e11e9ee51c5746eb1b91685b61df9a8"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/async_interpreter_runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b16f79bb190af25df5d88e0b3cd31ffc118477a1f2779070aa9abd6ad9f5e77"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/watch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"472fc6abd40c1d17fa2aef27097005939f876f25035f3a5735f5fc6454197000"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/applier.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b689bb329fa0927c8b17009aa8ee9a08b69999a261b4f8a9eb8ec7116a5571c"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/openapi/src/type.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cb33e84ca3789e3c7230a1eaad7fcdb6cd6c52054583b64feb88ed1ba7d50e"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/baml_vis/graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c7b416744d91434ef586c3a9d913f55e7861d637c61274ffeb1f57747f9532"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/pdf-viewer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"611ccbdd92336ae4650478bd9117297de5829f95d695373979726b307a595c9f"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/baml_vis/header_collector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a9e1d50a105fc9fc7ee9531ab2d3151dae72c35ad263b23b578b8b9debaeb3"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/pareto.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3968619f0f2719445e26e4ba5beb4246e781fc886edfd38574ea48b0c1df5909"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/evaluator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce5dd21e64822e0dc8a63884fc13eb9a18d72a1d841897f4c2b8822570b5be7"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/jsonish/src/deserializer/semantic_streaming.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"928202cbcc40d78b28f353859d4b89729b907d6d028d7c0a61c6f23cb4ec7513"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/parser/parse_field.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b140ec9fa7f2e91c664a5039404ccefc360092aac73981b26f6f9c71ec0cb50"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 72 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: engine/baml-runtime/src/optimize/schema_extractor.rs, engine/baml-runtime/src/internal/llm_client/primitive/vertex/types.rs, typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/components/EnhancedErrorRenderer.tsx, engine/baml-runtime/src/test_constraints.rs, engine/baml-runtime/src/optimize/storage.rs, engine/baml-runtime/src/optimize/gepa_runtime.rs, integ-tests/react/src/components/network-timeline/index.tsx, integ-tests/react/src/lib/store.ts (and 64 more) (85 orphaned of 2282 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 2282 of the 3431 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/schema_extractor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2279cf7963366c9157b993fc52fcd66e4c44d9f2074969c8636fa4840afdb2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/vertex/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4dca7e55f4f93355b7c93223115ad0ec49940c0509f1aa955fec3bb9e44952"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/components/EnhancedErrorRenderer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68409bab590b6cbe1fa931589919008c68f419c992c0cefc40024178ed1797d0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/server/api/diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"376a52a54bf26d5651c56d1a3878a724eb7aa0da48ac3976c114c29d1ac6a654"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/test_constraints.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45bc7f559234d87bb0f8143f7233d18184df5f5bf054152ec79fff93c4000be"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/storage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d00def05e9c5971a83830f878d6055d0dc1d1952147e7628bad9d27588b414"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/gepa_runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da748d172052622a5ff5c45c6ad7cfb1cb58202aadbc0ed81c8630854721a6bd"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/react/src/components/network-timeline/index.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c39dea3e76a9d7a5d5a190da5feab789e4229f43364652b70f9b5b0dcd3814"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/react/src/lib/store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"deee3ccbc57f8b35469250cd2c43b6ba34ccc0fe2481ee608a50377b5cb1148f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/optimize/candidate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf840b3b3aa51233c2f59b62c5811b4ac73f34ad2e5114afd2bb2c53883ce71"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/server/schedule/thread/priority.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4fc7f98c813f7ef203d8abfdb15caca8e2993f7c558cf221e46713f74fd378"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/google/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d615e1fdf905eb751b958c0153620b73cf8a066f48dd9d6eafda373eadb12ba"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/baml_source_file/line_index.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5fa3fafb9b53d2ab9b23818924263d00174a98a11e0216d94c5fb667f837f6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/python/src/watchers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebff305d6a328a6e094e68c3e8000d25f7254c2619d8a4e68fe07992351c0154"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/typescript/src/watchers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfaac8079d07c0a7abc634b076b5d26078213290ae0ed49e255b3352c6158dac"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-compiler/src/watch/watch_event.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d549ed8fb751cfbe7c6de0ca358a35403df49f2a23047f9a9b065a969cc099f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/baml_source_file/newlines.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"792849c17704af8b548861146c1acf9eabd4ebc954f0f264093be25980b0621f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/baml_text_size/range.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6e737e84e55b6f11ccf3c063f65bc421d0ff78ad27575fc5fa6c85229288ab"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/function-item.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d5ca7517a48f9c8378c84aed60a529e75bc0688d24de60c733849e2e948637"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/react/src/components/test-client/response-card.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43740d7575ae3dd12914c43bce1e58fae8054508b5541b89b3bb80f259066370"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/edit/range.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c10973b4b249a4cd75e7053e3877277a34eecfcff7692404eadb159ee07f607"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/baml_source_file/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97af96b5e149e4ba3dc3a2a1101bec4dee94f2ecd813f4594d05fc958bd20ce1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/server/client.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8be272fb6ebb073670112b2ff2b02b7cc11da34228dd6897664ea8c830932df"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/react/src/components/test-client/tab-config-menu.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b43d1009d1b01fe94e7565bf737fc68d177c76f871baf5b145640a27cae5db"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/ast/src/ast/baml_vis/diagram_generator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc83322c21cfac7f904c01383d03d5cd773291fc6fe65a6ac1969b3d87bd071"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/session/settings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb99641140b43f48ab2ac5b079fabb4e263e483be0ae38eab0d5c33b86bdb027"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/ir/jinja_helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce8f882bf4e323e7c26305c61490cd2d6e120a93becc580bf7a25e45f48b244"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/reserved_names.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20a1272f808b57d25e7823aa635bb7da0c7d8f32dbccfdf9f053334046d90c0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/session/index.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b870c08ea08e8145d02d85e78b75f75af0353bdd3b301f97f4055efc27b1f21b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/edit/text_document.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d810a394c8f4e8142edc3db06f369ae075b81060d2b3711a6fb33f946f7383a0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/server/connection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6cc5996578fc875dea349d77bd9044580551faf54b4e9bce4ec1c13870f2fd7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/baml_source_file/line_ranges.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b31070e127aed48cbbd88590dafcff1939c42fcd97398c85a186908063c32e6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/validate/validation_pipeline/validations/tests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a8523e6a6e0b451a89af61340293227ca925e4b96fa345c18e60299fa205d8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/baml_project/file_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e4a5ed4d8806b1b60e1ca5845adbf12a78f76d5331852a6ed13478e6b227b2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/components/status-bar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e8a6a7b7e600f562fa30436e2c93d16875e2034503380ef879988baf8f796c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/edit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f742b27b18c256b316f6912e084924f5239781da7ecf27b80f380df7e63509"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/server/api/notifications/did_change_configuration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3091ba7fcc5f4c9d499fd03fcf73b4437e84eeca715e8d1599c8425db33d302b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/server/api/requests/rename.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9857cca88bcab73e7cfeb32dc5b554ccf95972c021d0e256795a8dd16526d499"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-editor/src/workspace-path.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3cc8424ea57f089535cf7e983307d937742f319617a84678788f57622ae523c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/typescript/src/ir_to_ts/type_aliases.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9230a297fc646dfb8f11387acc705489a4d4793dfd30831eea9511ba65410cc"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/react/src/components/test-client/hooks/useFormState.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e914e0bd7d55fe97d7eecf83613906914f9062f681f92253c10c4eed8294a696"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/components/WatchNotificationsView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80fe3ba7c0f7549c92ee4befff3d76f1b347b9f50925d35c5b17af5329b13f2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_path/src/native/windows.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"731ff78f4577304ef39ad395eb657991074d9af8a35f633b3e14ddd2b5e2cb12"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/react/src/components/test-client/index.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c735a9d006bfd870a51c5979621af50ea096e57785dc4ac58ea8f7163a11694d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/server/schedule.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbdb1e75c69c061db2276a9d0857cba2eb156e11b5da28698f836e5f0ebc445c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/nextjs-plugin/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"737b4feae7f7ecbaba9cc4cfc05076d69421219b629ff226d397c86c8bdaab51"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/redaction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac249140fd86705deb1bb9cada6c1539e266553902be601c008e2cf4e8cc6fe"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/baml_text_size/size.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"954879fafe79df721ad8cc482a66aa8c01a843a392b9fde4a374ca9550a38e7f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/logging.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c89c7a3b921bc1829c447c57a0d51bc4100b8cdea54d9202fd795d1c1ad32f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/parser-database/src/attributes/constraint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95934cdd15aa43cb5945f5e46225f09be5d9bf44a00bb5c3a6f602f0da92e750"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/react/src/components/test-client/hooks/useFormSubmission.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d191b199c0bfa87079bd4c0079d5692d8d97705e83f718ef16021c817e82dc"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/server/schedule/thread/pool.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8038d17fe215e3ecabbca5634b4fc27b98538463e736663c1bb9ef35c61e4a37"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/react/src/components/test-client/format-renderers.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18177c7bc3821db70e3af174a14d417f9dd2eebeebeb16fb5f8842429e89bde"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/react/src/components/test-client/components/ImageInput.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8cc6880eb8ee2a7e69d4c6d6fe6588323d491f0171b95afc9cb13f014e4c8a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_python/src/types/video.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a4c058ced7b95febbd1fc3a5482a02115c694e2e9299ce8cb2ef5cf24ca6bf"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_python/src/types/pdf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7a4acdef09789493f03fb16463867de7945982beab3be89291aca9daf4ed46"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/server/schedule/task.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62adf7a5355e752f55a738b868abe029101217554f7416df440be4a3bdd4778a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/wasm_jwt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"772f463c7729bf40f6b82c475de522453c3e8a871787db3f3cf6c48ce0b470bd"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lsp-types/src/baml_lsp_types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"672074449d29043916f13f163f92a484117a7827258bf4d88cf52dd56fa0e190"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/server/api/traits.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5bee1480c37a6f4413b1069152c1d8f63ea123e31a4f88f5c0bd351490403f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/server/schedule/thread.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbb4afee809e74996f70038e30ff5cfe7df0a97bc48228e2667be571517498a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/TruncatedString.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60fc27abad8f008c3dff7ce4ea91872e00275935bbcb99bd0c34c16de41dc037"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/react/src/app/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8b8fc0d81da3ef8cce0d9190f5c14831ba4d48146c84c599a1e8048414f308"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/session/capabilities.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c9c20ce28a56c5aa4a828b3d886529a30e5f7d840002a6e5f13967fa881597"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/ruby/test_env_vars.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d478ceb4150486cf4133f2c539baeb78d748579322a1284dad0c807fe61562"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/common/src/schemav2.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f9ab6d71aa8bb68222f1e52574eeebefb937ab5fbedd49bd31b7466c8ffb17"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/embed/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87032e27f7c2fe9beac4bf07efa82a19a42e5691d46d621191c07db4c23a093"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/src/types/pdf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbaa14769dc3dd1443fb8b0edd8197a2779420d654bc8979626132ac4d4bced"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/audio.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb98da7af3737da9fb0d86d2f2386ec3b1a284bd410b4dc20803199daba8b7b4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/image.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d592e7473f91918741fa6ab9f36e859599385e55268a8fd06484be7d3c74d25"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/src/types/video.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c131b1147b684923c9ffa614d0530c19772dcddabe8303e0463babfb7fd0f8b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_path/src/native.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"243474059dc39e38395c19d8b865741959b09ddbad51742da2206ee485e48d52"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: chat.rs \u2192 completion.rs, mod.rs, runtime_interface.rs: \u0060engine/baml-runtime/src/internal/llm_client/traits/chat.rs\u0060 changes together with 3 other files \u2014 \u0060engine/baml-runtime/src/internal/llm_client/traits/completion.rs\u0060, \u0060engine/baml-runtime/src/runtime/mod.rs\u0060, \u0060engine/baml-runtime/src/runtime_interface.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/traits/chat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8abbb234950f0c176af5bd25bdb80f5a8f876dfde90addc44673ea13aa1c8d52"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: llm_provider.rs \u2192 anthropic_client.rs, openai_client.rs, chat.rs, completion.rs: \u0060engine/baml-runtime/src/internal/llm_client/llm_provider.rs\u0060 changes together with 4 other files \u2014 \u0060engine/baml-runtime/src/internal/llm_client/primitive/anthropic/anthropic_client.rs\u0060, \u0060engine/baml-runtime/src/internal/llm_client/primitive/openai/openai_client.rs\u0060, \u0060engine/baml-runtime/src/internal/llm_client/traits/chat.rs\u0060, \u0060engine/baml-runtime/src/internal/llm_client/traits/completion.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 4."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/llm_provider.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdf1d9fca1461d6d092208ab6206a22bcb597a717a726c87068c16d14dc7f67"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: completion.rs \u2194 runtime_interface.rs: \u0060engine/baml-runtime/src/internal/llm_client/traits/completion.rs\u0060 and \u0060engine/baml-runtime/src/runtime_interface.rs\u0060 change together 62% of the time (8 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060de8996f1\u0060 rip out ResponseType; \u0060564a53c2\u0060 get the python-facing streaming interface implemented; \u00602c54e539\u0060 commit a bunch \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/traits/completion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe72274a525810b57bc3380e928b8b6823738e8c8c033ecffdbceef7e241e12"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 async_context_vars.ts: \u0060engine/baml-runtime/src/tracing/mod.rs\u0060 and \u0060engine/language_client_typescript/typescript_src/async_context_vars.ts\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u006069e6c29c\u0060 Add ability for users to reset env vars to their desire. (#984); \u0060e8c1a61a\u0060 Adding various fixes (#806); \u006028b1f15d\u0060 logger callback (#715) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/tracing/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a17269e8c913b1a76b1cec06fc5b30d7f292a4100ed89c7cb49f6cf88ca45c8"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 async_context_vars.d.ts: \u0060engine/baml-runtime/src/tracing/mod.rs\u0060 and \u0060engine/language_client_typescript/async_context_vars.d.ts\u0060 change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u006069e6c29c\u0060 Add ability for users to reset env vars to their desire. (#984); \u0060e8c1a61a\u0060 Adding various fixes (#806); \u006028b1f15d\u0060 logger callback (#715) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/tracing/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf411cb743def1bef31e7a6099930853acf67877fc88792928ed9560f6de985c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: completion.rs \u2194 mod.rs: \u0060engine/baml-runtime/src/internal/llm_client/traits/completion.rs\u0060 and \u0060engine/baml-runtime/src/runtime/mod.rs\u0060 change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006080751768\u0060 everything compiles in RS; \u0060142c9296\u0060 working WASM; \u0060cb825eb8\u0060 client compiles again \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/traits/completion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2584c43ad8b5fcabeb890a9f209e9ee83eb703a09bd5d2e347e851eaf3aec0"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ast.rs \u2194 diagnostic.rs: \u0060baml_language/crates/baml_compiler2_ast/src/ast.rs\u0060 and \u0060baml_language/crates/baml_compiler_diagnostics/src/diagnostic.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060a06a1e9c\u0060 Diagnose inline unreflect type arguments that escape their call (#4518); \u00601f8c7306\u0060 Improved \u0060implements\u0060 rules representation in compiler (#3852); \u0060da4d557d\u0060 feat(compiler2): add \u0060defer\u0060 statement (BEP-042) (#3785) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/ast.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79dabc71945d12b65f7c5f1bbfe928c3ba6cf1e78a18750f690e787f3a610fa4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ctx_manager.py \u2194 async_context_vars.ts: \u0060engine/language_client_python/python_src/baml_py/ctx_manager.py\u0060 and \u0060engine/language_client_typescript/typescript_src/async_context_vars.ts\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u006069e6c29c\u0060 Add ability for users to reset env vars to their desire. (#984); \u0060e8c1a61a\u0060 Adding various fixes (#806); \u0060be74999d\u0060 Fix minor bugs  (#728) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_python/python_src/baml_py/ctx_manager.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4436da7cbc2fc70ff9f122d45e122fab86c4c31b2bfc7a35f3cf307ccef5c632"}},{"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":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"13a6fbe6b774f787deeb40d1b807e6b851d8528298e0a44245edda1ed5d96ea3"}},{"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":"9bf177bade8d82a19884d9994162275571cecba407dc7f737251b15d094e5a14"},"taxa":[{"id":"CICD-SEC-1","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c17e111b0508eba88b1d5d7ae4c3ab2166526d945226a9de528ae9a5df704ea2"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3d3b2a8415c8fd592bf136070a663117d8ce09bfd5abf46afa2bdcd019e26788"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1af3548f0c65b411cb6b2522ab6062832c2315047583b1cd78f67212782ef598"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8db38d66a605e1acf06a5f3acac9814209b163802e0c6d2de70c0d4f60e9ea8f"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c3ed2a6192542ed24061940bd1695520ff28ce699cf49cd621be6267844ebeed"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2f698bcf1fc2165a6ef0b6f1a6343171f4ce808a8dc41716a89ebff017514c97"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"018d6c36313c086dd72b7e6040e0ffbcc1698b03aaeb26b37a6fc2a9db1e2ec2"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2b974269713b9c1aa9f2857923deedc56c92692b290f010ad19019f192f316f5"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"59efa3e20b9ca9d82ef56a8d4efa4dc01c97489671d0a70e78d8fa8578fd8ba3"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b80b34072dd0fc4b9572ec36c3c66c688b60a5a0658685d71e97dce793cc4f6"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"964406f946d5704a138dae78b6025bb114b3c4b81704367b2461d6d3ccb64f31"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"342f47b4cbeec7e8984ff09c805ef1f887cc40634c37284b5b88d54103b9457b"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"62327ca07d9e63808a233082deef235e60a8cdde10930b7c6f526fcb9148215d"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"466fd9856d681d5bf7db7a1d9962b2c06c9a3137322f5a2547db8fe730b9c7a8"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cd50b18d004c6ab2ea83b885f5f1de1da4fe0409a8add3b135bf0c6ea0eebb29"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe274ba5adebde25ca0b3db842e44cbb1aaeb7cfecfbb7215cd452596ba1f4c2"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: Node.js 10: engine/language_client_typescript/package.json declares Node.js 10 as this project\u0027s engines.node, and Node.js 10, support ended 2021-04-30. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2021-04-30 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/package.json"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a2cd25bd36558cc709766f11572178ef5de07cbca7425ec24d79124100be77"}},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: Node.js 18: typescript/packages/nextjs-plugin/package.json declares Node.js 18 as this project\u0027s engines.node, and Node.js 18, support ended 2025-04-30. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2025-04-30 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/nextjs-plugin/package.json"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6648803ca1184d1b831cc0935c1131320f0ac2f71c390fad75199d5bf2e7db6"}},{"ruleId":"AX2","level":"warning","message":{"text":"Process-global static state: NativeCallbacks: \u0060NativeCallbacks\u0060 keeps mutable \u0060static\u0060 state \u2014 one slot for the whole process, shared by every thread that reaches the type however its instances are created \u2014 and mutates it outside any lock (cleanupApi; e.g. \u0060cleanupApi\u0060 at line 39). Concurrent callers lose updates, and a collection that is not built for concurrent writers can corrupt."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Cffi/NativeCallbacks.cs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad7aecb0d01a15bf85b489cbe1a1cbe7ca765f507cd4061b13dc5296ce9c22f"}},{"ruleId":"AX3","level":"error","message":{"text":"Namespace dependency cycle: The namespaces Baml \u2194 Baml.Cffi \u2194 Baml.Generated.V1 \u2194 Baml.Proto \u2194 Baml.Runtime depend on each other. The lightest dependency in the cycle is Baml.Generated.V1 \u2192 Baml.Runtime (Baml.Generated.V1.BamlGeneratedProgram \u2192 Baml.Runtime.ProgramNativeState, 1 type pair(s)); cut that one first, e.g. by moving the shared type to a namespace both can use or inverting it behind an interface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedProgram.cs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fd47df1d0c22dc5b95d79ca03a6740b80ca003cce15fa62c90914b44a46766"}},{"ruleId":"AX8","level":"error","message":{"text":"Production project references a test project: generators-go \u2192 type_test_spec: \u0060generators-go\u0060 (production) references the test project \u0060type_test_spec\u0060. Production must never depend on test code \u2014 it pulls a unit-test framework and test fixtures into the shipped product and inverts the only correct direction (tests depend on production, never the reverse). Move any shared helper into a production support library, or invert the reference."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0042d1848124cc22879924004ff12e4fac34f0c8645c85f20d470e0b5e1d50cd"}},{"ruleId":"AX8","level":"error","message":{"text":"Production project references a test project: generators-python \u2192 type_test_spec: \u0060generators-python\u0060 (production) references the test project \u0060type_test_spec\u0060. Production must never depend on test code \u2014 it pulls a unit-test framework and test fixtures into the shipped product and inverts the only correct direction (tests depend on production, never the reverse). Move any shared helper into a production support library, or invert the reference."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"20b8a45d922a24d2afe29babfd231e2f8ca838a24f5823d4d16a00f8c2d87250"}},{"ruleId":"AX8","level":"error","message":{"text":"Production project references a test project: generators-rust \u2192 type_test_spec: \u0060generators-rust\u0060 (production) references the test project \u0060type_test_spec\u0060. Production must never depend on test code \u2014 it pulls a unit-test framework and test fixtures into the shipped product and inverts the only correct direction (tests depend on production, never the reverse). Move any shared helper into a production support library, or invert the reference."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"09870d1a8bb554847d1a81df4922219132dee981b55820f5da28504b7fe0e5df"}},{"ruleId":"AX8","level":"error","message":{"text":"Production project references a test project: generators-typescript \u2192 type_test_spec: \u0060generators-typescript\u0060 (production) references the test project \u0060type_test_spec\u0060. Production must never depend on test code \u2014 it pulls a unit-test framework and test fixtures into the shipped product and inverts the only correct direction (tests depend on production, never the reverse). Move any shared helper into a production support library, or invert the reference."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"55af874b8500b68a6f1b925bc06af47affbc27a4138a13c262865d463e4f2e8c"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: engine/vendored/minijinja/README.md links to \u0060CONTRIBUTING.md#ai-disclosure\u0060, but \u0060engine/vendored/minijinja/CONTRIBUTING.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/vendored/minijinja/README.md"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0b605dc5dafe77a48377686f54c3f9859b70e1d74bae2f0029ca27b45baa46"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: engine/vendored/minijinja/README.md links to \u0060UPDATING.md\u0060, but \u0060engine/vendored/minijinja/UPDATING.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/vendored/minijinja/README.md"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d03e44696e6d7674a3d808a26c164b711d7d98cc258c0c9b4a66276d51151c3"}},{"ruleId":"P12","level":"warning","message":{"text":"Test failure does not fail the CI gate: \u0060continue-on-error: true\u0060 lets the step or job that runs \u0060pnpm --filter app-vscode-webview test:unit:run\u0060 fail without failing the pipeline \u2014 the suite can go red and the change still merges. Remove it from the test step, or quarantine the specific failing tests instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/kiln-shadow.yml"},"region":{"startLine":2012}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2089f1e083350a196a577bf2b6438fbb670ab097a62e9cd085e381d14d80f1f"}},{"ruleId":"P12","level":"warning","message":{"text":"Test failure does not fail the CI gate: \u0060continue-on-error: true\u0060 lets the step or job that runs \u0060pnpm --filter app-vscode-webview test:browser:run\u0060 fail without failing the pipeline \u2014 the suite can go red and the change still merges. Remove it from the test step, or quarantine the specific failing tests instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/kiln-shadow.yml"},"region":{"startLine":2078}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e196fbec9a91d0283f71a53dbcf495c4da32d31cc3061abd894694941f9b2f"}},{"ruleId":"P12","level":"warning","message":{"text":"Runner config excludes tests no gate runs: \u0060src/**/*.browser.test.{ts,tsx}\u0060 removes 2 test(s) in 1 file(s) (e.g. \u0060typescript2/app-vscode-webview/src/App.browser.test.tsx\u0060) from what vitest collects, and no other runner or CI command runs them \u2014 they are dead tests. Run them (another runner, project or job), or delete them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-vscode-webview/vitest.config.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa8e16b223d7ac2f1db4981b0590515ea9742bc303263704ada9fc4ab8f688b"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch nuget/bun/cargo/gomod/uv/gradle/bundler: \u0060.github/dependabot.yaml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060nuget\u0060, \u0060bun\u0060, \u0060cargo\u0060, \u0060gomod\u0060, \u0060uv\u0060, \u0060gradle\u0060, \u0060bundler\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entries to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yaml"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca02b6f5afe023bc5f2719dc08a4f6ca0e2dadf7aab73d4d4a5280f810beec7"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060new()\u0060 builds an outbound HTTP client and nothing bounds it: no timeout is set on it and no retry or resilience policy wraps its calls in the type that owns it. This codebase ships libraries/tools rather than a service it operates, so the failure lands as a hung caller \u2014 a build step, a CLI run, a UI thread \u2014 with no way out."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdk_tests/crates/csharp/stdlib_resources/Program.cs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"782c6da01abbfc68eb245c7c986292d9a8f6d206651421a49449c8c08d231f96"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060run\u0060 is async and calls thread::sleep \u2014 a blocking call inside async code stalls the executor thread, and every task scheduled on it for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/cli/optimize.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"782db81d083e59e0f7ed66d6e51bc658ae62504719299a98d2db5c861c70aa42"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060loadRuns\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/api-server.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"42eda99ce0d60a3cf1d1414a38e9a4ea96f5f00606da017d01cdae7bc6dfe5c2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060loadRuns\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/api-server.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"0880059dafb1754ba6fdcb215f32ca8bc4f1855515e9f914f6346f7749d4131d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060loadRuns\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/api-server.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4dfedb152270d153dbb68ce81563fcf79b856d7a3dd4969181bb761c7435b87"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060loadRuns\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/api-server.mjs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"788b61eaaa0993028e2bb7d6f206934b074a3bed2833dd5d32cb9d9ea54f2a5f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: 13 blocking call(s) on async work (.Wait()/.GetAwaiter().GetResult()) \u2014 these waste a thread and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2dedb76432d7d4f359386b5c37564c0f3de368182a77e31aa8af9ba73f9a4def"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedProgram.cs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c315972b48e095e8d8a507b42eb479b7caecaf03387f7f470bcbf14170c709"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedProgram.cs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f0aaa7a7e23d0d07741c9880d6fda146a1012b32060b785842962990d35eaa"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Values/BamlFunctionSpec.cs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4087e7d136f4d00231979009720e73a9bf5ea2c8e1ef954e8f6d656b7712331"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Values/BamlFunctionSpec.cs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c5497cc88e73ff109e9cf7060c699ff7f80ea3a87933a00fb28058bafb2885"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Values/BamlFunctionSpec.cs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12925036d71c54599801cf7ab1a24e662668d41cd6a6b2d5a134d346e4f099d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Values/BamlFunctionSpec.cs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb81a34c87604ff7a5a9d0a8a607811914fc6aef19c5a3a43e888958b2e1c91"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Values/BamlFunctionSpec.cs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b8d213abc211e005de0f8eabbefd5bfecfd75be23a6b3ef3ee79173675e426"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Values/BamlFunctionSpec.cs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c1595abb5c1f989008050e43da0f2a523ca51c6a1a7380a51393b351be112b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Values/BamlFunctionSpec.cs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"32947c63a5515ce9166b0656c6ca85c61c66b5006427ffa8c8ec43d2bc8e46a5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Values/BamlFunctionSpec.cs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e98956b7caea98cc1d3812d74ab388279587b4c397f27a94c4025f14d6ea16"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Values/BamlFunctionSpec.cs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"796ba91585b806c3a4b347e00ee293b0068bfab8935394ac5aaca5395710cfe8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Values/BamlPrompt.cs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ca79ab6a6acdc7cb2125926d4967d55939494b883cb04cfdf08ff2d038d4fc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Values/BamlPrompt.cs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c97ce419115ed97d5fc0df88da83698902002f009606d6f12a222283d5dce77"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = new FileStream( path, FileMode.Open, FileAccess.Read, FileShare.Rea...\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Values/BamlMedia.cs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"040d25fef59a5ff5dbeb34874f3a941e8a5971cac939390d40fe14d1b2352414"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await Task.Yield()\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Values/BamlStream.cs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"1946e7d7ae2ddeeda21d6b976365186df0db8b0cd659726654b9b90724bcde35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 4 sibling directories (71 clone groups): 71 duplicated blocks under the repository root have copies in at least two of the sibling directories baml_language, engine, typescript, typescript2 \u2014 48 of them are reported below, and 23 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 71 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 71 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 71 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/carousel.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ee8ca3a19a9a696be86e04ddc9a3c2f7c49d4811bbde5c7940d07974dd0678"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 12 sibling directories (42 clone groups): 42 duplicated blocks under typescript2/ have copies in at least two of the sibling directories app-beps, app-developer-docs, app-feedback, app-type-quiz, app-vscode-ext, app-vscode-webview (\u002B6 more sibling(s) not listed) \u2014 21 of them are reported below, and 21 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 42 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 42 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 42 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/select.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3f83165d2b788c0d080f8f90fe3c521c0c85100ba8ebec9ad62bee2f413645"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 9 sibling directories (19 clone groups): 19 duplicated blocks under engine/generators/data/ have copies in at least two of the sibling directories array_types, edge_cases, literal_types, map_types, mixed_complex_types, nested_structures (\u002B3 more sibling(s) not listed) \u2014 8 of them are reported below, and 11 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 19 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 19 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 19 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/edge_cases/typescript/index.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a25462882534ba9a2849dc3faae20662feb7a59a68af8033d723ad42144eb4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 11 sibling directories (11 clone groups): 11 duplicated blocks under typescript2/app-website/app/(home)/ have copies in at least two of the sibling directories bamlcode, blog, fight-slop-with-slop, logo-ideas, podcast, privacy-policy (\u002B5 more sibling(s) not listed) \u2014 7 of them are reported below, and 4 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 11 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 11 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 11 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/podcast/page.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5bc17233b9e95aeeaf8848962706790cf161e7e765a90af2bb596a4ecf510ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 5 sibling directories (10 clone groups): 10 of the duplicated blocks reported below have copies in at least two of the sibling directories bep, comments, decisions, issues, ui under typescript2/app-beps/src/components/. That concentration is one structural fact, not 10 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 10 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/decisions/decision-form.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6e82274b7004da6e7cd93935313e0926383ebd255ce74a1ff66d4c5d2c6a5f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 4 sibling directories (9 clone groups): 9 duplicated blocks under typescript2/app-beps/src/ have copies in at least two of the sibling directories app, components, hooks, lib \u2014 6 of them are reported below, and 3 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 9 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 9 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 9 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/beps/[number]/comments/route.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb07e7f4dbd0516aa1809286964db520efccadb31550adef8fc05ea02b24d4b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 2 sibling directories (5 clone groups): 5 of the duplicated blocks reported below have copies in at least two of the sibling directories apps, packages under typescript/. That concentration is one structural fact, not 5 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 5 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/webview-to-vscode-rpc.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1b328c3e609624e56493d04248cf303e927c35362092c785824aaaa0f65163"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 5 sibling directories (5 clone groups): 5 of the duplicated blocks reported below have copies in at least two of the sibling directories add, comments, decisions, edit, issues under typescript2/app-beps/src/app/bcs/[number]/. That concentration is one structural fact, not 5 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 5 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/decisions/page.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ffdd37218b6eb6ce39fb592beb92d25f2aed48a6f4f2c885c3327fad86239f5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (152 lines \u00D7 2 locations): typescript2/app-promptfiddle/src/playground/vfs.ts:147 \u00B7 typescript2/app-website/playground/vfs.ts:159 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/vfs.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf075e2229ee3e3d4d1a358a025aca8dd28fe1ce561dd64ed19b519d4a0c0c82"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (141 matched lines \u00D7 2 locations): typescript2/app-beps/src/app/api/agent/beps/[number]/comments/reply/route.ts:15 \u00B7 typescript2/app-beps/src/app/api/agent/beps/route.ts:188 \u2014 the two spans are one implementation copied and then locally edited \u2014 712 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/beps/[number]/comments/reply/route.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b8c3d6fa77576d85f56dabcb77ec46c0f421cd1f252d8b96b3fd4d6c183418"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (140 matched lines \u00D7 2 locations): typescript2/app-beps/convex/decisions.ts:8 \u00B7 typescript2/app-beps/convex/issues.ts:8 \u2014 the two spans are one implementation copied and then locally edited \u2014 998 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/decisions.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb8c786572ec3b656746fe89f7157621b4651c019cf50b1d12b1de8583a178f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (138 lines \u00D7 2 locations): typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx:324 \u00B7 typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx:654 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f8e6c7fb810e655694f4da8346a96dc79b94716e82766e4e7aa661a705ee0a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (129 matched lines \u00D7 2 locations): typescript2/app-beps/src/components/decisions/decision-form.tsx:73 \u00B7 typescript2/app-beps/src/components/issues/issue-form.tsx:63 \u2014 the two spans are one implementation copied and then locally edited \u2014 693 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/decisions/decision-form.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d32ee3b02760ff71fde075cf656c671393a030b5761221e7ad9582aa2e1039"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (129 matched lines \u00D7 2 locations): typescript2/pkg-playground/src/worker-protocol.ts:863 \u00B7 typescript2/pkg-playground/src/worker-protocol.ts:1060 \u2014 the two spans are one implementation copied and then locally edited \u2014 620 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/worker-protocol.ts"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd302bbd1e65ef1c7a0d616fd766d1f8adce361c408ef79db48072219208d6e"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (128 identical lines \u00D7 2 files): typescript/packages/ui/src/components/carousel.tsx:3 \u00B7 typescript2/app-website/components/ui/carousel.tsx:4 \u2014 these 2 files are line-for-line copies of one another \u2014 128 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/carousel.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"5141448c45f31787ad0b43edb9d420d11ad9bb2f63033842306bbeb36bd79332"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (118 matched lines \u00D7 2 locations): engine/language_client_typescript/errors.js:148 \u00B7 engine/language_client_typescript/typescript_src/errors.ts:194 \u2014 the two spans are one implementation copied and then locally edited \u2014 635 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/errors.js"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a11dacccff4424198d941d7f9297fa5f60bc954b048b560cf0e6bbf3d19043"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (116 lines \u00D7 2 locations): typescript/packages/ui/src/components/context-menu.tsx:110 \u00B7 typescript/packages/ui/src/components/menubar.tsx:87 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/context-menu.tsx"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5751036166bf769d62d33514ddd37eecb1ab0d42d09ac832e16e41413d19e63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (116 matched lines \u00D7 2 locations): typescript2/app-beps/src/components/comments/comment-feed-view.tsx:225 \u00B7 typescript2/app-beps/src/components/comments/comment-feed-view.tsx:565 \u2014 the two spans are one implementation copied and then locally edited \u2014 675 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfa6277252685e83745a02ea67bd3639e45a5f48350875b21463776e3a363e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (106 identical lines \u00D7 2 files): typescript2/app-beps/src/components/ui/select.tsx:3 \u00B7 typescript2/app-feedback/src/components/ui/select.tsx:3 \u2014 these 2 files are line-for-line copies of one another \u2014 106 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/select.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"39822f23c7e29da794de4f1a4712d13be8b46d9e936b1bcaed214fb6b769d3fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (96 matched lines \u00D7 2 locations): typescript/packages/playground-common/src/shared/baml-project-panel/codemirror-panel/code-mirror-viewer.tsx:175 \u00B7 typescript2/app-website/lib/mdx/baml-block/baml-project-panel/codemirror-panel/code-mirror-viewer.tsx:105 \u2014 the two spans are one implementation copied and then locally edited \u2014 505 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/codemirror-panel/code-mirror-viewer.tsx"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"a837495382053efdd477eb4147301c675843a22e79bd889a7413ceb91b6ec74d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (96 matched lines \u00D7 2 locations): typescript2/app-beps/src/components/decisions/decision-card.tsx:47 \u00B7 typescript2/app-beps/src/components/issues/issue-card.tsx:52 \u2014 the two spans are one implementation copied and then locally edited \u2014 555 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/decisions/decision-card.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e97a7474b7ea487102fdbc1c09eec75316ddb1c15fba091fe650f257bcbc26"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (96 matched lines \u00D7 2 locations): typescript2/app-beps/src/lib/export-all-utils.ts:48 \u00B7 typescript2/app-beps/src/lib/export-utils.ts:39 \u2014 the two spans are one implementation copied and then locally edited \u2014 647 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/export-all-utils.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5fbacc87d2d3ae441d99122054386f9c565b2b6d68f667697d9d82d7c300c88"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (95 matched lines \u00D7 2 locations): typescript2/app-beps/src/components/bep/bep-list.tsx:47 \u00B7 typescript2/app-feedback/src/components/issues/issue-list.tsx:114 \u2014 the two spans are one implementation copied and then locally edited \u2014 555 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-list.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad1d40b52381c17851a8bf6a8b9e015659dfad74d5ef355a44c0da6b20f4507"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (93 lines \u00D7 2 locations): typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx:200 \u00B7 typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx:534 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09c794e438596f3680e7c64f29ab6e5dd253969dd9c0cd46c4e72cc4a11434f"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (92 identical lines \u00D7 2 files): typescript/apps/vscode-ext/src/webview-to-vscode-rpc.ts:1 \u00B7 typescript/packages/playground-common/src/shared/baml-project-panel/webview-to-vscode-rpc.ts:1 \u2014 these 2 files are line-for-line copies of one another \u2014 92 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/webview-to-vscode-rpc.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4097bd8d5912f7af857edab6b23e453e8009a81d166f8dc2cd921cf4c706ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (91 lines \u00D7 2 locations): typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts:280 \u00B7 typescript2/app-website/playground/baml-worker.ts:123 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"9222100984b88e24312b81907d379464b2e59a85eb2bfa4cd833cfe85bce687d"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (80 identical lines \u00D7 2 files): typescript/packages/ui/src/components/select.tsx:3 \u00B7 typescript2/app-website/components/ui/select.tsx:4 \u2014 these 2 files are line-for-line copies of one another \u2014 80 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/select.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a156dc1fb5ea2e93177fd23d3507ead67c70b4344f210384d25122f5cecc4ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (73 matched lines \u00D7 2 locations): typescript2/app-beps/src/components/decisions/decision-card.tsx:176 \u00B7 typescript2/app-beps/src/components/issues/issue-card.tsx:218 \u2014 the two spans are one implementation copied and then locally edited \u2014 360 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/decisions/decision-card.tsx"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ac85ef0150c493e72cdd33fc45a3b925cb3b8c808a043af11ab09168c231a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (71 matched lines \u00D7 2 locations): typescript2/app-developer-docs/app/baml/packages/[version]/[[...fqn]]/page.tsx:30 \u00B7 typescript2/app-developer-docs/app/cli/[version]/[[...path]]/page.tsx:28 \u2014 the two spans are one implementation copied and then locally edited \u2014 469 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/app/baml/packages/[version]/[[...fqn]]/page.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a4fde05c242c2fd63e11f1813b57b3f6edaee0806c50a9a077464f49090b50"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (70 lines \u00D7 2 locations): typescript/apps/vscode-ext/src/panels/vscode-to-webview-rpc.ts:4 \u00B7 typescript/packages/playground-common/src/baml_wasm_web/vscode-to-webview-rpc.ts:4 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/panels/vscode-to-webview-rpc.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd69124005a51a021665402f7da43a5f3f77696945817efac30e5fc597d38546"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (68 lines \u00D7 2 locations): typescript2/app-promptfiddle/src/playground/vfs.ts:13 \u00B7 typescript2/app-website/playground/vfs.ts:12 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/vfs.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a07aab8cb5bdbd89bc78d6cca03d8a3582090f799a6fd2a08eca513c72c814"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (67 identical lines \u00D7 2 files): typescript2/app-beps/src/components/ui/theme-toggle.tsx:3 \u00B7 typescript2/app-feedback/src/components/ui/theme-toggle.tsx:3 \u2014 these 2 files are line-for-line copies of one another \u2014 67 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/theme-toggle.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abf50cd3a6872e56274843373e08ee97256a1ffc6844a89736e17a7eaadf050"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (66 matched lines \u00D7 2 locations): engine/language_client_typescript/stream.js:65 \u00B7 engine/language_client_typescript/typescript_src/stream.ts:81 \u2014 the two spans are one implementation copied and then locally edited \u2014 384 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/stream.js"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"214ac5f517fd0a811822a657cdd47dc8563e43907e524bab68b4452ea174a70f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (65 lines \u00D7 2 locations): typescript2/app-beps/src/components/ui/card.tsx:5 \u00B7 typescript2/app-feedback/src/components/ui/card.tsx:5 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/card.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5faac5a8243ff0a408a6a652cf05f0abedd5eb300ac3922eb31fa6b379cd992d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (64 matched lines \u00D7 2 locations): typescript2/app-website/components/home/improve.tsx:735 \u00B7 typescript2/app-website/components/home/review.tsx:940 \u2014 the two spans are one implementation copied and then locally edited \u2014 349 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/improve.tsx"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"11de68a9d9a69b8db2339704a50e88da7bb6aa5f6a6a94ba0a8e7cffd2bea134"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (61 lines \u00D7 4 locations): engine/language_client_typescript/audio.js:2 \u00B7 engine/language_client_typescript/image.js:2 \u00B7 engine/language_client_typescript/pdf.js:2 \u00B7 engine/language_client_typescript/video.js:2 \u2014 the 4 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/audio.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b9e12c54bf470213e35d8e2e9f7232e0242a7e61328379c69863ceab6c1fa7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (61 matched lines \u00D7 2 locations): typescript2/app-website/convex/discord.ts:48 \u00B7 typescript2/app-website/convex/loops.ts:83 \u2014 the two spans are one implementation copied and then locally edited \u2014 388 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/discord.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9dbf3bb2c3d43b0bfd0367bbd684ecc0a8055c4e3afc5c216f3d74fa1c9113"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (58 matched lines \u00D7 2 locations): typescript2/pkg-playground/src/graph/nodes/BaseNode.tsx:97 \u00B7 typescript2/pkg-playground/src/graph/nodes/LLMNode.tsx:17 \u2014 the two spans are one implementation copied and then locally edited \u2014 300 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/graph/nodes/BaseNode.tsx"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f828f0d70213c52a278455dcc495be343b6b6350c52b59dc1f7b32757cb2853"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (56 matched lines \u00D7 2 locations): typescript2/app-beps/convex/beps.ts:271 \u00B7 typescript2/app-beps/convex/beps.ts:668 \u2014 the two spans are one implementation copied and then locally edited \u2014 311 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"f443edc1bcc76d9ec32355f1e95dd984a9cf1418b44074074f9659959134f8ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (56 lines \u00D7 2 locations): typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts:457 \u00B7 typescript2/app-website/playground/baml-worker.ts:297 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ecc3e49c59c90e538411324cd920c40cc3f753f1070cbda3d161d778c56ff2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (55 lines \u00D7 2 locations): engine/language_client_typescript/typescript_src/audio.ts:4 \u00B7 engine/language_client_typescript/typescript_src/image.ts:4 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/audio.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebb40771ab86d1cabd94195d54012e7c34295c319c3ea28e7cb8c0b6097444a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (55 lines \u00D7 2 locations): engine/language_client_typescript/typescript_src/pdf.ts:4 \u00B7 engine/language_client_typescript/typescript_src/video.ts:4 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/pdf.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3dcb532c47080279979fbdb2262a9d2b4c84ee4eeb932cf440ea6fc75320367"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (53 identical lines \u00D7 2 files): typescript/packages/ui/src/components/dialog.tsx:3 \u00B7 typescript2/app-website/components/ui/dialog.tsx:4 \u2014 these 2 files are line-for-line copies of one another \u2014 53 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/dialog.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf10088d4403a7be221e6d2cb0f326cef011431a4aa45b6bd92a09bbe984356"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2 locations): typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/components.tsx:16 \u00B7 typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/components.tsx:7 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/components.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"7859f4704a4a01e92c36fe152512cf1d8914864b27b1798bb766a3dbe4ebdd30"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (50 matched lines \u00D7 2 locations): typescript2/app-beps/convex/bcsComments.ts:124 \u00B7 typescript2/app-beps/convex/bcsComments.ts:252 \u2014 the two spans are one implementation copied and then locally edited \u2014 400 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsComments.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf91ad81e7e2bcc3a6ccfc173388d6bdb42a496470a8950e005e046cf7700b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (50 matched lines \u00D7 2 locations): typescript2/app-beps/src/components/bep/bep-export-all-dialog.tsx:176 \u00B7 typescript2/app-beps/src/components/bep/bep-export-dialog.tsx:132 \u2014 the two spans are one implementation copied and then locally edited \u2014 241 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-export-all-dialog.tsx"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff06b9ce9b58ea523183ae8d196caa09ae0e1e7f27fb506cde7eb5e66cc6f742"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (49 lines \u00D7 2 locations): typescript2/app-website/components/ui/dialog.tsx:9 \u00B7 typescript2/pkg-playground/src/components/ui/dialog.tsx:10 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/ui/dialog.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"407e41d3e4c1581e0528b32020c7fed18997924b4af38b900a70f8692bac9fcb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (48 matched lines \u00D7 2 locations): typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx:189 \u00B7 typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx:36 \u2014 the two spans are one implementation copied and then locally edited \u2014 286 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"726030118e4010eb6ebecb6efe094b6d14e8f7241ca3e155d0774f605ab087c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2 locations): typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/LongText.tsx:19 \u00B7 typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/LongText.tsx:19 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/LongText.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89bc0aeba93497d68566240317798cdd2b510900ecac9336783a63c4c0916e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (47 matched lines \u00D7 2 locations): typescript2/app-beps/convex/beps.ts:39 \u00B7 typescript2/app-beps/convex/export.ts:36 \u2014 the two spans are one implementation copied and then locally edited \u2014 332 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb903beb5cc4306071c1bf9e56d2baa70ef3872dad4319bed17802e8a151fe50"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2 locations): typescript2/app-beps/src/components/ui/button.tsx:7 \u00B7 typescript2/app-feedback/src/components/ui/button.tsx:7 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/button.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a4dc6778b7ea145f545c432da7a48cf5cec247fc148464b7dcea34c9176a15"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2 locations): typescript/packages/ui/src/components/dialog.tsx:9 \u00B7 typescript/packages/ui/src/components/drawer.tsx:8 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/dialog.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bfd5bf992af947fce6866b3552678a7659313bebc6e797f860a088e504939d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2 locations): typescript/packages/ui/src/components/drawer.tsx:70 \u00B7 typescript/packages/ui/src/components/sheet.tsx:79 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/drawer.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ceec03e93f42540629ede5694e2c4d86f2a964bb3d15abc278e0328f5f7d48"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2 locations): typescript2/app-beps/src/components/bep/bep-card.tsx:9 \u00B7 typescript2/app-beps/src/components/bep/bep-kanban-card.tsx:8 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-card.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2023bac4c1d3c018b979850706d80a1b1afe28b83f97ef4b5f476bf9bd40557f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 3 locations): typescript/packages/ui/src/components/alert-dialog.tsx:61 \u00B7 typescript/packages/ui/src/components/dialog.tsx:70 \u00B7 typescript2/app-website/components/ui/dialog.tsx:78 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/alert-dialog.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc05518e103cd9fc48c3c9a07fd702f49af350ebc036a76dc68638392cbf4088"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2 locations): typescript2/app-product-metrics/src/report.ts:33 \u00B7 typescript2/app-product-metrics/src/snapshot.ts:35 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/report.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6786112f7d4195e95573282cd02e957b766e645464dc0012e0e61c40668ac42a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 3 locations): typescript2/pkg-playground/src/ExecutionPanel.tsx:413 \u00B7 typescript2/pkg-playground/src/ExecutionPanel.tsx:3038 \u00B7 typescript2/pkg-playground/src/ExecutionPanel.tsx:3547 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80f02c3bccef119e426fd074db100d83df1713833d2d01abb2efa133489b96d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2 locations): typescript2/app-promptfiddle/src/playground/vfs.ts:329 \u00B7 typescript2/app-website/playground/vfs.ts:351 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/vfs.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ab682ad6d2e8fbe670e7411c0b9f537482bdb73e1dfc6e3c79c4dc7493f593"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (41 matched lines \u00D7 2 locations): typescript2/app-website/app/(home)/podcast/page.tsx:59 \u00B7 typescript2/app-website/app/(home)/who-are-we/page.tsx:124 \u2014 the two spans are one implementation copied and then locally edited \u2014 204 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/podcast/page.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"5665916133cfa93c2151035979f40b1532f5509c3852a9ddc3f2cb70163c235e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2 locations): typescript/packages/ui/src/components/context-menu.tsx:53 \u00B7 typescript/packages/ui/src/components/menubar.tsx:216 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/context-menu.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"520ab2b6a31abe52ae693a1490b6f4433d265ea93b5bf6695d788e637cec9ac3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2 locations): typescript/packages/ui/src/components/tooltip.tsx:8 \u00B7 typescript2/app-website/components/ui/tooltip.tsx:8 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/tooltip.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08c725bac16e0b729168e91b97ff024045166c134d2d3e6b55d6c83cc5697cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (38 matched lines \u00D7 2 locations): typescript2/app-beps/src/app/bcs/[number]/decisions/page.tsx:13 \u00B7 typescript2/app-beps/src/app/bcs/[number]/issues/page.tsx:14 \u2014 the two spans are one implementation copied and then locally edited \u2014 360 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/decisions/page.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3518c9a7c4e77653102c7775b3a4f1ca066fc22d9edbdd593e4e970d0f6e08"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2 locations): typescript2/pkg-playground/src/ExecutionPanel.tsx:3109 \u00B7 typescript2/pkg-playground/src/ExecutionPanel.tsx:3618 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":3109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8403bba4473bb269a8b8d7ce36ba210249e1bc01c26196ee2909998a04edcb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2 locations): typescript2/pkg-playground/src/graph/nodes/DiamondNode.tsx:10 \u00B7 typescript2/pkg-playground/src/graph/nodes/HexagonNode.tsx:10 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/graph/nodes/DiamondNode.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c874ef28d185132bbd96810d61d3d1b8c96f2f0ed0603eedf794cecf07524a96"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (37 matched lines \u00D7 2 locations): typescript2/app-beps/src/app/api/agent/beps/[number]/comments/reply/route.ts:92 \u00B7 typescript2/app-beps/src/app/api/agent/beps/[number]/comments/route.ts:137 \u2014 the two spans are one implementation copied and then locally edited \u2014 231 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/beps/[number]/comments/reply/route.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6e7e455ad49f29153eb91dc2cb40c62ed32d2f5d5d5196093705f68fe3619a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (37 matched lines \u00D7 2 locations): typescript2/app-beps/src/components/decisions/decision-list.tsx:12 \u00B7 typescript2/app-beps/src/components/issues/issue-list.tsx:14 \u2014 the two spans are one implementation copied and then locally edited \u2014 224 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/decisions/decision-list.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9886793a3f8e490edff5afa31271b25e74a732adbd4387b45f4f3b68849bb3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2 locations): typescript2/pkg-playground/src/ExecutionPanel.tsx:2998 \u00B7 typescript2/pkg-playground/src/ExecutionPanel.tsx:3502 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":2998}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cea23d90cc1a37233b9abe2e787d54e6c7dd73ce47e7d5fe5954dec17465b04"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2 locations): engine/generators/data/edge_cases/typescript/index.ts:213 \u00B7 engine/generators/data/nested_structures/typescript/index.ts:214 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/edge_cases/typescript/index.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"4848922f3d0cc0807a7a5b78103cb19dc07ff12af67a3652c7cac3c29a04622f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2 locations): typescript2/app-beps/src/components/comments/comment-feed-view.tsx:450 \u00B7 typescript2/app-beps/src/components/comments/comment-thread.tsx:292 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c58d5c7df56b4ffac2435c76ddfb6dd42981030b1fb3cc38db7fae7832c211f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (36 matched lines \u00D7 2 locations): typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-object-parameters.ts:14 \u00B7 typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-unknown-returns.ts:11 \u2014 the two spans are one implementation copied and then locally edited \u2014 199 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-object-parameters.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"577f96920990eeaa83d20133a9169edc61d579bf0a6c396dcc02286a34331274"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2 locations): typescript/packages/ui/src/custom/number-input.tsx:25 \u00B7 typescript/packages/ui/src/custom/text-input.tsx:27 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/custom/number-input.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"282237871b40dda78a2cc8ccd054b895cfa687833ff7397c2832bfc01c453bf5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2 locations): typescript2/app-developer-docs/scripts/populate-generated-content.ts:95 \u00B7 typescript2/app-developer-docs/scripts/promote-document-alias.ts:29 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/scripts/populate-generated-content.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"5779f9436a8b50ba7c5778728e2a6f213cb059970c019de4a20f62efa47674de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2 locations): typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/smart-edge.ts:283 \u00B7 typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/smart-edge.ts:379 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/smart-edge.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e4ae3af1bd69b1ab19fb85d43e1a56030661e1d08854990c553c5097447d65"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2 locations): typescript2/app-beps/src/components/bep/bep-import-dialog.tsx:387 \u00B7 typescript2/app-beps/src/components/bep/bep-submit-modal.tsx:85 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-import-dialog.tsx"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd83d3ed11a8441ed0331ed7683417f1584651524e2475e60de15b16f7a07cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (34 matched lines \u00D7 2 locations): typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts:1025 \u00B7 typescript2/app-website/playground/baml-worker.ts:803 \u2014 the two spans are one implementation copied and then locally edited \u2014 164 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"3574fa1a157873ec75cf5c849927d3e866f8f81ba3b3aff28c9ef14c09eb22f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (33 matched lines \u00D7 2 locations): engine/generators/data/map_types/typescript/index.ts:3 \u00B7 engine/generators/data/map_types/typescript/index.ts:113 \u2014 the two spans are one implementation copied and then locally edited \u2014 241 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/map_types/typescript/index.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"5890f2a06df48acf8f1997b88c8999c8e99781ec3cc1bfb4911a712a01f74841"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2 locations): typescript/packages/playground-common/src/sdk/interface/types.ts:110 \u00B7 typescript/packages/playground-common/src/sdk/types.ts:104 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/interface/types.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eafe6032f99e79298d48ff9ef2d94265bad4f4ad6f7997bf6dc4a02033b23a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2 locations): typescript2/app-beps/convex/migrations.ts:74 \u00B7 typescript2/app-beps/convex/migrations.ts:122 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/migrations.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a6f19fbe6df1c6b532db87561e43b8e0ae3033202be54664630cf47e5f1fa1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (33 matched lines \u00D7 2 locations): typescript2/app-website/app/(home)/logo-ideas/generated.tsx:92 \u00B7 typescript2/app-website/app/(home)/logo-ideas/generated.tsx:624 \u2014 the two spans are one implementation copied and then locally edited \u2014 214 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/logo-ideas/generated.tsx"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c81a72af951cd1ac1d6fbb0655c110bac271efefa9d01209af236689915447d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx:474 \u00B7 typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx:797 \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":"typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"b882a36a3cbf3b688fa7545ee4f0c10a284174fb26db5441ba09ab233bc491b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (31 matched lines \u00D7 2 locations): typescript2/app-beps/convex/comments.ts:21 \u00B7 typescript2/app-beps/convex/comments.ts:158 \u2014 the two spans are one implementation copied and then locally edited \u2014 179 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/comments.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c116e141e9c32f879b8f6f57ed78f49ae47dbab694587e36635661a3e2d2164"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (31 matched lines \u00D7 2 locations): typescript2/app-beps/src/app/api/agent/beps/[number]/comments/route.ts:95 \u00B7 typescript2/app-beps/src/components/comments/comment-feed-view.tsx:80 \u2014 the two spans are one implementation copied and then locally edited \u2014 259 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/beps/[number]/comments/route.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cbca9d67f13156ba486cf7bf7b0418ac2f56b127bc4576c0aecff2fc186597"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts:796 \u00B7 typescript2/app-website/playground/baml-worker.ts:688 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ed7757960ebdb127f2afbaeaaaf3c1a50e9479eaf17aa8ea029a75710d3fbe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): engine/language_client_typescript/typescript_src/type_builder.ts:132 \u00B7 engine/language_client_typescript/typescript_src/type_builder.ts:242 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/type_builder.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d065bef1bf9135f071e5645523879a42ae30179d5a435af48c19914e81655e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (29 matched lines \u00D7 2 locations): typescript2/app-product-metrics/src/external-data.ts:33 \u00B7 typescript2/app-product-metrics/src/jobs/aggregate-weekly-metric.ts:53 \u2014 the two spans are one implementation copied and then locally edited \u2014 249 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/external-data.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba486cbd48e08b2d341e6542af448dcf03f13ea74397217c2456d628c205131a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): typescript2/pkg-playground/src/telemetry/TelemetryView.tsx:1309 \u00B7 typescript2/pkg-playground/src/telemetry/TelemetryView.tsx:1376 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa4e0755e29b4113b807e48c6837c85a0cff9b3a55323faadd3836129d326da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): engine/language_client_typescript/type_builder.js:92 \u00B7 engine/language_client_typescript/type_builder.js:175 \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":"engine/language_client_typescript/type_builder.js"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff57a6ecc1d12f9a13e50a02a31abd048a5ae5752a7df6b743ca59396cb29ca3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): typescript/apps/fiddle-web-app/app/[project_id]/_components/Tour.tsx:61 \u00B7 typescript/apps/fiddle-web-app/app/[project_id]/_components/Tour.tsx:154 \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":"typescript/apps/fiddle-web-app/app/[project_id]/_components/Tour.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"fddf8324a679f65f3da5301e31a7bfc028a57cee920a4016697eac72a0554621"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): typescript/packages/playground-common/src/graph-primitives/nodes/BaseNode/index.tsx:188 \u00B7 typescript/packages/playground-common/src/graph-primitives/nodes/HexagonNode/index.tsx:55 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/nodes/BaseNode/index.tsx"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"18aa51a4eba665e01995a68c9659ec5c7a2ef0849f1a4a92be1649d7d32b0365"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): typescript/packages/ui/src/components/tabs.tsx:8 \u00B7 typescript2/app-beps/src/components/ui/tabs.tsx:8 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/tabs.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"980a5dd45525b136ffc8d4babe1a9ca530e3f26da57a770d7d9b780304e2fe53"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/LongText.tsx:14 \u00B7 typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/render-text.tsx:33 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/LongText.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e976ad1da8324e76bcfd368814df6777327577dce2aa38067d51eef90646e5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): typescript/apps/vscode-ext/src/panels/WebviewPanelHost.ts:650 \u00B7 typescript/apps/vscode-ext/src/panels/WebviewPanelHost.ts:699 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/panels/WebviewPanelHost.ts"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbbf3d30b1e72623d1cb0280bb7e7ad25f7d3f1121bbefd364f31ca777834006"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (27 matched lines \u00D7 2 locations): typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/highlight-utils.ts:18 \u00B7 typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/render-part.tsx:14 \u2014 the two spans are one implementation copied and then locally edited \u2014 204 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/highlight-utils.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5672ce1627ee0596ace81d8e8330eff50eb540bad1955b0fa53fbee1dff6edce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): typescript2/app-beps/src/components/decisions/decision-form.tsx:37 \u00B7 typescript2/app-beps/src/components/issues/issue-form.tsx:35 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/decisions/decision-form.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ceada97cf43117abe44e0d553422a1d74b5dc1fdb756dab9a66368bc9428ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): typescript2/pkg-grammar-treesitter/scripts/assemble-mirror.mjs:41 \u00B7 typescript2/pkg-grammar/scripts/assemble-mirror.mjs:43 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar-treesitter/scripts/assemble-mirror.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f68b8550db6cd518ad735f54fff381c6c6df9e4254f634380ef69c1f2a9d2ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): typescript/packages/playground-common/src/graph-primitives/nodes/BaseNode/index.tsx:100 \u00B7 typescript/packages/playground-common/src/graph-primitives/nodes/LLMNode/index.tsx:103 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/nodes/BaseNode/index.tsx"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2c681da478d871150ee4904108ed2f8b834933f71ad6ee3f59a76e410454f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): typescript/packages/playground-common/src/utils/AnsiText.tsx:4 \u00B7 typescript2/app-website/lib/mdx/baml-block/baml-project-panel/code-sandbox/AnsiText.tsx:6 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/utils/AnsiText.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcf7fb69235d79684452f978dc6d202acb20be9af919abacd699c1596620282"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): typescript2/app-developer-docs/scripts/migrate-generated-content.ts:43 \u00B7 typescript2/app-developer-docs/scripts/populate-generated-content.ts:91 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/scripts/migrate-generated-content.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9f15454e6ba22137863854d6c1863e2097b02592e7fdd07653b379a3e5dca3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): typescript2/app-product-metrics/src/http.ts:140 \u00B7 typescript2/app-product-metrics/src/http.ts:183 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/http.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bdf8fcac91098ce271c5ebc040bd7b35a8350d39c04fb3c7aaf8e30134a8bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): typescript2/app-website/components/ui/card.tsx:5 \u00B7 typescript2/app-website/components/ui/card.tsx:51 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/ui/card.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89a8809dbee22771f25fb6396dd0ee160be4ad466b9b1d98a141b59e2e315b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): typescript/packages/ui/src/components/collapsible.tsx:5 \u00B7 typescript2/pkg-playground/src/components/ui/collapsible.tsx:3 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/collapsible.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d0b112f97a8594468edf9ed764a6cdf60d8f8797e371f2b5731e501e56408a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts:967 \u00B7 typescript2/app-website/playground/baml-worker.ts:754 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b30ee7fb0af26b8b53e8d102f9115bf25727638006487edd7d416a45fe1f8e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): typescript2/app-website/app/(home)/eap/local-session-preview/page.tsx:60 \u00B7 typescript2/app-website/app/(home)/eap/page.tsx:25 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/eap/local-session-preview/page.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8cbabd7a9c6a63df76527a8e065f887e8f445f3ebac95d43fce209764027753"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/side-bar/index.tsx:183 \u00B7 typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/side-bar/index.tsx:268 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/side-bar/index.tsx"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"1395730cd8e8e19d2cc9f6a5b74d241c72c16b39827d492dd38311fdb14d2887"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 3 locations): typescript2/pkg-grammar-hljs/scripts/assemble-mirror.mjs:35 \u00B7 typescript2/pkg-grammar-treesitter/scripts/assemble-mirror.mjs:43 \u00B7 typescript2/pkg-grammar/scripts/assemble-mirror.mjs:45 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar-hljs/scripts/assemble-mirror.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93857946b08671b848d8985a785418a76671237e40f120e4cd3063b1d8589c3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): typescript/apps/vscode-ext/src/plugins/language-server-client/bamlConfig.ts:5 \u00B7 typescript/packages/playground-common/src/baml_wasm_web/bamlConfig.ts:5 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/plugins/language-server-client/bamlConfig.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc9cfacdf13f869dd197c9e59b3d35e535a1fd33fcd9c5502c4298961b82630"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3 locations): typescript/packages/ui/src/components/dropdown-menu.tsx:157 \u00B7 typescript/packages/ui/src/components/tabs.tsx:8 \u00B7 typescript2/app-beps/src/components/ui/tabs.tsx:8 \u2014 the 3 copies are spread across 3 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/dropdown-menu.tsx"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff88ee42d361f97200898ba81c5e0abab366c6716ff9be0d4cd156b4a2455f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): typescript/packages/ui/src/components/resizable.tsx:31 \u00B7 typescript2/app-website/components/ui/resizable.tsx:31 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/resizable.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6509e27b52343544925c932a0e86c3edb1154743832b2b28b6b4aa94f8b139f5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (24 matched lines \u00D7 2 locations): typescript2/app-beps/convex/userStances.ts:9 \u00B7 typescript2/app-beps/convex/userStances.ts:80 \u2014 the two spans are one implementation copied and then locally edited \u2014 158 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/userStances.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6f917f4f007996b7c49e76856d2f750ff422c29046c37d7f1acac34c4e0037"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): typescript2/app-beps/src/app/api/agent/beps/route.ts:302 \u00B7 typescript2/app-beps/src/app/api/agent/beps/route.ts:422 \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":"typescript2/app-beps/src/app/api/agent/beps/route.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c3625e64b11c07ea2f18ce91b2a48b94ab5ed2eb4db4154859cc0004d8ae09"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): typescript2/app-beps/src/app/bcs/actions.ts:120 \u00B7 typescript2/app-beps/src/app/bcs/actions.ts:151 \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":"typescript2/app-beps/src/app/bcs/actions.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9606945ce5a727337bf916dd6851561f42bf0b0c37fdb50c6020761abf45d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3 locations): typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts:763 \u00B7 typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts:793 \u00B7 typescript2/app-website/playground/baml-worker.ts:685 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfeb8cd56abb66d408ee5a63b49a0dbfe2b3ff2bf88bdd9f05a0f456997b5698"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (24 matched lines \u00D7 2 locations): typescript2/app-website/components/home/hero-video.tsx:501 \u00B7 typescript2/app-website/components/home/workflow.tsx:388 \u2014 the two spans are one implementation copied and then locally edited \u2014 135 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/hero-video.tsx"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d642926ebe33e304b1de170b8b1844131236489818c1bc20905e8399d5e64ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3 locations): typescript2/app-website/lib/mdx/sap/intro.tsx:188 \u00B7 typescript2/app-website/lib/mdx/sap/intro.tsx:238 \u00B7 typescript2/app-website/lib/mdx/sap/intro.tsx:281 \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":"typescript2/app-website/lib/mdx/sap/intro.tsx"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"740041946c53d2fa5a8271c8dc67c8941f154eec554b3d6e9bacd28dad74d715"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): typescript2/pkg-playground/src/ExecutionPanel.tsx:3157 \u00B7 typescript2/pkg-playground/src/ExecutionPanel.tsx:3674 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":3157}}}],"partialFingerprints":{"codehealthFindingId/v1":"7798d0285cbd76bdaac88020926c8d5649497579e57ea039cbca7747f135a1ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): typescript2/pkg-playground/src/telemetry/TelemetryView.tsx:1423 \u00B7 typescript2/pkg-playground/src/telemetry/TelemetryView.tsx:1559 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26056af2844a113a53271f0a7bedeb02ac1e597940edf6ccf074897ba7bbe47"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): typescript2/app-beps/src/app/bcs/actions.ts:454 \u00B7 typescript2/app-beps/src/app/bcs/actions.ts:493 \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":"typescript2/app-beps/src/app/bcs/actions.ts"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3daf75a9c51b6e1d4fe50c161301cdda4538c2101b42ec261f39aacd327011"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): typescript2/app-beps/src/components/ui/dropdown-menu.tsx:74 \u00B7 typescript2/app-beps/src/components/ui/dropdown-menu.tsx:138 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/dropdown-menu.tsx"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9e527d5970fddd8ef642a1ee6a72746c15aef31c693df4537b597296c8a684"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 4 locations): typescript2/app-developer-docs/scripts/backfill-document-store.ts:120 \u00B7 typescript2/app-developer-docs/scripts/migrate-generated-content.ts:47 \u00B7 typescript2/app-developer-docs/scripts/populate-generated-content.ts:95 \u00B7 typescript2/app-developer-docs/scripts/promote-document-alias.ts:29 \u2014 the 4 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/scripts/backfill-document-store.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2aa6dee2cf1f90c88ce4f0860928a0e19262e06fd303be4779ae94b6d0ec049"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): typescript2/app-website/components/icons.tsx:100 \u00B7 typescript2/app-website/components/icons.tsx:1435 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/icons.tsx"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6dae78ed8aee9302787bffc9a2722366e706d045143a6c0a1e56d356795ca0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): typescript2/pkg-playground/src/ExecutionPanel.tsx:3203 \u00B7 typescript2/pkg-playground/src/ExecutionPanel.tsx:3397 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":3203}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9605439fb67291ab362718560752fe854cbb60daf4fa6940d9f8df9d0ea8ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 4 locations): typescript/packages/ui/src/components/avatar.tsx:26 \u00B7 typescript/packages/ui/src/components/select.tsx:123 \u00B7 typescript2/app-website/components/ui/select.tsx:127 \u00B7 typescript2/app-website/components/ui/tabs.tsx:10 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/avatar.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"3825554884d6dec7a9c1180aa5e1b0b052ada34203b517978da2b62943fc51f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): typescript/packages/ui/src/components/radio-group.tsx:22 \u00B7 typescript2/app-website/components/ui/radio-group.tsx:22 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/radio-group.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"64728330332d93c6cd54016a2bc77a77606e0b65c36a9a65e871fc656db26035"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts:998 \u00B7 typescript2/app-website/playground/baml-worker.ts:785 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"0772cf3e9910a42be947bf871340db1fed27e617431454c0c539dfe22fe92245"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (22 matched lines \u00D7 2 locations): typescript2/app-stdlib-matrix/src/components/matrix-group.ts:29 \u00B7 typescript2/app-stdlib-matrix/src/components/matrix-symbol.ts:100 \u2014 the two spans are one implementation copied and then locally edited \u2014 121 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-stdlib-matrix/src/components/matrix-group.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"48cd5a2a34ee4314e09ea050392bf1a80c80a67d7e759967ca84787b552f0084"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): typescript2/app-website/components/magicui/syntax-typing-animation.tsx:35 \u00B7 typescript2/app-website/components/magicui/terminal.tsx:58 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/magicui/syntax-typing-animation.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad125c7280a3892f9b505a3f1c0a83cb3b4a45b7f069cb5cfe7ad0331183beb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (21 matched lines \u00D7 2 locations): engine/language_client_typescript/typescript_src/async_context_vars.ts:83 \u00B7 engine/language_client_typescript/typescript_src/async_context_vars.ts:107 \u2014 the two spans are one implementation copied and then locally edited \u2014 148 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/async_context_vars.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"beceaf3be53d46ed3f9f5b350ad12472ca8972215b049a4578dace4a5d6b778a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): typescript/packages/ui/src/components/popover.tsx:20 \u00B7 typescript2/app-website/components/ui/popover.tsx:20 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/popover.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"bedd46a7e6988c198d4cd5491b38f3ef9044d96ea5f6e7be559b656c63a6ca00"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): typescript2/app-beps/src/components/ai-assistant/ai-assistant-panel.tsx:298 \u00B7 typescript2/app-beps/src/components/ai-assistant/ai-assistant-panel.tsx:319 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ai-assistant/ai-assistant-panel.tsx"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"2305fd999b665388da53d3768af5d63e1bcc30cec950e4848c37bbc3fc7e5a81"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3 locations): typescript2/app-beps/src/components/comments/comment-feed-view.tsx:509 \u00B7 typescript2/app-beps/src/components/comments/comment-feed-view.tsx:818 \u00B7 typescript2/app-beps/src/components/comments/comment-thread.tsx:360 \u2014 the 3 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e1a02b2ebce9ca48e14f91b4e9bce3a8b8e2ad7c2dbb884fed68adfd99611f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 9 locations): typescript2/app-website/components/icons.tsx:34 \u00B7 typescript2/app-website/components/icons.tsx:172 \u00B7 typescript2/app-website/components/icons.tsx:900 \u00B7 typescript2/app-website/components/icons.tsx:1369 \u00B7 \u002B5 more site(s) not listed \u2014 all 9 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/icons.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e38af28cfa54c184c8e9b45c3e01f91b51a1b24756f2ca826e5d6ce9c200261"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/LongText.tsx:45 \u00B7 typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/render-text.tsx:66 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/LongText.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66c1d9941f28167bfc750915699c69a3e2d933d521038337d93b31fe498fcd1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): baml_language/tools/speedtest/workloads/memory/allocation-high-retention/main.js:2 \u00B7 baml_language/tools/speedtest/workloads/memory/allocation-low-retention/main.js:2 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/memory/allocation-high-retention/main.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f6a8311fbbb27decefd5c97e1bd54c27d94a3201a9fb503715f561ce296a44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): typescript/apps/fiddle-web-app/app/[project_id]/_components/Tree/Node.tsx:16 \u00B7 typescript/packages/playground-common/src/Tree/Node.tsx:10 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_components/Tree/Node.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f53843868097418b2c1a62832ed9c5ffc387e0a1c45018f0acc0497463c823"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/function-test-name.tsx:175 \u00B7 typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/function-test-name.tsx:219 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/function-test-name.tsx"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4b3fb03770784a77e05c7dfd1e0064cae4b8c349748f9fb0ee799e20301764"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 6 locations): typescript/packages/ui/src/components/alert-dialog.tsx:84 \u00B7 typescript/packages/ui/src/components/avatar.tsx:13 \u00B7 typescript/packages/ui/src/components/dialog.tsx:87 \u00B7 typescript/packages/ui/src/components/navigation-menu.tsx:39 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 6 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/alert-dialog.tsx"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efefcb3f9973f6bde196710b09ae80843c3bac1aa026f3e1489d37d7dc92709"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): typescript/packages/ui/src/components/button.tsx:42 \u00B7 typescript2/app-website/components/ui/button.tsx:36 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/button.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7aebd49e9d6ee7e02dd35ff5794b8fd7da1593d79ea109149599e578b95e33"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-reflect-apply.ts:9 \u00B7 typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-reflect-get.ts:9 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-reflect-apply.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e560982244f24b77eaac311db82ec80f10726f7c2070ca85c863742612e5f32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts:191 \u00B7 typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts:229 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d7ce489ecafd003f4bf57704f601009216d532babc43a7974dc3909d473ccb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts:393 \u00B7 typescript2/app-website/playground/baml-worker.ts:234 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"984e5e80b1ac1a2910cb5af5e675f9757fe09817d9c463760709663d6d381e64"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): engine/generators/data/array_types/typescript/index.ts:214 \u00B7 engine/generators/data/edge_cases/typescript/index.ts:250 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/array_types/typescript/index.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8576801cecc937a2b34f8c6ef67a901dba85731d2012a573208385ccd453ea2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): engine/language_client_typescript/async_context_vars.js:75 \u00B7 engine/language_client_typescript/async_context_vars.js:96 \u2014 the two spans are one implementation copied and then locally edited \u2014 131 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/async_context_vars.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d8cff56c0603a3704008dafeffc6c9a4ca87d06615dbfc48c4ae3600aa5724"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): typescript/apps/fiddle-web-app/app/embed/clientwrapper.tsx:27 \u00B7 typescript/packages/playground-common/src/utils/ErrorFallback.tsx:11 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/embed/clientwrapper.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5f4f3b774a09a6cb207d828dc7b331bd86fbee9558989cfd53e564f984c1a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): typescript/packages/playground-common/src/Tree/Node.tsx:44 \u00B7 typescript/packages/playground-common/src/shared/Tree/Node.tsx:23 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/Tree/Node.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"41970103d36760222dd4470791c364f5884642fa0c12c6e90ea64b2362b51773"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/atoms.ts:158 \u00B7 typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/atoms.ts:110 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/atoms.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c9abd8a22504f061be2e9666ae23608fb2896039d5e07d1126bd531ad0f3af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): typescript/packages/ui/src/components/alert.tsx:46 \u00B7 typescript/packages/ui/src/components/command.tsx:147 \u00B7 typescript/packages/ui/src/components/context-menu.tsx:216 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/alert.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8a848eb7455ec48dbabcb4eb1d568eaa903fa5095b92f8c9ed02b4cd134679"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 4 locations): typescript/packages/ui/src/components/command.tsx:78 \u00B7 typescript/packages/ui/src/components/menubar.tsx:9 \u00B7 typescript/packages/ui/src/components/resizable.tsx:9 \u00B7 typescript2/app-website/components/ui/resizable.tsx:9 \u2014 the 4 copies are spread across 4 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/command.tsx"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc017b7043856173dddcc117241d47824b4112e15d23448e2bc9bf113c0da2a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): typescript/packages/ui/src/components/menubar.tsx:9 \u00B7 typescript/packages/ui/src/components/resizable.tsx:9 \u00B7 typescript2/app-website/components/ui/resizable.tsx:9 \u2014 the 3 copies are spread across 3 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/menubar.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"1baaf745dc45dfa264cf1b4b4e31ee4333be41cbdfd574e006e5d97c2c1ddd25"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): typescript/packages/ui/src/components/tooltip.tsx:28 \u00B7 typescript2/app-website/components/ui/tooltip.tsx:28 \u00B7 typescript2/pkg-playground/src/components/ui/tooltip.tsx:24 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/tooltip.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a243791ad5658c14b2c59ecfb5a7e40a2ae541482f481e7c44fb640d05dc515"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): typescript2/app-beps/convex/slack.ts:78 \u00B7 typescript2/app-beps/convex/slack.ts:120 \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":"typescript2/app-beps/convex/slack.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5faca0bac579f0fcd56346063f344950ab611737395ece9c8ecfb6519d62c1e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): typescript2/app-beps/convex/slack.ts:367 \u00B7 typescript2/app-beps/convex/slack.ts:467 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/slack.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8cd0784d1c70b9642c2a2fb5db9fc7f826a57f29adf2fdb462611d9a0f84924"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): typescript2/app-beps/src/app/bcs/board.tsx:245 \u00B7 typescript2/app-feedback/src/components/issues/issue-list.tsx:271 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/board.tsx"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b38598fba618ce7535cc869422368f503455ee726dfaefb0216549f41fcd72"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): typescript2/app-beps/src/app/users/page.tsx:286 \u00B7 typescript2/app-beps/src/app/users/page.tsx:306 \u00B7 typescript2/app-beps/src/app/users/page.tsx:326 \u2014 all 3 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/users/page.tsx"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"5115670f92487c2567b550992d513a96f4274b919583410c1b04392c7df4a1cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): typescript2/app-beps/src/components/bep/bep-nav.tsx:217 \u00B7 typescript2/app-beps/src/components/bep/bep-nav.tsx:238 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-nav.tsx"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"32299fde82079b01e0481c87e9aec6739766142f14523e38bda80b86ce7d5987"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): typescript2/app-beps/src/components/comments/comment-feed-view.tsx:247 \u00B7 typescript2/app-beps/src/components/comments/comment-thread.tsx:168 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a1920e2ab68509978f3051855ca9e7bf39d244f84f10f20a530dd0ec41a156"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): typescript2/app-beps/src/components/comments/comment-sidebar.tsx:624 \u00B7 typescript2/app-beps/src/components/comments/comment-sidebar.tsx:895 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-sidebar.tsx"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2599d2af280772c1bcca547173f9ed7eafe675d564b73f3a709dce8c2bd0ad3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 4 locations): typescript2/app-website/components/icons.tsx:256 \u00B7 typescript2/app-website/components/icons.tsx:564 \u00B7 typescript2/app-website/components/icons.tsx:1679 \u00B7 typescript2/app-website/components/icons.tsx:1877 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/icons.tsx"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"8109647202ebe6f69bffe889d015edf7b3e4c8e778e8c18479bc48d1a3855ac6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 4 locations): typescript2/app-website/components/icons.tsx:990 \u00B7 typescript2/app-website/components/icons.tsx:1563 \u00B7 typescript2/app-website/components/icons.tsx:2214 \u00B7 typescript2/app-website/components/icons.tsx:2327 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/icons.tsx"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2cb8834bd118cdc580590852ca4c38ca7cac2b0ec953726b09d989b04a5e327"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): typescript2/app-website/components/ui/dialog.tsx:73 \u00B7 typescript2/pkg-playground/src/components/ui/dialog.tsx:74 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/ui/dialog.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7c4ea32ef9adca28eb22b2d99616c4e68a08c62958eb2c5c9a4a2dafff496c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): engine/generators/data/literal_types/typescript/index.ts:100 \u00B7 engine/generators/data/map_types/typescript/index.ts:216 \u00B7 engine/generators/data/optional_nullable/typescript/index.ts:165 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/literal_types/typescript/index.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb5315b1056b2a22a6e2b90dc390075beee53efeb8bbd60c5d971af6c4b7370"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): typescript/packages/playground-common/src/wasm/internals.ts:27 \u00B7 typescript2/pkg-playground/src/wasm-panic/panic.ts:41 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/wasm/internals.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"319f0aafc509173bc70187e5bd30d42caced4e6469a0e2fa0f466e852cd6bcb6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): typescript2/app-beps/src/app/profile/page.tsx:38 \u00B7 typescript2/app-beps/src/app/users/page.tsx:45 \u2014 the two spans are one implementation copied and then locally edited \u2014 176 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/profile/page.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"79152d15f88f1668d639792c4a0023c2fe89c9af38c6d37a5e962e22041dc611"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): typescript2/app-beps/src/components/comments/comment-sidebar.tsx:569 \u00B7 typescript2/app-beps/src/components/comments/comment-sidebar.tsx:852 \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":"typescript2/app-beps/src/components/comments/comment-sidebar.tsx"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9084d70620aae9f0cb0f190c20aa10c0e96b15a12c8b3f1ebae1e02f3d9e44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3 locations): typescript2/app-beps/src/components/comments/comment-thread.tsx:559 \u00B7 typescript2/app-beps/src/components/ui/theme-toggle.tsx:93 \u00B7 typescript2/app-feedback/src/components/ui/theme-toggle.tsx:96 \u2014 the 3 copies are spread across 3 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-thread.tsx"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7b96ec343f56230d2028363413275532be3e56b72eee209051771ecf68465c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): typescript2/app-website/components/home/tracker.tsx:1636 \u00B7 typescript2/app-website/components/home/tracker.tsx:1927 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/tracker.tsx"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e6ef6859fb5d0d750287b7d4290123683782172d1ed019837ff038b826a643"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): typescript2/app-website/components/icons.tsx:1034 \u00B7 typescript2/app-website/components/icons.tsx:1175 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/icons.tsx"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3d774ff17ed5a0345cce415c4dd30854a3647d9a8d924b1d5b6d3ff33ce542"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): engine/generators/data/nested_structures/typescript/index.ts:251 \u00B7 engine/generators/data/union_types_extended/typescript/index.ts:152 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/nested_structures/typescript/index.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65ca27d9cb9239a6e6ea7a781e1eded43696d757c5d99e8e244843736446c3f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): typescript/packages/playground-common/src/Tree/FileViewer.tsx:24 \u00B7 typescript/packages/playground-common/src/shared/Tree/FileViewer.tsx:59 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/Tree/FileViewer.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f766f4cea6899e97aab34a811a9e535f0d7586f20d980db16fa39902a0ae4a2f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): typescript/packages/playground-common/src/components/ErrorWarningDialog.tsx:57 \u00B7 typescript/packages/playground-common/src/components/ErrorWarningDialog.tsx:76 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/components/ErrorWarningDialog.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c565b53fca97dad6790ed0a3beb0e2559c7639aae6c1f7e258c40f8cf583cf0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3 locations): typescript/packages/playground-common/src/features/detail-panel/components/ExecutionLogPanel.tsx:121 \u00B7 typescript/packages/playground-common/src/features/detail-panel/components/ExecutionLogPanel.tsx:213 \u00B7 typescript/packages/playground-common/src/features/detail-panel/components/ExecutionLogPanel.tsx:254 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/detail-panel/components/ExecutionLogPanel.tsx"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b40b5f67d289e7cc5131d7cc6c42eeb07719d60f8fd3822b0b6176064540669"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): typescript/packages/playground-common/src/sdk/sdk.ts:1042 \u00B7 typescript/packages/playground-common/src/sdk/sdk.ts:1063 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/sdk.ts"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"063daafd3d2494fff8511c4e165ff58da51a0576670206acc5e0a7486f03f758"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3 locations): typescript/packages/ui/src/components/accordion.tsx:17 \u00B7 typescript/packages/ui/src/components/select.tsx:86 \u00B7 typescript2/app-website/components/ui/select.tsx:90 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/accordion.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3079d3b01f1aec3ee5d9a67731b8751776842ab5b38c39d750adefa3d996198"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 10 locations): typescript/packages/ui/src/components/alert-dialog.tsx:87 \u00B7 typescript/packages/ui/src/components/avatar.tsx:16 \u00B7 typescript/packages/ui/src/components/command.tsx:114 \u00B7 typescript/packages/ui/src/components/context-menu.tsx:199 \u00B7 \u002B6 more site(s) not listed \u2014 the 10 copies are spread across 10 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/alert-dialog.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"29dcccd31901703fd63d9769848cead5017edd85a2530c8802dddfd919e8ad1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): typescript/packages/ui/src/components/badge.tsx:28 \u00B7 typescript2/app-website/components/ui/badge.tsx:28 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/badge.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"55df8e75b70a367aaeaec2c5be59ae083c296ac660825175f573e3a3afffdf11"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3 locations): typescript/packages/ui/src/components/tabs.tsx:11 \u00B7 typescript2/app-beps/src/components/ui/tabs.tsx:11 \u00B7 typescript2/app-speedtest/src/components/ui/select.tsx:142 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/tabs.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8976baf8a57592e0d99e6e82cf50e0aa7246a0592a80b5ee14e3c614b221c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): typescript2/app-beps/convex/presence.ts:39 \u00B7 typescript2/app-beps/convex/presence.ts:70 \u2014 the two spans are one implementation copied and then locally edited \u2014 101 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/presence.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"df05ad2419a924d1dfd5a59fa87b7690f7788d6a4a2cb4ff37f55e1f0fd54706"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): typescript2/app-beps/src/app/api/agent/beps/pull/route.ts:65 \u00B7 typescript2/app-beps/src/components/bep/bep-export-all-dialog.tsx:104 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/beps/pull/route.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5124b860a348172c1f8a4cdf1f4413cb209b4f1def91056fa6cf06d636072623"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): typescript2/app-beps/src/app/bcs/[number]/reader.tsx:296 \u00B7 typescript2/app-beps/src/components/comments/comment-thread.tsx:100 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/reader.tsx"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a17bc77e257b2f2ee197a7b514d1def09718cab9e6cc0eeb62661e6321855ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): typescript2/app-developer-docs/components/docs-page-actions.tsx:51 \u00B7 typescript2/app-developer-docs/components/generated-version-switcher.tsx:37 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/components/docs-page-actions.tsx"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a321ba0e4b7fbec738f2bb66088758b603212290cd09aafde8306c6bf13178ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): typescript2/app-website/components/ui/dropdown-menu.tsx:93 \u00B7 typescript2/app-website/components/ui/dropdown-menu.tsx:128 \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":"typescript2/app-website/components/ui/dropdown-menu.tsx"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6e28960b24d98d6237ba54d6c0ed0b9ec8a21ae90ad6cb574ac6b6287995a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): typescript2/pkg-playground/src/run-store-client.ts:429 \u00B7 typescript2/pkg-playground/src/run-store-client.ts:450 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/run-store-client.ts"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"7552f510f2a86503be4c6f58103ea2afc8f9921e4fe3725ac7eb32f74ce22525"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): typescript/apps/fiddle-web-app/app/[project_id]/_components/EmbedDialog.tsx:188 \u00B7 typescript/apps/fiddle-web-app/app/[project_id]/_components/EmbedDialog.tsx:216 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_components/EmbedDialog.tsx"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc82189825115675284e2cef7894b39bcb99ff28662f386175de3291f120aaee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): typescript/apps/vscode-ext/src/plugins/language-server-client/cli-downloader/bundled-cli.ts:62 \u00B7 typescript/apps/vscode-ext/src/plugins/language-server-client/cli-downloader/bundled-cli.ts:89 \u00B7 typescript/apps/vscode-ext/src/plugins/language-server-client/cli-downloader/bundled-cli.ts:117 \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":"typescript/apps/vscode-ext/src/plugins/language-server-client/cli-downloader/bundled-cli.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1094fd7d790321815c7cfd0ce5e15f709df1ec6779ad94278f63812e2adf10"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx:123 \u00B7 typescript/packages/playground-common/src/features/workflow/components/WorkflowToolbar.tsx:92 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b0d8c0160e7b5e70fc51f7410dcdab5469ec6db46f73a66bde265f16c6d10a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): typescript/packages/playground-common/src/graph-primitives/nodes/BaseNode/index.tsx:109 \u00B7 typescript/packages/playground-common/src/graph-primitives/nodes/DiamondNode/index.tsx:80 \u00B7 typescript/packages/playground-common/src/graph-primitives/nodes/LLMNode/index.tsx:112 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/nodes/BaseNode/index.tsx"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"36256eebe76905a4ecfed08daa1995e567984d28108e7fb5894ffe8c02a23d68"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): typescript/packages/playground-common/src/shared/baml-project-panel/codemirror-panel/atoms.ts:5 \u00B7 typescript2/app-website/lib/mdx/baml-block/baml-project-panel/atoms.ts:137 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/codemirror-panel/atoms.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9004cdf646c3e9cb79a82af3b67f0181e5bd37600e901df835d36e48eb3f2282"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/function-test-name.tsx:79 \u00B7 typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/function-item.tsx:152 \u2014 the two spans are one implementation copied and then locally edited \u2014 74 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/function-test-name.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f84912cc1f99ad31a44686786c1f2151671ed7f807c88a2c9b420000ed08522"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): typescript/packages/ui/src/components/scroll-area.tsx:22 \u00B7 typescript2/app-website/components/ui/scroll-area.tsx:21 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/scroll-area.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a7da595c7b1a0bc603716fd8d02202a557e986a3b8b9e566565298169fcf5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): typescript2/app-beps/src/app/api/agent/beps/route.ts:455 \u00B7 typescript2/app-beps/src/app/api/agent/beps/route.ts:554 \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":"typescript2/app-beps/src/app/api/agent/beps/route.ts"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"16548fab67346afd762c598e99eb3efbdc0790b0096b16965f3d711456e8fa0e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): typescript2/app-beps/src/app/profile/page.tsx:165 \u00B7 typescript2/app-beps/src/app/users/page.tsx:90 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/profile/page.tsx"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"771b95d9bb01cf57894143b5eb24bb90c507a6fb3732eb9fa5e79d8cf2cdbbbb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): typescript2/app-beps/src/components/ui/badge.tsx:38 \u00B7 typescript2/app-feedback/src/components/ui/badge.tsx:28 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/badge.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79515b31f687b93cfbe90f4998057b61bca11afdf8b698ff6d689bddaefe739"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): typescript2/app-beps/src/components/ui/input.tsx:5 \u00B7 typescript2/app-feedback/src/components/ui/input.tsx:5 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/input.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"38db9cb211e7c2f25709e98153c6e33d582962644711ccf0b47c4628a9db35d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): typescript2/app-developer-docs/app/baml/packages/page.tsx:13 \u00B7 typescript2/app-developer-docs/app/cli/page.tsx:8 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/app/baml/packages/page.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b3f313b5637da66dc793518030bc28b607ae825123a647f3421150d41ad346"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts:950 \u00B7 typescript2/app-website/playground/baml-worker.ts:671 \u00B7 typescript2/app-website/playground/baml-worker.ts:890 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51f212c4bab357720efc58543d764b44322ac4aba6802bdb67ab140f7c6350c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4 locations): typescript2/app-website/components/fourth-bento-animation.tsx:110 \u00B7 typescript2/app-website/components/fourth-bento-animation.tsx:126 \u00B7 typescript2/app-website/components/fourth-bento-animation.tsx:142 \u00B7 typescript2/app-website/components/fourth-bento-animation.tsx:158 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/fourth-bento-animation.tsx"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"f208d50e8571f8b9c145baa5682fa046e70680746db36a4404bdb1a1cbab67be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): typescript2/pkg-grammar-treesitter/grammar.js:769 \u00B7 typescript2/pkg-grammar-treesitter/grammar.js:1021 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar-treesitter/grammar.js"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"0330efe5818b128544cbb160a4b9c4c285eb236485966f06b37e5ce4192bfc7d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): typescript2/pkg-playground/src/execution-store.ts:30 \u00B7 typescript2/pkg-playground/src/run-store-client.ts:57 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is inside a TYPE DECLARATION, not executable code. There is no function to extract and no call site to call one from, so do not read this as an extract-a-helper row: the collapse a type offers is a generic \u2014 name the shape once, parameterised over the part that varies, and have each copy instantiate it. First check what actually differs between the copies: where they are a MATRIX of cases (one entry per input, differing precisely in the case each one pins), the repetition IS the enumeration and collapsing it would delete cases rather than de-duplicate anything \u2014 leave those alone. Reported because the copies that are not a matrix drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/execution-store.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c015d8a454d22a6ac55b65a05441432da7fa0f9c829346729490e9a093a7f9fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): engine/generators/data/nested_structures/typescript/index.ts:157 \u00B7 engine/generators/data/nested_structures/typescript/index.ts:174 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/nested_structures/typescript/index.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"952ada43eb5ef462c5f9e7144adc14de889991e81ba98d76b1547601626071db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): typescript/apps/vscode-ext/src/extension.ts:174 \u00B7 typescript/apps/vscode-ext/src/extension.ts:205 \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":"typescript/apps/vscode-ext/src/extension.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ae925690ae779bba4f08072eae1d7e7c71abc59d01b7274f55fe229eaab16a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/smart-edge.ts:215 \u00B7 typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/smart-edge.ts:240 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/smart-edge.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28159239c23cdd2e00c138a987ba7b0fcfd753dc45294d8ab9c41b5e80ba504"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): typescript/packages/playground-common/src/sdk/runtime/BamlRuntime.ts:516 \u00B7 typescript/packages/playground-common/src/sdk/runtime/MockBamlRuntime.ts:52 \u2014 the two spans are one implementation copied and then locally edited \u2014 68 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/runtime/BamlRuntime.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e85c59741d03b7b288bb3fd5464c22d6f8e6647112834d67b39dfed95c605d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): typescript/packages/playground-common/src/utils/cameraPan.ts:40 \u00B7 typescript/packages/playground-common/src/utils/cameraPan.ts:121 \u2014 the two spans are one implementation copied and then locally edited \u2014 102 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/utils/cameraPan.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a3a5863f8140f51f341ffcf1a2b3818846c42ca31a6ef39e92c53c468deb24"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 6 locations): typescript/packages/ui/src/components/breadcrumb.tsx:9 \u00B7 typescript2/app-speedtest/src/components/ui/card.tsx:33 \u00B7 typescript2/app-speedtest/src/components/ui/card.tsx:56 \u00B7 typescript2/app-speedtest/src/components/ui/table.tsx:17 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/breadcrumb.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce745c8ad1342ce1afb6534596fd982f33d11ff5acb7a5a86728b223ff1041c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 7 locations): typescript/packages/ui/src/components/card.tsx:14 \u00B7 typescript/packages/ui/src/components/card.tsx:34 \u00B7 typescript/packages/ui/src/components/drawer.tsx:79 \u00B7 typescript/packages/ui/src/components/input-otp.tsx:23 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 copies are spread across 6 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/card.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"334cf98879fccf8fdcfe68eab3b9d4eb8bea5673eaaef11c9b5480fca8531238"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): typescript/packages/ui/src/custom/date-range-picker-1.tsx:106 \u00B7 typescript/packages/ui/src/custom/date-range-picker.tsx:29 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/custom/date-range-picker-1.tsx"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"376321eae9c1cec892cdae1789746c708c7faaca6410d6a1bac3c6d507621e6f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): typescript2/app-beps/src/app/bcs/[number]/tracking-forms.tsx:47 \u00B7 typescript2/app-beps/src/app/bcs/[number]/tracking-forms.tsx:85 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/tracking-forms.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"05aaef339ec42be821cb2c6307ff2e03ee8d3028bb30f8b8b0d6c4757d49fd36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): typescript2/app-beps/src/app/profile/page.tsx:147 \u00B7 typescript2/app-beps/src/app/users/page.tsx:222 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/profile/page.tsx"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18fc9b97c856e90b94e9384ef6c0a2b4d15251148f4e2e452427f322bd4225b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): typescript2/app-beps/src/components/comments/comment-sidebar.tsx:95 \u00B7 typescript2/app-beps/src/components/comments/comment-thread.tsx:84 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-sidebar.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9ca79ec0193303306813b35efe3c2bb64b9f4b960514279dfa6c50fd1b839d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): typescript2/app-beps/src/components/comments/comment-sidebar.tsx:729 \u00B7 typescript2/app-beps/src/components/comments/comment-sidebar.tsx:943 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-sidebar.tsx"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"640140df54a357a2c8665df3bf3cb47604c1659971b6ec0a1f35586c867a642a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): typescript2/app-developer-docs/lib/generated-content/document-store.ts:45 \u00B7 typescript2/app-developer-docs/lib/generated-content/publisher.ts:33 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/generated-content/document-store.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"446f9b0fd99f40e2139509a75f61b1b24c563418a4322b937dfc6b9a67a29fbe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): typescript2/app-feedback/src/components/issues/issue-list.tsx:198 \u00B7 typescript2/app-feedback/src/components/issues/issue-list.tsx:214 \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":"typescript2/app-feedback/src/components/issues/issue-list.tsx"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"270fc1405d9747ce8c766275570fe2891f0a2c513ae33a1185bb2b73574c514d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): typescript2/app-product-metrics/src/jobs/aggregate-weekly-metric.ts:119 \u00B7 typescript2/app-product-metrics/src/jobs/aggregate-weekly-metric.ts:198 \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":"typescript2/app-product-metrics/src/jobs/aggregate-weekly-metric.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"0267e292dd5a2c5f345cc480a2a163c1a5c8d1a292d7e73d8097ea34a1e90806"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): typescript2/app-website/app/(home)/privacy-policy/page.tsx:3 \u00B7 typescript2/app-website/app/(home)/techdocs/page.tsx:3 \u00B7 typescript2/app-website/app/(home)/tos/page.tsx:3 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/privacy-policy/page.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"b421f1dece4d8c8938363aeaef8952b1024ab1d21258dfc2c6ae5b069db8d063"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): typescript2/app-website/app/(home)/quickstart/_components/try-baml.tsx:607 \u00B7 typescript2/app-website/app/(home)/quickstart/_components/try-baml.tsx:640 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/quickstart/_components/try-baml.tsx"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"930c1af6b0da437d181fe96a154c4b128b55b1decb166c36666eeb26e4f3b686"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): typescript2/app-website/components/home/kit.tsx:160 \u00B7 typescript2/app-website/components/home/kit.tsx:179 \u00B7 typescript2/app-website/components/home/kit.tsx:204 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/kit.tsx"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"933794c90e01b5e1cadd9cd207a5415ffde85f665d52f8f502eaee3bc3a4587c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): typescript2/app-website/components/home/review.tsx:355 \u00B7 typescript2/app-website/components/home/review.tsx:528 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/review.tsx"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b32d5d323d1186decc13b6d2ad7f93e7a53134d2e649435c723bf40f6cd5dae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): typescript2/app-website/playground/spawnBamlWorker.ts:40 \u00B7 typescript2/app-website/playground/spawnBamlWorker.ts:73 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/playground/spawnBamlWorker.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7d5cb00c24fec22b0134e005a5f985ddb5f0bf1030abaaff37f270adf7f5fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): baml_language/tools/speedtest/workloads/string/join-request-line-10k/main.js:3 \u00B7 baml_language/tools/speedtest/workloads/string/plus-request-line-10k/main.js:3 \u00B7 baml_language/tools/speedtest/workloads/string/template-request-line-10k/main.js:3 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/string/join-request-line-10k/main.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d51455e753d9007525497572fc367f741519c3c4eb667b2068ebb93fe90484"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): typescript/apps/vscode-ext/src/plugins/language-server-client/cli-downloader/bundled-cli.ts:113 \u00B7 typescript/apps/vscode-ext/src/plugins/language-server-client/cli-downloader/bundled-cli.ts:143 \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":"typescript/apps/vscode-ext/src/plugins/language-server-client/cli-downloader/bundled-cli.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ab87452c263bbfe7a1a0977e0f74c6c33115f8ca2256f293981f98dfcb9018"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): typescript/packages/playground-common/src/components/api-keys-dialog/utils.ts:1 \u00B7 typescript/packages/playground-common/src/components/api-keys-dialog/utils.ts:16 \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":"typescript/packages/playground-common/src/components/api-keys-dialog/utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58238d84f9d4b148b9008702b330b463c23f24bec3ea2711d2a915b4397383e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): typescript2/app-beps/src/app/api/agent/beps/route.ts:270 \u00B7 typescript2/app-beps/src/app/api/agent/beps/route.ts:388 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/beps/route.ts"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a324371197e616e9aba46aa640dc47142c3218534970d56d997edc420df504"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): typescript2/app-beps/src/app/api/agent/beps/route.ts:358 \u00B7 typescript2/app-beps/src/app/api/agent/beps/route.ts:504 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/beps/route.ts"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"efad8eb7219fcb30bce2477c4a8cf5693de00c0a991758aa18813e8ddb9032cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): typescript2/app-beps/src/components/comments/comment-feed-view.tsx:173 \u00B7 typescript2/app-beps/src/components/comments/comment-thread.tsx:118 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"811a58951be8161d64eae970dacd1a3641013de2a9e7a362e8db5ae0221a1506"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): typescript2/app-beps/src/components/ui/dropdown-menu.tsx:107 \u00B7 typescript2/app-beps/src/components/ui/dropdown-menu.tsx:130 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/dropdown-menu.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d7114a82e5db117c870cf0b0534e0b8ab2b43a99ac9ad13b77d6e3d2b9457b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): typescript2/app-developer-docs/components/book-chapter.tsx:161 \u00B7 typescript2/app-developer-docs/components/docs-toc.tsx:50 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/components/book-chapter.tsx"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae740e3fe69ce94352abf3f245c25c853099fe177a324989982df8368447692"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts:582 \u00B7 typescript2/app-website/playground/baml-worker.ts:403 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e093e5160ed94fd86cd51aa2c189043251fa0c45c46565e7dca605f00ac1023"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 11 locations): typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts:869 \u00B7 typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts:885 \u00B7 typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts:901 \u00B7 typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts:917 \u00B7 \u002B7 more site(s) not listed \u2014 the 11 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09fe92645c36c6f51f5b70163c7a3902a3969510aa249dbfd3a1a5772e59070"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): typescript2/app-website/app/(home)/quickstart/_components/try-baml.tsx:475 \u00B7 typescript2/app-website/app/(home)/quickstart/_components/try-baml.tsx:516 \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":"typescript2/app-website/app/(home)/quickstart/_components/try-baml.tsx"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92f8c1692e92e2806f4a925be178cf3155b28780a12ce84fe644a135f3bb913"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): typescript2/app-website/components/home/language.tsx:264 \u00B7 typescript2/app-website/components/home/review.tsx:1242 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/language.tsx"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc09f771323c8e122277a6f2b9860229b7ad7058f0f19a8d9bb8ab56ea69feb9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): typescript2/pkg-playground/src/graph/nodes/NodeHandles.tsx:15 \u00B7 typescript2/pkg-playground/src/graph/nodes/NodeHandles.tsx:29 \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":"typescript2/pkg-playground/src/graph/nodes/NodeHandles.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5047dd8a819d650be7b7484f2cb5e7efe1264249b9083f02bd7a827a0098e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): typescript2/pkg-playground/src/renderers/HttpRequestCurl.tsx:102 \u00B7 typescript2/pkg-playground/src/renderers/HttpRequestCurl.tsx:136 \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":"typescript2/pkg-playground/src/renderers/HttpRequestCurl.tsx"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae8da3ce321ec278b152de586e3991f5e8c488abbd3b399d063a27a6032c68b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): engine/language_client_typescript/browser.js:20 \u00B7 engine/language_client_typescript/typescript_src/browser.ts:24 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/browser.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4edcfeafcc74bf80a344c77e2152fd796b18ac5ad3d95566e469138d5c1bb7e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): engine/language_client_typescript/index.js:28 \u00B7 engine/language_client_typescript/typescript_src/index.ts:23 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/index.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"874d7acbc424bbbfaeaf385088fd949a6c3b632db4f72446a3aa13d009b48fa5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): typescript/packages/playground-common/src/baml_wasm_web/JotaiProvider.tsx:57 \u00B7 typescript/packages/playground-common/src/baml_wasm_web/JotaiProvider.tsx:94 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/baml_wasm_web/JotaiProvider.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c9045331c5857c6b918868543a5b7356a491d70ce255a1f0da9015dec947ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): typescript/packages/playground-common/src/sdk/sdk.ts:264 \u00B7 typescript/packages/playground-common/src/sdk/sdk.ts:338 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/sdk.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa3a62a05315b2645cef00dab5542bb2d511b6ad61c074533c0140127204325"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/pdf-viewer.tsx:365 \u00B7 typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx:491 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/pdf-viewer.tsx"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f33dbcadac6d7c2424db46bb9dd47b220f044e77548bc18d77044b00db17c54"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): typescript/packages/ui/src/components/table.tsx:7 \u00B7 typescript2/app-speedtest/src/components/ui/table.tsx:5 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/table.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ed88a3d1c82bf2d53f97be92841cb3ccef1da64b4d36e4aeb40976bd21d868"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): typescript/packages/ui/src/custom/icons.tsx:204 \u00B7 typescript/packages/ui/src/custom/icons.tsx:303 \u00B7 typescript/packages/ui/src/custom/icons.tsx:342 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/custom/icons.tsx"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ee1b775e67fe15ff6a27c4b4416a5dc4615f8b50e5c791ea917f1fc8ad7297"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): typescript2/app-beps/convex/comments.ts:522 \u00B7 typescript2/app-beps/convex/userStances.ts:14 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/comments.ts"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ff1cc0a8151de4fb7b77e8cbd59b0e1f39cf95413173845b90019ae72ce590"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): typescript2/app-beps/convex/slack.ts:407 \u00B7 typescript2/app-beps/convex/slack.ts:598 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/slack.ts"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"b294de76866edce841408a37379e6e48fb7ff12ec6c456df417625eed32b738b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): typescript2/app-beps/src/components/ai-assistant/version-analysis-status.tsx:181 \u00B7 typescript2/app-beps/src/components/ai-assistant/version-analysis-status.tsx:196 \u00B7 typescript2/app-beps/src/components/ai-assistant/version-analysis-status.tsx:211 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ai-assistant/version-analysis-status.tsx"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6dc4d6195273caa17289f01efe74b574c33386053131b5208f72805420479e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): typescript2/app-beps/src/components/bep/bep-import-dialog.tsx:474 \u00B7 typescript2/app-beps/src/components/bep/bep-import-dialog.tsx:514 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-import-dialog.tsx"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54b6926a0f5468d79803cfde77041b1c9967f3e5e9ae7fc4b5fba92820ab79b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): typescript2/app-beps/src/components/bep/bep-nav.tsx:40 \u00B7 typescript2/app-beps/src/components/bep/bep-route-shell.tsx:402 \u2014 the two spans are one implementation copied and then locally edited \u2014 69 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-nav.tsx"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0b8679c3effd1b2259bec900c72478c647aa84b8b5bd34be7a5e854e12dc58"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): typescript2/app-beps/src/components/comments/comment-feed-view.tsx:136 \u00B7 typescript2/app-beps/src/components/comments/comment-thread.tsx:89 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b096e91bef6c8cf4e937119bc6b9e1307aa5cd89a16ba9c583350665ce7cf2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): typescript2/app-beps/src/components/ui/label.tsx:11 \u00B7 typescript2/app-website/components/ui/label.tsx:11 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/label.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ca3d6e38e4ca94d6e35e0fad5a37d5cb7cf742b08c2c6797261b664d3db790"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): typescript2/app-beps/src/components/ui/shiki-code-block.tsx:149 \u00B7 typescript2/app-beps/src/components/ui/shiki-code-block.tsx:181 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/shiki-code-block.tsx"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed85e1b4746fbc4c0268e720cce7226b49a34981f7adea4737d7f1e3a8d1924"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): typescript2/app-developer-docs/scripts/inspect-generated-content.ts:5 \u00B7 typescript2/app-developer-docs/scripts/verify-generated-content.ts:3 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/scripts/inspect-generated-content.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"813725ec7a96c792c7a479d6fcb1c949a5155c80afe6d0d3e8e5462cf0ad82fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): typescript2/app-product-metrics/src/jobs/fetch-luma-eap.ts:244 \u00B7 typescript2/app-product-metrics/src/jobs/fetch-sheep-council-zoom.ts:37 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/jobs/fetch-luma-eap.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ada70dd3951591c19501670bde395aad5296e60f367edfb7a4816c6b8d1dd3f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): typescript2/app-website/app/(home)/podcast/[slug]/page.tsx:111 \u00B7 typescript2/app-website/app/(home)/podcast/[slug]/page.tsx:203 \u2014 the two spans are one implementation copied and then locally edited \u2014 78 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/podcast/[slug]/page.tsx"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"e446d4bbbceeb30bb2355499952556765b03d87c00b3243559772730e1ba9ad5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): typescript2/app-website/app/(home)/privacy-policy/page.tsx:16 \u00B7 typescript2/app-website/app/(home)/tos/page.tsx:16 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/privacy-policy/page.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"142512252c2d007b5422ebdb9e2e276d1507d5cb075635c702f64e0373d5df7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): typescript2/pkg-playground/src/telemetry/TelemetryView.tsx:2135 \u00B7 typescript2/pkg-playground/src/telemetry/TelemetryView.tsx:3211 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":2135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38326e9df9c7ab01df28897621d11a3c991d0e7ee0276c92e46e6da8dfb3344"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): engine/generators/data/array_types/typescript/index.ts:97 \u00B7 engine/generators/data/array_types/typescript/index.ts:111 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/array_types/typescript/index.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82b3ba519fccb7592c87e1ab23658d46173cd1600235a0bee61c18d645368c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): engine/generators/data/edge_cases/typescript/index.ts:64 \u00B7 engine/generators/data/primitive_types/typescript/index.ts:111 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/edge_cases/typescript/index.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"77be5c12429c68b6ec418aea7ca3ce9beda6813d1803f85ca840a2344f347453"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): engine/generators/data/map_types/typescript/index.ts:25 \u00B7 engine/generators/data/primitive_types/typescript/index.ts:79 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/map_types/typescript/index.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8cb3ac1f78ef11b6b297b0c3e369628302ac004900b25d28337dcbe58d9fbc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): typescript/packages/playground-common/src/components/api-keys-dialog/atoms.ts:219 \u00B7 typescript2/app-website/lib/mdx/baml-block/baml-project-panel/atoms.ts:185 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/components/api-keys-dialog/atoms.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d8223995df7514b4c7e3799db7711abb00efa7ef6e334f0e9a6a0306310d2d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): typescript/packages/ui/src/components/avatar.tsx:1 \u00B7 typescript/packages/ui/src/components/label.tsx:1 \u00B7 typescript/packages/ui/src/components/switch.tsx:1 \u2014 the 3 copies are spread across 3 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/avatar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2faf0430e3c8bd42973e28d770dbff861cc39d9accda779598b40dfe08888f45"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): typescript/packages/ui/src/custom/currency-input.tsx:77 \u00B7 typescript/packages/ui/src/custom/date-picker-input.tsx:60 \u00B7 typescript/packages/ui/src/custom/number-input.tsx:56 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/custom/currency-input.tsx"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b62d757c55ce7f5dd69a9d0a597d2992779516975cd24875c588073d63ad162"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): typescript2/app-beps/convex/beps.ts:363 \u00B7 typescript2/app-beps/convex/beps.ts:657 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7dfbebe0bbda385f674b1846a1f48e8a1697a2cb950208fe4f2c9c021b5bd5c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): typescript2/app-beps/convex/slack.ts:561 \u00B7 typescript2/app-beps/convex/slack.ts:609 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/slack.ts"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e90b01b21fb0bef13fb3743d0e03cc6b72d1e6bf1c34bb5babb9288d0935cd1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): typescript2/app-beps/eslint.config.mjs:5 \u00B7 typescript2/app-feedback/eslint.config.mjs:5 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/eslint.config.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7b687a896f73871fde5b3fa53a5e3b03d1f94f4e87b2f0e165d28153f687b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): typescript2/app-beps/src/app/bcs/[number]/add/page.tsx:13 \u00B7 typescript2/app-beps/src/app/bcs/[number]/edit/page.tsx:13 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/add/page.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0dccbce4b6e3100db4230df7df8ef17236faad1d28234bfe322a9c063ddd6c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): typescript2/app-beps/src/app/bcs/[number]/reader.tsx:179 \u00B7 typescript2/app-beps/src/app/bcs/[number]/reader.tsx:197 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/reader.tsx"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e78b395aa201d456bbddca880510d06479d8c641584691c704e859622af961"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): typescript2/app-beps/src/app/bcs/actions.ts:305 \u00B7 typescript2/app-beps/src/app/bcs/actions.ts:415 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/actions.ts"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aee17b994757aaeb8aa6942df1e19fa32950aec3e122016669bb81835f1b610"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): typescript2/app-beps/src/app/bcs/forms.tsx:132 \u00B7 typescript2/app-beps/src/app/bcs/forms.tsx:176 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/forms.tsx"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcef0ae63877232c542a97f39bcd28402d5148dc4caf5a11194de4fecbafc3ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): typescript2/app-beps/src/app/bcs/team-only.tsx:12 \u00B7 typescript2/app-beps/src/app/bcs/unavailable.tsx:9 \u2014 the two spans are one implementation copied and then locally edited \u2014 70 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/team-only.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4faa055913fee557eee35c78ef1b7a5035aa597ff10692826eb039d2c33dc47"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): typescript2/app-beps/src/components/ai-assistant/ai-assistant-panel.tsx:160 \u00B7 typescript2/app-beps/src/components/ai-assistant/ai-assistant-panel.tsx:186 \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":"typescript2/app-beps/src/components/ai-assistant/ai-assistant-panel.tsx"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe67726629d51b5a809f68a3f46f1c6723b9515fd180f38978aea070a16e53e0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): typescript2/app-beps/src/components/bep/bep-add-page-modal.tsx:67 \u00B7 typescript2/app-beps/src/components/decisions/decision-card.tsx:147 \u00B7 typescript2/app-beps/src/components/issues/issue-card.tsx:200 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-add-page-modal.tsx"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb1f2f84c2e4f9537ab09394b982ca3f1beb3732f9ded5cf2b91d5759bdc895"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): typescript2/app-developer-docs/components/annotated-code.tsx:36 \u00B7 typescript2/app-developer-docs/components/baml-snippet.tsx:48 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/components/annotated-code.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6f00b4a8ae4ef67b3d3c9aa912347932fa37d2169ec17e623f8db045dba9d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-known-value-widening.ts:35 \u00B7 typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-module-mocking.ts:7 \u00B7 typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/reflect-method.ts:3 \u2014 the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-known-value-widening.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fd5649afc57c291bf41d15a6c46722f068eb23441fe4824bc27ec7a1f89bb6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-object-parameters.ts:33 \u00B7 typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-unknown-returns.ts:30 \u00B7 typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-unknown-type-aliases.ts:21 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-object-parameters.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7026f9b352ed8bd806b7dfcc1f9b21b45772356508d0be5623b93d9939f0d5af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): typescript2/app-product-metrics/scripts/backfill-six-weeks.ts:47 \u00B7 typescript2/app-product-metrics/src/jobs/aggregate-weekly-metric.ts:246 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/scripts/backfill-six-weeks.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"480ae1be93dbe694a54bc4d5e1ba68f84e51ed5b5775a1138a0f3b918cf750b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): typescript2/app-product-metrics/src/http.ts:111 \u00B7 typescript2/app-product-metrics/src/http.ts:163 \u00B7 typescript2/app-product-metrics/src/http.ts:206 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/http.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"af65404f30ff71fb1cbd9564b6534485024c859c3add444ed4f490fd95b0e7e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): typescript2/app-product-metrics/src/http.ts:126 \u00B7 typescript2/app-product-metrics/src/http.ts:157 \u00B7 typescript2/app-product-metrics/src/http.ts:200 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/http.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a17c523ec9c8a91733b5b47565207881188d9342f73de308ddd1d19cd7daa97"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): typescript2/app-type-quiz/scripts/smoke.mjs:541 \u00B7 typescript2/app-type-quiz/scripts/smoke.mjs:564 \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":"typescript2/app-type-quiz/scripts/smoke.mjs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"608209249410128151c1138d2c7c337b436daa398679285304989af5fdfcb784"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): typescript2/app-website/app/(home)/bamlcode/_components/FeedbackWidget.tsx:12 \u00B7 typescript2/app-website/app/(home)/sheep-council/council-gate.tsx:209 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_components/FeedbackWidget.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fb4c68ad239ba48ab4dbcbabadcf6655533196b58a3ec6dcd5f600c22438cb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): typescript2/app-website/components/adopt/architecture.tsx:1545 \u00B7 typescript2/app-website/components/adopt/guide.tsx:293 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/adopt/architecture.tsx"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"58cc49e987df5400a4ab335cae658d4cf3d2a013627ecdde31b3214e80c588dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): typescript2/app-website/components/home/improve.tsx:430 \u00B7 typescript2/app-website/components/home/improve.tsx:580 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/improve.tsx"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc6525873666377fde48ffe4cba4fdf084474aa916bace2674191477e771880"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): typescript2/app-website/components/home/language.tsx:428 \u00B7 typescript2/app-website/components/home/language.tsx:443 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/language.tsx"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8a9b94457c89e4de1801e574dfa81d367794b2177c7c256be4ba16a699b46e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): typescript2/app-website/components/home/review.tsx:361 \u00B7 typescript2/app-website/components/home/review.tsx:534 \u00B7 typescript2/app-website/components/home/scene-player.tsx:83 \u2014 the 3 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/review.tsx"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3db96f0efacbda24db7f2bfb4ac06c5f1b81eb03e4b8172439adec99066eadf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): typescript2/pkg-grammar/preview/main.ts:160 \u00B7 typescript2/pkg-grammar/preview/main.ts:216 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar/preview/main.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d76a05956c5c282948c18379e450fbbe50349cd05e2471c2f5eb14781f8352"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): typescript2/pkg-playground/src/graph/constants.ts:369 \u00B7 typescript2/pkg-playground/src/graph/constants.ts:382 \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":"typescript2/pkg-playground/src/graph/constants.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"88701c765d7e97a7cfcb82a5dfd2684e108e86b323cee4c6c26ae10e64782dc0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): typescript2/pkg-playground/src/telemetry/TelemetryView.tsx:916 \u00B7 typescript2/pkg-playground/src/telemetry/TelemetryView.tsx:2364 \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":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f75516ff5d1a7ebe76929947e2556d59b7d20ff0006a0d8a659eaaf762eae36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): engine/generators/data/optional_nullable/typescript/index.ts:3 \u00B7 engine/generators/data/optional_nullable/typescript/index.ts:144 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/optional_nullable/typescript/index.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"cadff3fb869620ce15ca3e2f121bdf3dcca94453e63f5a723dcd0c99e31dfaec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): typescript/apps/fiddle-web-app/app/[project_id]/_components/EmbedDialog.tsx:170 \u00B7 typescript/apps/fiddle-web-app/app/[project_id]/_components/EmbedDialog.tsx:191 \u00B7 typescript/apps/fiddle-web-app/app/[project_id]/_components/EmbedDialog.tsx:223 \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":"typescript/apps/fiddle-web-app/app/[project_id]/_components/EmbedDialog.tsx"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8b28e02332ee0ff6115c6be3a686f5ae65e1a33654c07083d53dbda5de48c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): typescript/packages/playground-common/src/features/detail-panel/components/ExecutionLogPanel.tsx:146 \u00B7 typescript/packages/playground-common/src/features/detail-panel/components/ExecutionLogPanel.tsx:243 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/detail-panel/components/ExecutionLogPanel.tsx"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3111db26558fea6c92c6742ba5532d882e930c101a0487ebac9afd501f245b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/smart-edge.ts:412 \u00B7 typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/smart-edge.ts:427 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/smart-edge.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89b92a7310fb9d539a96ed6a68d9f84df78395dc6519317b23605ad8eed8b3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): typescript/packages/playground-common/src/sdk/runtime/BamlRuntime.ts:308 \u00B7 typescript/packages/playground-common/src/sdk/runtime/BamlRuntime.ts:320 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/runtime/BamlRuntime.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8dad90d6fd4fca6dc9137e31aa984911b9a7614e9f1a1bf48903a8128f1dcea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/prompt-preview-content.tsx:129 \u00B7 typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/prompt-preview-content.tsx:63 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/prompt-preview-content.tsx"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff7cf137fae548aadf3b568f00beeef03a5c9bb9b042b7c427b1c0637e91c93"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/prompt-preview-curl.tsx:139 \u00B7 typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/render-text.tsx:52 \u2014 the two spans are one implementation copied and then locally edited \u2014 69 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/prompt-preview-curl.tsx"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"6483e1214a9fc5ed9320102503f35f5d94944bd7b203c45baa2956467fd124c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx:174 \u00B7 typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx:26 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f1d81f9e0708010e3495918267b26275d6e94cd0b29a3fa3fcbb45fddbc454"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 8 locations): typescript/packages/ui/src/components/alert-dialog.tsx:11 \u00B7 typescript/packages/ui/src/components/collapsible.tsx:7 \u00B7 typescript/packages/ui/src/components/context-menu.tsx:11 \u00B7 typescript/packages/ui/src/components/context-menu.tsx:41 \u00B7 \u002B4 more site(s) not listed \u2014 the 8 copies are spread across 7 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/alert-dialog.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88a31492a7238b0ad6e716702d2205b493b4601d8409e89581cb760525451f8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6 locations): typescript/packages/ui/src/components/avatar.tsx:3 \u00B7 typescript/packages/ui/src/components/checkbox.tsx:4 \u00B7 typescript/packages/ui/src/components/label.tsx:3 \u00B7 typescript/packages/ui/src/components/menubar.tsx:4 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 6 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/avatar.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d899fa24b215c70bbaa1cd7a18ab2a241a48ca2dd292170f7dfe41bda339bd8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): typescript/packages/ui/src/components/carousel.tsx:31 \u00B7 typescript/packages/ui/src/components/chart.tsx:23 \u00B7 typescript2/app-website/components/ui/carousel.tsx:31 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/carousel.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa218eb1a3de30da3e1adbcfbf9fbcdfee9c46e906bae330dbbe40086f20a188"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): typescript/packages/ui/src/custom/currency-input.tsx:42 \u00B7 typescript/packages/ui/src/custom/number-input.tsx:28 \u00B7 typescript/packages/ui/src/custom/text-input.tsx:30 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/custom/currency-input.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a378565b12b89b7592b2652c949e2a2a4d665eafb9c60a330f47081a7ebb3e33"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6 locations): typescript2/app-beps/convex/analysisJobs.ts:34 \u00B7 typescript2/app-beps/convex/beps.ts:124 \u00B7 typescript2/app-beps/convex/decisions.ts:51 \u00B7 typescript2/app-beps/convex/issues.ts:90 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 5 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/analysisJobs.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00eddda97e96ba4d62eb5d25b84c54abc1b4b4d1b69c99be036ea11937d09eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): typescript2/app-beps/convex/bcsComments.ts:346 \u00B7 typescript2/app-beps/convex/bcsTracking.ts:50 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsComments.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"872237672fcc499f645f480c72b81212742f7b8d3c8f84c1cabf296be2cf752b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): typescript2/app-beps/convex/beps.ts:152 \u00B7 typescript2/app-beps/convex/comments.ts:503 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af0a31743023269b2096a6501d36edfe30651f7cc559a039ba4186f5360007d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): typescript2/app-beps/convex/issues.ts:201 \u00B7 typescript2/app-beps/convex/issues.ts:219 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/issues.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"2799073953e96f99da21293f444ad01d5b409a858b6d5194549b1e072942d669"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): typescript2/app-beps/convex/slack.ts:302 \u00B7 typescript2/app-beps/convex/slack.ts:335 \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":"typescript2/app-beps/convex/slack.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef3bc138e13b3d6bd7f4096ca9339cc6239ec71d5a30e3d91f1b13d6f80f44c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): typescript2/app-beps/src/app/bcs/actions.ts:379 \u00B7 typescript2/app-beps/src/app/bcs/actions.ts:540 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/actions.ts"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dac54ecf8ad25cc0110b8664632d25a3283db655b77603fb1f314936bb87349"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): typescript2/app-beps/src/app/bcs/new/page.tsx:11 \u00B7 typescript2/app-beps/src/app/bcs/token/page.tsx:13 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/new/page.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7275c8700ec7c4e03161079728e7880f3bb1fce1afc44f695df32daf8709e6e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): typescript2/app-beps/src/app/page.tsx:44 \u00B7 typescript2/app-beps/src/app/users/page.tsx:187 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/page.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"294d2c205701032eead4682861a837be2e55f8d64a8e4b8665e00182cbe851a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): typescript2/app-beps/src/app/page.tsx:102 \u00B7 typescript2/app-beps/src/components/bep/bep-route-shell.tsx:846 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/page.tsx"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55edde23ff39e67f9819d912b23d6271a6ef66888a5a275a305ee77399cd999"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): typescript2/app-beps/src/components/bep/bep-export-dialog.tsx:118 \u00B7 typescript2/app-beps/src/components/bep/bep-import-dialog.tsx:349 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-export-dialog.tsx"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"f975018698f091be04c3db1383899e01f44388dd185613cb9d088014e56e31bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): typescript2/app-beps/src/components/comments/comment-feed-view.tsx:418 \u00B7 typescript2/app-beps/src/components/comments/comment-thread.tsx:267 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b226263557e2ee2c2eebf9b7a2d8b278f03d21462b65528b2e70c26e713e5e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): typescript2/app-beps/src/components/comments/comment-feed-view.tsx:710 \u00B7 typescript2/app-beps/src/components/comments/comment-thread.tsx:239 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf0cea7a4096a51ce055ffa65dc7457c26850fbd4ea2af60533e2ab39c6a50c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): typescript2/app-beps/src/components/comments/comment-sidebar.tsx:661 \u00B7 typescript2/app-beps/src/components/comments/comment-sidebar.tsx:719 \u00B7 typescript2/app-beps/src/components/comments/comment-sidebar.tsx:788 \u00B7 typescript2/app-beps/src/components/comments/comment-sidebar.tsx:933 \u2014 all 4 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-sidebar.tsx"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"32264f843059befb770459754b6d938d7cff62544ca5d6c209cf8f762420e737"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): typescript2/app-beps/src/components/comments/comment-thread.tsx:492 \u00B7 typescript2/app-beps/src/components/issues/issue-list.tsx:25 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-thread.tsx"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f21c4622a820cbe02c5f34aa584b98255944251761110c716e69842ed59fe28"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): typescript2/app-beps/src/components/ui/dropdown-menu.tsx:160 \u00B7 typescript2/app-beps/src/components/ui/select.tsx:136 \u00B7 typescript2/app-feedback/src/components/ui/select.tsx:136 \u2014 the 3 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/dropdown-menu.tsx"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"00944e17e1cc4a90c0d81bbf7b7f99eec85b91b18b437778a687c170f74357d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): typescript2/app-product-metrics/src/clients/discord.ts:59 \u00B7 typescript2/app-product-metrics/src/clients/discord.ts:101 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/clients/discord.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ffbc0d68d72fef424e9708ee22f47c2010a6a9d721b3760b492d12088282c0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): typescript2/app-product-metrics/src/clients/posthog.ts:29 \u00B7 typescript2/app-product-metrics/src/clients/slack.ts:60 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/clients/posthog.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1323ca5309d463930713a109ac6fcff3efcd634606f78d11da858d8f19bb58"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): typescript2/app-website/app/(home)/blog/_lib/art.tsx:312 \u00B7 typescript2/app-website/app/(home)/blog/_lib/art.tsx:361 \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":"typescript2/app-website/app/(home)/blog/_lib/art.tsx"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aedad612f2cab04d8d9144caf91938f90692140e5be454a8e67637efc8d203a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6 locations): typescript2/app-website/app/(home)/logo-ideas/marks.tsx:119 \u00B7 typescript2/app-website/app/(home)/logo-ideas/marks.tsx:168 \u00B7 typescript2/app-website/app/(home)/logo-ideas/marks.tsx:254 \u00B7 typescript2/app-website/app/(home)/logo-ideas/marks.tsx:281 \u00B7 \u002B2 more site(s) not listed \u2014 all 6 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/logo-ideas/marks.tsx"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c60d06701c1403d63bfa11a88f50ded5d719646b39a215a63e42b4b5a1a2939"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): typescript2/app-website/app/(home)/privacy-policy/page.tsx:10 \u00B7 typescript2/app-website/app/(home)/quickstart/page.tsx:130 \u00B7 typescript2/app-website/app/(home)/tos/page.tsx:10 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/privacy-policy/page.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e20909c73d329df4d8d3b569991aeb6b66eaeab9d1fbfe30726184960b6b17"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): typescript2/app-website/lib/mdx/sap/intro.tsx:233 \u00B7 typescript2/app-website/lib/mdx/sap/intro.tsx:276 \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":"typescript2/app-website/lib/mdx/sap/intro.tsx"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a4341d111d35eb35f37f4913c2bd6922b3f12ccc933624208f0e514b151ef1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): typescript2/pkg-playground/src/renderers/HttpRequestCurl.tsx:170 \u00B7 typescript2/pkg-playground/src/renderers/HttpRequestCurl.tsx:225 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/renderers/HttpRequestCurl.tsx"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"b788e5e841e7b65a02a2ba4e95631fa2502d81ab8fe140bd604ab39df73dcfdb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): typescript2/pkg-playground/src/run-store-client.ts:251 \u00B7 typescript2/pkg-playground/src/run-store-client.ts:264 \u00B7 typescript2/pkg-playground/src/run-store-client.ts:285 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/run-store-client.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"0208ba5e0366a4d9858a5e1f2fa364582b19f547f721c78bc9e1c6689226907d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): engine/baml-runtime/src/control_flow/mermaid-sandbox/app/page.tsx:115 \u00B7 engine/baml-runtime/src/control_flow/mermaid-sandbox/app/page.tsx:165 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/control_flow/mermaid-sandbox/app/page.tsx"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"521b7f9ea4564b4d865c6cef04449373c5e6a9ae866d7c58d2d07a24dd1c62fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): engine/language_client_typescript/type_builder.js:67 \u00B7 engine/language_client_typescript/type_builder.js:77 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/type_builder.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"169228e6f9b6d109863b81d500436ecde823981840b28686fd95412c7fbdf0c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): engine/language_client_typescript/typescript_src/type_builder.ts:108 \u00B7 engine/language_client_typescript/typescript_src/type_builder.ts:119 \u2014 all 2 copies are in the same file, and the CITED SPAN is inside a TYPE DECLARATION, not executable code. There is no function to extract and no call site to call one from, so do not read this as an extract-a-helper row: the collapse a type offers is a generic \u2014 name the shape once, parameterised over the part that varies, and have each copy instantiate it. First check what actually differs between the copies: where they are a MATRIX of cases (one entry per input, differing precisely in the case each one pins), the repetition IS the enumeration and collapsing it would delete cases rather than de-duplicate anything \u2014 leave those alone. Reported because the copies that are not a matrix drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/type_builder.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"1240cfb6a4bc88a5ee68208be29269aa5a127723019112501aab8ffe99def4c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx:77 \u00B7 typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx:128 \u00B7 typescript/packages/playground-common/src/features/workflow/components/WorkflowToolbar.tsx:97 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"7702bbb0b4cb668812f6b4daa3b50bef5129a870ba8d49696fa67a0bbc6b12c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): typescript/packages/playground-common/src/features/graph/layout/edge/edge.ts:213 \u00B7 typescript/packages/playground-common/src/features/graph/layout/edge/edge.ts:228 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/edge/edge.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef87376d4f60ce807e5cb86f8ee5e3ab90620ecddfef6d4f5f1d1eb8468e7f1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): typescript/packages/playground-common/src/graph-primitives/nodes/HexagonNode/index.tsx:27 \u00B7 typescript/packages/playground-common/src/graph-primitives/nodes/HexagonNode/index.tsx:67 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/nodes/HexagonNode/index.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb9ff64d556b68d176cad622387f5a11396a67ba038c131f7bbfe70b577c9da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): typescript/packages/playground-common/src/graph-primitives/nodes/LLMNode/index.tsx:153 \u00B7 typescript/packages/playground-common/src/graph-primitives/nodes/LLMNode/index.tsx:202 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/nodes/LLMNode/index.tsx"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc074e63644d85424b9754e6df1e7fcc5b42d457a730632dbe041d067e5de7e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): typescript/packages/playground-common/src/sdk/sdk.ts:1257 \u00B7 typescript/packages/playground-common/src/sdk/sdk.ts:1273 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/sdk.ts"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"619036c534634171051ffbc8583257886988333991d912e039cdc44b694841e5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/TruncatedString.tsx:46 \u00B7 typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx:97 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/TruncatedString.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbda3c10376f774cbc5fd53486c3da0608c88c3fb443bc8a389447c5e0afa36d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/pdf-viewer.tsx:319 \u00B7 typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/pdf-viewer.tsx:341 \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":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/pdf-viewer.tsx"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51991a4dd69cf68c3d8a15f5562ba1b95ee21edafe2171f2e88553a6eebee8e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/pdf-viewer.tsx:533 \u00B7 typescript2/app-beps/src/components/decisions/decision-card.tsx:159 \u00B7 typescript2/app-beps/src/components/decisions/decision-card.tsx:170 \u00B7 typescript2/app-beps/src/components/issues/issue-card.tsx:212 \u2014 the 4 copies are spread across 3 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/pdf-viewer.tsx"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"a200d4783cb2d4cd9b03b2859bf2ad36fc2128c1bc5bfa5f94a7fbd8d552f6e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): typescript2/app-beps/convex/bcsTracking.ts:103 \u00B7 typescript2/app-beps/convex/bcsTracking.ts:152 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsTracking.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec6900fd82a92d11df604473c9ec8ac787d37076463487094bf4a6aec6f05ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): typescript2/app-beps/convex/comments.ts:234 \u00B7 typescript2/app-beps/convex/userStances.ts:23 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/comments.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"109048f8d15269baf9d01bef00976ff465523e46a3b57f848ff179c26eeb49ce"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): typescript2/app-beps/convex/http.ts:83 \u00B7 typescript2/app-beps/convex/http.ts:95 \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":"typescript2/app-beps/convex/http.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fea7c57888464428d0f645102f3398b7bca048452cf0bfb36c11fb2deba2e04"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): typescript2/app-beps/src/app/bcs/[number]/comments/page.tsx:55 \u00B7 typescript2/app-beps/src/app/bcs/[number]/decisions/page.tsx:30 \u00B7 typescript2/app-beps/src/app/bcs/[number]/issues/page.tsx:32 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/comments/page.tsx"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e375e923819ec1d8c7e3c0ceb2926b0a807ae346a406f46ee008f6bd60498c63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): typescript2/app-beps/src/app/bcs/[number]/tracking-forms.tsx:12 \u00B7 typescript2/app-beps/src/app/bcs/forms.tsx:16 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/tracking-forms.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d3c8bea5456fb42ddac99aee76e7799f2d855d7336ed65090f3a70c587c656"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): typescript2/app-beps/src/app/users/page.tsx:246 \u00B7 typescript2/app-beps/src/app/users/page.tsx:264 \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":"typescript2/app-beps/src/app/users/page.tsx"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ac2d3803e8cbdec255a185feb06c863e8933d1286684f7b99fc47ae47e5a04"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): typescript2/app-beps/src/components/ui/dialog.tsx:99 \u00B7 typescript2/app-beps/src/components/ui/sheet.tsx:117 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/dialog.tsx"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"588d882a9dd8a535da5f928a1a54c608b98c6d575127d90da39441b7d48c507a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): typescript2/app-beps/src/lib/bcs-auth.ts:114 \u00B7 typescript2/app-beps/src/lib/beps-user.ts:44 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/bcs-auth.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f3b1098cd280f106fcf4c4cd3b8e8899b2f8b25a43bce846a3d2eab3b95d48"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): typescript2/app-developer-docs/components/authored-page.tsx:60 \u00B7 typescript2/app-developer-docs/components/authored-page.tsx:83 \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":"typescript2/app-developer-docs/components/authored-page.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ea30cbf608f115c4f28cf82f41bb4c6c312af96d2164c0318ff3979449f4d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): typescript2/app-developer-docs/components/docs-page-actions.tsx:61 \u00B7 typescript2/app-website/components/home/nav-menu.tsx:51 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/components/docs-page-actions.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"2977982ca4f6e24bd42058427009353e290c1e13996b2f1f781bcea68cdd3d4f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): typescript2/app-feedback/src/components/issues/issue-detail.tsx:113 \u00B7 typescript2/app-feedback/src/components/issues/issue-detail.tsx:154 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/components/issues/issue-detail.tsx"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d144976a519f723d0835a3ee1263968d05c477b10594a7dfa35821f215f21d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): typescript2/app-type-quiz/src/app.tsx:516 \u00B7 typescript2/app-type-quiz/src/app.tsx:551 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-type-quiz/src/app.tsx"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"f573101a0cce897fb4df30bbc343c646cd803d9e236703108c7255c3b79916a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): typescript2/app-website/app/(home)/bamlcode/_lib/progress.ts:40 \u00B7 typescript2/app-website/components/home/lang-pick.tsx:69 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_lib/progress.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b387e761f453dd7616659f4b2f1027cbac20a5a365496ba9f79860a012b7df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): typescript2/app-website/app/(home)/eap/signup-form.tsx:178 \u00B7 typescript2/app-website/components/home/early-access-banner.tsx:16 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/eap/signup-form.tsx"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"59bf5397830bfa990c3630d73376ad3edd335462520e475537fd71517baa4ee1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): typescript2/app-website/app/(home)/logo-ideas/generated.tsx:847 \u00B7 typescript2/app-website/app/(home)/logo-ideas/page.tsx:240 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/logo-ideas/generated.tsx"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabde38486c4afe8ae3ff1bc0ce8a137681950d553e1a8b9ea1542f83d9ff64a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): typescript2/app-website/app/(home)/logo-ideas/marks.tsx:56 \u00B7 typescript2/app-website/app/(home)/logo-ideas/marks.tsx:81 \u00B7 typescript2/app-website/app/(home)/logo-ideas/marks.tsx:98 \u00B7 typescript2/app-website/app/(home)/logo-ideas/marks.tsx:237 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/logo-ideas/marks.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3188c35a202a874a9b1d3918659a0e91f5d039ab02b5860c574acdfa54d24cb1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): typescript2/app-website/components/adopt/architecture.tsx:1423 \u00B7 typescript2/app-website/components/home/review.tsx:358 \u00B7 typescript2/app-website/components/home/review.tsx:531 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/adopt/architecture.tsx"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6838c758e6475cbef8f571c7a3f497affcd7d4fab77ff189adc48280eedad7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): typescript2/app-website/components/home/code.tsx:30 \u00B7 typescript2/app-website/components/home/hyperobs.tsx:245 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/code.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c01444cabe275df8cf92f9ed720b8fc1980ed28e77edca947c70c9a8e2e7fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): typescript2/app-website/components/home/pinned.tsx:81 \u00B7 typescript2/app-website/components/home/tracker.tsx:938 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/pinned.tsx"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1ea31a00a3e3df4451badf74d04232a042066ab3d1e20449679344783cf5af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): typescript2/app-website/lib/mdx/bfcl/_loader/utils.tsx:87 \u00B7 typescript2/app-website/lib/mdx/bfcl/_loader/utils.tsx:100 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/bfcl/_loader/utils.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd5ede2ab7db2f3a27fb675b79f9eebd2195b8f42f780a3f321b004b3ab933d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): typescript2/pkg-playground/src/ExecutionPanel.tsx:2348 \u00B7 typescript2/pkg-playground/src/default-function-selection.ts:58 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":2348}}}],"partialFingerprints":{"codehealthFindingId/v1":"154fdafb41ca09aa4ef01f9dbffaf5fdad927c5180285ea0c2de50bb4fff9c03"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): typescript2/pkg-playground/src/renderers/Media.tsx:12 \u00B7 typescript2/pkg-playground/src/renderers/PromptAst.tsx:86 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/renderers/Media.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f226cbfd90b7c90af9bbd9fe852a062b6bc0bf7c8d4d19dae20936f735fb0ba1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): typescript2/pkg-playground/src/run-store-client.ts:507 \u00B7 typescript2/pkg-playground/src/run-store-client.ts:523 \u00B7 typescript2/pkg-playground/src/run-store-client.ts:536 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/run-store-client.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63961e8a36bbbd30a0a801ea106934bf64cdd6153088933cc4d8b41a9a689d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): typescript2/pkg-playground/src/telemetry/TelemetryView.tsx:1003 \u00B7 typescript2/pkg-playground/src/telemetry/TelemetryView.tsx:1016 \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":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"beaa7a433021cc1cb5371c886eede95d27718025264b4cc8869f032d1a61ec51"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): typescript2/pkg-playground/src/telemetry/TelemetryView.tsx:3341 \u00B7 typescript2/pkg-playground/src/telemetry/TelemetryView.tsx:3352 \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":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":3341}}}],"partialFingerprints":{"codehealthFindingId/v1":"02df02cf230d08c5a500c8b022e9efaf25a9ee52a21c48f2697a7f97dd9940fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): typescript2/pkg-playground/src/telemetry/use-telemetry.ts:168 \u00B7 typescript2/pkg-playground/src/telemetry/use-telemetry.ts:196 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/use-telemetry.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a41a14c6f4cc34637c91fa9263f9ffcc122e42f583b3e2cfa0501846bdaf2c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): typescript2/pkg-proto/src/decode.ts:149 \u00B7 typescript2/pkg-proto/src/decode.ts:200 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-proto/src/decode.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"64abd720bdd08743589438774c295884942d178945a5cb63f41f9a6498ce192a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5 locations): engine/generators/data/edge_cases/typescript/index.ts:76 \u00B7 engine/generators/data/edge_cases/typescript/index.ts:87 \u00B7 engine/generators/data/map_types/typescript/index.ts:8 \u00B7 engine/generators/data/map_types/typescript/index.ts:128 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/edge_cases/typescript/index.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8b2807cc836c7d360d838fceeea3828cd89b5798618e8a4739d4bac87c73cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): engine/generators/data/mixed_complex_types/typescript/index.ts:50 \u00B7 engine/generators/data/optional_nullable/typescript/index.ts:70 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/mixed_complex_types/typescript/index.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"6492a8413bec969e0fb461dc07cf6c1ee24a9116a5a43dbbebc04036224de3d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): engine/language_client_typescript/safe_imports.js:5 \u00B7 engine/language_client_typescript/typescript_src/safe_imports.ts:3 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/safe_imports.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"937de9813431fc844cdcc55c3a31394f9d52be09136248b23e75f45d632338d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): typescript/apps/vscode-ext/src/utils/getNonce.ts:9 \u00B7 typescript2/app-vscode-ext/src/utils/getNonce.ts:4 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/utils/getNonce.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8ddacc588b0e757890e1fd201fc5f14042b8d7e369ff382e71f9ebafe08c64"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/smart-edge.ts:443 \u00B7 typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/smart-edge.ts:458 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/smart-edge.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f30257db6aaf0286965e4492a005462091eaa519b2f9cf3aa3ad9eff35005b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): typescript/packages/playground-common/src/graph-primitives/edges/Marker.tsx:37 \u00B7 typescript2/pkg-playground/src/graph/edges/Marker.tsx:61 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/edges/Marker.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7176d9c8ab6b883b7a0bc384ba685694bda7fef5cc2d0b84b0c5a77c6bb225b0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): typescript/packages/playground-common/src/sdk/runtime/BamlRuntime.ts:1045 \u00B7 typescript/packages/playground-common/src/sdk/runtime/BamlRuntime.ts:1086 \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":"typescript/packages/playground-common/src/sdk/runtime/BamlRuntime.ts"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"038d5b80633ed3fd52d5f06e6a250ceeb1f65b30f297530945824465f82b0c71"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/atoms.ts:65 \u00B7 typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/atoms.ts:166 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/atoms.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"be95a2815cc2142b05321bd7de4f9e0ba6c28882c12e13726b02f87aa83c6126"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): typescript2/app-beps/convex/analysisJobs.ts:151 \u00B7 typescript2/app-beps/convex/bcsTracking.ts:56 \u00B7 typescript2/app-beps/convex/comments.ts:297 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/analysisJobs.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"de341c676473e6fb145e0e670b33b1cd6091dae5b4271f3edceff783a3d20ccb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): typescript2/app-beps/convex/comments.ts:222 \u00B7 typescript2/app-beps/convex/comments.ts:412 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/comments.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f868a4081fc205b218100dac298e481e565043197982745896c13cec77fd5c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): typescript2/app-beps/convex/comments.ts:288 \u00B7 typescript2/app-beps/convex/issues.ts:61 \u00B7 typescript2/app-beps/convex/issues.ts:234 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/comments.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"2932ef4e3138b5de2c4cc3fb059f445ba2025c609f8ecf062deb67626447b3fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): typescript2/app-beps/convex/slack.ts:616 \u00B7 typescript2/app-beps/convex/users.ts:267 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/slack.ts"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccef1092b589dafa3349c2167bf4e2e81d40ef4d8616faff4ab61f1b82b1812"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): typescript2/app-beps/convex/users.ts:48 \u00B7 typescript2/app-beps/convex/users.ts:240 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/users.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"309755eb3dfc37937b145da8eb11e83a44fea2cd0b1123411cab1b03c354169b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): typescript2/app-beps/src/app/bcs/actions.ts:448 \u00B7 typescript2/app-beps/src/app/bcs/actions.ts:487 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/actions.ts"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc14c8d5de3946f94ce3010ab2cda8faed012c59e5b31d99294592f6dbf08b4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5 locations): typescript2/app-beps/src/components/bep/bep-card.tsx:29 \u00B7 typescript2/app-beps/src/components/bep/bep-kanban-card.tsx:28 \u00B7 typescript2/app-beps/src/components/comments/comment-feed-view.tsx:176 \u00B7 typescript2/app-beps/src/components/comments/comment-thread.tsx:121 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 5 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-card.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23d6e47b133ad08adc66061fe0bc478dfec566f7684fbdf12c2c89106d85a9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): typescript2/app-beps/src/components/bep/bep-route-shell.tsx:537 \u00B7 typescript2/app-beps/src/components/ui/shiki-code-block.tsx:63 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-route-shell.tsx"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca8c05852221fd1ad988effb4fe421bd07c874f9ac179a829486d837a62a10a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): typescript2/app-beps/src/components/bep/bep-status-select.tsx:101 \u00B7 typescript2/app-beps/src/components/decisions/decision-form.tsx:59 \u00B7 typescript2/app-beps/src/components/issues/issue-form.tsx:56 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-status-select.tsx"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda3736a766ca8bae9c80b40613f493da020695f83beee47eba2c34598e91745"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 9 locations): typescript2/app-beps/src/components/ui/dialog.tsx:26 \u00B7 typescript2/app-beps/src/components/ui/dialog.tsx:93 \u00B7 typescript2/app-beps/src/components/ui/dropdown-menu.tsx:52 \u00B7 typescript2/app-beps/src/components/ui/dropdown-menu.tsx:90 \u00B7 \u002B5 more site(s) not listed \u2014 the 9 copies are spread across 5 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/dialog.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b069b4e26b7efb749a8c7a6b048aaa3bd7c0bb65ec89e225fa5c7fac82ba87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): typescript2/app-developer-docs/components/docs-page-actions.tsx:33 \u00B7 typescript2/app-developer-docs/components/docs-page-actions.tsx:174 \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":"typescript2/app-developer-docs/components/docs-page-actions.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef9d2c292ede5a0693eeea090e6f0bbb8f0cc50b8c9120ea1f07eb39bd3ee28"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): typescript2/app-developer-docs/lib/content/book-perspective-schema.ts:6 \u00B7 typescript2/app-developer-docs/lib/content/bridges.ts:9 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/content/book-perspective-schema.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"042cc866a23bf46b22b582741cdd2cf003f99f2ab304a7a49935dda08c9cc2b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): typescript2/app-developer-docs/lib/snippets/checker.ts:143 \u00B7 typescript2/app-developer-docs/lib/snippets/discovery.ts:61 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/snippets/checker.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfff73d0c78acffc1b54324a6e2480fc4b0f25e02fda0ff9489dbe29f5e06d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts:322 \u00B7 typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts:426 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"fefef6c1b2a93b3b1db4d9e6f12da3fa54a5cdaaba03d0d6893beba5a8e41d0f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): typescript2/app-product-metrics/scripts/fetch-zoom-six-weeks.ts:84 \u00B7 typescript2/app-product-metrics/src/jobs/fetch-luma-eap.ts:112 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/scripts/fetch-zoom-six-weeks.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"0593f2da2afd2fec83cb30d6cb9da7166c606f8a3eaab6eb547df4a23c07d5c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): typescript2/app-product-metrics/src/clients/zoom.ts:34 \u00B7 typescript2/app-product-metrics/src/external-data.ts:10 \u00B7 typescript2/app-product-metrics/src/jobs/aggregate-weekly-metric.ts:33 \u00B7 typescript2/app-product-metrics/src/jobs/fetch-luma-eap.ts:43 \u2014 the 4 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/clients/zoom.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9c315b81fe02085c1943ce5f4de0cbf17377057840248d67f244dbb0a1b882"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts:693 \u00B7 typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts:719 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f66481a44cf262edf8abb70b90fd664741ba9251e35b4edbb9dd278a53784b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): typescript2/app-website/app/(home)/logo-ideas/generated.tsx:619 \u00B7 typescript2/app-website/app/(home)/logo-ideas/generated.tsx:720 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/logo-ideas/generated.tsx"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8bb264fd2aca28a6722610a77a5770a923b69cb7dce6d095473a395c2e7532e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): typescript2/app-website/components/icons.tsx:563 \u00B7 typescript2/app-website/components/icons.tsx:1172 \u00B7 typescript2/app-website/components/icons.tsx:1313 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/icons.tsx"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e54459b71cd068d84fbfaca987a3fba72b5275911af9fbe85aa4cf63ee50c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): typescript2/app-website/components/pricing/meter.tsx:162 \u00B7 typescript2/app-website/components/pricing/meter.tsx:419 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/pricing/meter.tsx"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60d2a27b02542a3cc13acefafa2c91ce5c281e8faa9b2022eebda050a2a1dd0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): typescript2/app-website/lib/mdx/bfcl/_components/TestResultsTable.tsx:965 \u00B7 typescript2/app-website/lib/mdx/bfcl/_components/TestResultsTable.tsx:974 \u00B7 typescript2/app-website/lib/mdx/bfcl/_components/TestResultsTable.tsx:983 \u00B7 typescript2/app-website/lib/mdx/bfcl/_components/TestResultsTable.tsx:992 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/bfcl/_components/TestResultsTable.tsx"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"6513ad8087ce1cac6eaee03e8e886b459b9da7b577dfa26c49e5a1e579be95b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): typescript2/pkg-editor/src/MonacoEditor.tsx:225 \u00B7 typescript2/pkg-editor/src/MonacoEditor.tsx:261 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-editor/src/MonacoEditor.tsx"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f9b744735490c2290d039c5fcc4beb484299bdbae6bbeee7d8014e7cace23d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): typescript2/pkg-grammar-treesitter/grammar.js:244 \u00B7 typescript2/pkg-grammar-treesitter/grammar.js:378 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Check what actually differs between the copies before collapsing them: every one of them is an argument to a \u0060grammar(\u2026)\u0060 call, so where these calls are a MATRIX of cases \u2014 one per input, differing precisely in the case each one pins \u2014 the repetition is the enumeration and extracting the shared part would delete cases rather than de-duplicate anything."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar-treesitter/grammar.js"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"115744c24fc02179609d5a7c8bb337ad1c4a94b19f0004fd0bbbf0029eb6adc1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): typescript2/pkg-playground/src/renderers/HttpRequestCurl.tsx:73 \u00B7 typescript2/pkg-playground/src/renderers/HttpRequestCurl.tsx:146 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/renderers/HttpRequestCurl.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f2f4643bc3820b388c0a968e0510cd0fe605065f5b5eaf6f0188c5571b7e1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): typescript2/pkg-playground/src/telemetry/TelemetryView.tsx:2517 \u00B7 typescript2/pkg-playground/src/telemetry/TelemetryView.tsx:3135 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":2517}}}],"partialFingerprints":{"codehealthFindingId/v1":"b563f9fd62c01b9780c18e59004178a2909d1e125113df177715f3bad72d5cc1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): baml_language/tools/speedtest/workloads/interfaces/to-string-interpolation-10k/main.js:17 \u00B7 baml_language/tools/speedtest/workloads/string/template-two-strings-10k/main.js:3 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/interfaces/to-string-interpolation-10k/main.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"402218c7560a5336b455e20d2ae8e778c5cccad7c73ebf5469cd73972cd6653e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): typescript/apps/fiddle-web-app/app/[project_id]/_components/Tree/FileViewer.tsx:220 \u00B7 typescript/apps/fiddle-web-app/app/[project_id]/_components/Tree/FileViewer.tsx:286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_components/Tree/FileViewer.tsx"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb5445eb42b20ceceb113c6ddd6e4a51fc5c025e3b66203ff8c9e338ffcbc57"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): typescript/apps/vscode-ext/src/panels/WebviewPanelHost.ts:542 \u00B7 typescript/apps/vscode-ext/src/plugins/language-server-client/index.ts:713 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/panels/WebviewPanelHost.ts"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecd86a68a32d168759bb9748b924263cdc27064507ca86114caac8b9fd0b5e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): typescript/packages/playground-common/src/features/graph/layout/edge/point.ts:108 \u00B7 typescript/packages/playground-common/src/features/graph/layout/edge/point.ts:140 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/edge/point.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d53bec5952f972d085dd0e3764de7db8e010b79225119c6578abd70710691e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): typescript/packages/playground-common/src/sdk/navigation/target-enricher.ts:96 \u00B7 typescript/packages/playground-common/src/sdk/navigation/target-enricher.ts:141 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/navigation/target-enricher.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"92af8c119f1cd7afa884a3c3a159f2a165514381ae31a0448984172b5a0394d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): typescript/packages/playground-common/src/sdk/runtime/BamlRuntime.ts:810 \u00B7 typescript2/app-website/lib/mdx/baml-block/baml-project-panel/atoms.ts:113 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/runtime/BamlRuntime.ts"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"14157f319cc996a920ecc196a95cb95cf33f9ac45def88007473ffb19fa18c1e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/function-test-name.tsx:36 \u00B7 typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/atoms.ts:12 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/function-test-name.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0bb85f423aa54153d8262d5861554821b36f2c1950b9291b72e4c5d0df52701"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/pdf-viewer.tsx:141 \u00B7 typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/pdf-viewer.tsx:170 \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":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/pdf-viewer.tsx"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c6a6001da9ea17ad106309055c533a287f7f7c8c18048d17a49b299b00e699"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/atoms.ts:12 \u00B7 typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/side-bar/index.tsx:35 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/atoms.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5f7613c5069e05a85b5e2549fc3a6f0e91994c5dafea78ab6c9a00880b7918"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/index.tsx:60 \u00B7 typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/side-bar/index.tsx:50 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/index.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"5515442be478c4855fe0502048bf5a51882d4b5df51dc39c1080ad0090d5e59c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/utils.tsx:1 \u00B7 typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/side-bar/index.tsx:186 \u00B7 typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/side-bar/index.tsx:271 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/utils.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4879e768675c2acf49eee6ab50cb5a4cb02c8b78341d9fc9ffc958fd50f13850"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): typescript/packages/ui/src/custom/gradient-button.tsx:26 \u00B7 typescript2/app-beps/src/components/ui/button.tsx:35 \u00B7 typescript2/app-feedback/src/components/ui/button.tsx:35 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/custom/gradient-button.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"35303ef8718c0bdacb3edaad8d9a0b4d904defc774b6139c52c68441b62618d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): typescript/packages/ui/src/custom/icons.tsx:189 \u00B7 typescript/packages/ui/src/custom/icons.tsx:197 \u00B7 typescript/packages/ui/src/custom/icons.tsx:278 \u00B7 typescript/packages/ui/src/custom/icons.tsx:409 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/custom/icons.tsx"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e486575e673a1110cb2af5164d92137b1e713ce66083bec2a66be2f7215baaa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): typescript2/app-beps/convex/analysisJobs.ts:115 \u00B7 typescript2/app-beps/convex/analysisJobs.ts:220 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/analysisJobs.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"977a08f2e78666723fcb9fcd55fcbc00c404bf2e4192c812f32678092516def6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): typescript2/app-beps/convex/bcs.ts:248 \u00B7 typescript2/app-beps/convex/bcs.ts:299 \u2014 the two spans are one implementation copied and then locally edited \u2014 95 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcs.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"924b1723941117d7b096d79375eac67a36203f809fca0138b3018c8f07840044"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): typescript2/app-beps/convex/bcsComments.ts:46 \u00B7 typescript2/app-beps/convex/bcsComments.ts:347 \u00B7 typescript2/app-beps/convex/bcsStances.ts:22 \u00B7 typescript2/app-beps/convex/bcsTracking.ts:51 \u2014 the 4 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsComments.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1d1d64a8cd954406fdab0fcc435296c870331e3691e8989b8086919f45b76a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): typescript2/app-beps/convex/bcsComments.ts:135 \u00B7 typescript2/app-beps/convex/bcsComments.ts:179 \u00B7 typescript2/app-beps/convex/bcsComments.ts:218 \u00B7 typescript2/app-beps/convex/bcsTracking.ts:229 \u2014 the 4 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsComments.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"379aa3b41d6563ae593e94c7fe3dbf3a68799702e1e779fcd62f402e902907f8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): typescript2/app-beps/convex/bcsStances.ts:64 \u00B7 typescript2/app-beps/convex/bcsStances.ts:92 \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":"typescript2/app-beps/convex/bcsStances.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ca58dea8058891c2b0ba0aa09b4ad17769ad2dfc131ab929eef289db109caa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): typescript2/app-beps/convex/beps.ts:387 \u00B7 typescript2/app-beps/convex/beps.ts:606 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"7132042e2d14de22c548d3504bf277c2a903b05e80ca79adb61cd0d8a9aee425"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): typescript2/app-beps/convex/schema.ts:300 \u00B7 typescript2/app-beps/convex/schema.ts:308 \u00B7 typescript2/app-beps/convex/schema.ts:316 \u2014 all 3 copies are in the same file, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/schema.ts"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48dad02ad1d335f7b508cc7c8bff5239b53fd82f8450be60573cf1b7fb7db26"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): typescript2/app-beps/src/app/bcs/actions.ts:257 \u00B7 typescript2/app-beps/src/app/bcs/actions.ts:317 \u00B7 typescript2/app-beps/src/app/bcs/actions.ts:456 \u00B7 typescript2/app-beps/src/app/bcs/actions.ts:520 \u2014 all 4 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/actions.ts"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"2130529b895a52b06a6e00fa004b82d27ba0e6174d11c864d2a49ef8448d284d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): typescript2/app-beps/src/app/bcs/actions.ts:284 \u00B7 typescript2/app-beps/src/app/bcs/actions.ts:312 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/actions.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17b5a438152e1624ba7c4b9866acc2945f7286e076243d3cae344692f1467d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): typescript2/app-beps/src/app/bcs/actions.ts:366 \u00B7 typescript2/app-beps/src/app/bcs/actions.ts:521 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/actions.ts"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"906faf89cb3e81a848cd575b67c57b7871c6e6ce54b601ee63af689c2be5ee5b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): typescript2/app-beps/src/app/bcs/forms.tsx:121 \u00B7 typescript2/app-beps/src/app/bcs/forms.tsx:152 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/forms.tsx"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfdf8d78f8ad21521afba652478daffba1ed48615284065c3e8de761c9bccc3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): typescript2/app-beps/src/app/bcs/new/page.tsx:14 \u00B7 typescript2/app-beps/src/app/bcs/page.tsx:24 \u00B7 typescript2/app-beps/src/app/bcs/token/page.tsx:16 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/new/page.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d54049652846d2ba5c695b2cedd1319e8c761ff08af1393b2da9092ef15a54"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 13 locations): typescript2/app-beps/src/components/ui/dropdown-menu.tsx:37 \u00B7 typescript2/app-beps/src/components/ui/scroll-area.tsx:21 \u00B7 typescript2/app-beps/src/components/ui/select.tsx:30 \u00B7 typescript2/app-beps/src/components/ui/select.tsx:47 \u00B7 \u002B9 more site(s) not listed \u2014 the 13 copies are spread across 5 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/dropdown-menu.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f76cef43d2ddb3a2e5d308109805ce221ddc09909206dfaf0512f410c3878f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): typescript2/app-beps/src/components/ui/mermaid-diagram.tsx:10 \u00B7 typescript2/app-beps/src/hooks/use-theme.ts:10 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/mermaid-diagram.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"beff1570e0243ae8dfa609fbda2bb702488bd74c3a02cb97f49c8639862b629d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): typescript2/app-beps/src/lib/export-utils.ts:948 \u00B7 typescript2/app-beps/src/lib/export-utils.ts:959 \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":"typescript2/app-beps/src/lib/export-utils.ts"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb27fbe0cf20e9ae9adb501cbc9bfe5f267cd119d300bef673a414bc16327ced"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-widen-then-assert.ts:56 \u00B7 typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-widen-then-assert.ts:150 \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":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-widen-then-assert.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b552534eee54eb07035e13d0283ee014c2a586662e16a8bcbc181b82e749a76d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): typescript2/app-speedtest/src/App.tsx:268 \u00B7 typescript2/app-speedtest/src/App.tsx:304 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/src/App.tsx"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1571a5478805fc543d2e843be724d8ef71fcd4694c1a34759a31939502e39fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): typescript2/app-stdlib-matrix/src/navigation.ts:206 \u00B7 typescript2/app-stdlib-matrix/src/navigation.ts:222 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-stdlib-matrix/src/navigation.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"effc600bb4cc2c98dbe70bd3d8f06faf364724147cbaa5ca518607981ccf67f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): typescript2/app-type-quiz/scripts/smoke.mjs:254 \u00B7 typescript2/app-type-quiz/scripts/smoke.mjs:554 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-type-quiz/scripts/smoke.mjs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"5359dde37042a65e0845085640d8fc578409e4fabd225d36c36af70f7fc4ff2e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): typescript2/app-type-quiz/scripts/smoke.mjs:387 \u00B7 typescript2/app-type-quiz/scripts/smoke.mjs:452 \u00B7 typescript2/app-type-quiz/scripts/smoke.mjs:586 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-type-quiz/scripts/smoke.mjs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7885cae17f1fc45f004d76ff0a015771267711d28f5ebaaef6181e5c80eb511"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): typescript2/pkg-grammar-hljs/scripts/assemble-mirror.mjs:97 \u00B7 typescript2/pkg-grammar/scripts/assemble-mirror.mjs:103 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar-hljs/scripts/assemble-mirror.mjs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a899a228113e327e10f56307e6620e003016e4b0e5460fb9a51a39a5b6b3b58d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): typescript2/pkg-grammar/src/baml.ts:389 \u00B7 typescript2/pkg-grammar/src/baml.ts:411 \u00B7 typescript2/pkg-grammar/src/baml.ts:557 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar/src/baml.ts"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"497ab52bdae0ade548147e8ac950b1f424cca69c2178ad8ce97860d2bb77919b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): typescript2/pkg-playground/src/ExecutionPanel.tsx:1545 \u00B7 typescript2/pkg-playground/src/ExecutionPanel.tsx:1809 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"2944b389bbd8abf86317bb197793a93853a733f0ae764774051307816ad1aff6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): typescript2/pkg-playground/src/renderers/HttpRequestCurl.tsx:90 \u00B7 typescript2/pkg-playground/src/renderers/HttpRequestCurl.tsx:122 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/renderers/HttpRequestCurl.tsx"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f9bdcbe4d4ce01bb87af37218c5579561e4cf45263c73fdddd694a3eb2c53f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): baml_language/tools/speedtest/workloads/compute/closure-apply-1m/main.js:1 \u00B7 baml_language/tools/speedtest/workloads/compute/generic-apply-inferred-1m/main.js:1 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/closure-apply-1m/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8969f4477a36d36bbb51bc6d2ccd2079de076527961c51833141414dffe76a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): baml_language/tools/speedtest/workloads/compute/nbody-20k/main.js:10 \u00B7 baml_language/tools/speedtest/workloads/compute/nbody-20k/main.js:27 \u2014 the two spans are one implementation copied and then locally edited \u2014 97 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/nbody-20k/main.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d58c8cbe4dcd2dc624569a802cb8c605ddf18dbd2bee0a5294b4bfe4f7a065f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): tools/stdlib-matrix/extractors/ts-surface.mjs:294 \u00B7 tools/stdlib-matrix/extractors/ts-surface.mjs:307 \u00B7 tools/stdlib-matrix/extractors/ts-surface.mjs:323 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/stdlib-matrix/extractors/ts-surface.mjs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdd75942366fdd6fbba1cd47864f338651fce21d97a5ad16c5f08b15b93011c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): typescript/apps/fiddle-web-app/lib/loadProject.ts:115 \u00B7 typescript/apps/fiddle-web-app/lib/loadProject.ts:139 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/lib/loadProject.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71c18b109f407d889f6a314a170ad2a54ff8fe18ab57961080bf1cca71ce408"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): typescript/packages/playground-common/src/sdk/atoms/core.atoms.ts:923 \u00B7 typescript/packages/playground-common/src/sdk/storage/JotaiStorage.ts:556 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/atoms/core.atoms.ts"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"395d2f71d6cca2f91463a4fd8f860313bed2aeeb01db476314fd8e53cd5856ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): typescript/packages/playground-common/src/sdk/storage/JotaiStorage.ts:155 \u00B7 typescript/packages/playground-common/src/sdk/storage/JotaiStorage.ts:229 \u00B7 typescript/packages/playground-common/src/sdk/storage/JotaiStorage.ts:247 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/storage/JotaiStorage.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1a28667d4b5d6c3318d32c519496577605a260875ee60a4efebc56c9de0a78"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/graph-view.tsx:92 \u00B7 typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/graph-view.tsx:115 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/graph-view.tsx"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"663e54e5cdcfcb38e62e6054419a0877adb9664b93dba1437f5036f062740626"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 13 locations): typescript/packages/ui/src/custom/icons.tsx:176 \u00B7 typescript/packages/ui/src/custom/icons.tsx:186 \u00B7 typescript/packages/ui/src/custom/icons.tsx:241 \u00B7 typescript/packages/ui/src/custom/icons.tsx:248 \u00B7 \u002B9 more site(s) not listed \u2014 all 13 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":"typescript/packages/ui/src/custom/icons.tsx"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"289fd0a9cf0d8be2eed9666879baa9a3d9479c00c43c62484da5d5a0d0ef3504"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): typescript2/app-beps/convex/bcs.ts:355 \u00B7 typescript2/app-beps/convex/bcsTracking.ts:104 \u00B7 typescript2/app-beps/convex/bcsTracking.ts:153 \u00B7 typescript2/app-beps/convex/bcsTracking.ts:188 \u2014 the 4 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcs.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aee7947dea5f7904ca9f205109f829b55e2c817d54510925b6bc0a458fe6a21"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): typescript2/app-beps/convex/bcs.ts:597 \u00B7 typescript2/app-beps/convex/bcsComments.ts:49 \u00B7 typescript2/app-beps/convex/bcsComments.ts:350 \u00B7 typescript2/app-beps/convex/bcsTracking.ts:54 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcs.ts"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd280a05feb456bb5d698859ea56a466cd78c7fda4481b13bc2c9221fb5c6a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): typescript2/app-beps/convex/bcsTracking.ts:190 \u00B7 typescript2/app-beps/convex/bcsTracking.ts:232 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsTracking.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed396d72578f58853239a6334246e04f518867d4d6ad96a890d46df5fca640d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4 locations): typescript2/app-beps/convex/decisions.ts:100 \u00B7 typescript2/app-beps/convex/issues.ts:133 \u00B7 typescript2/app-beps/convex/issues.ts:206 \u00B7 typescript2/app-beps/convex/issues.ts:224 \u2014 the 4 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/decisions.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7c877b546a312fc063868b8774f17ae1a165b06630f895b05960c67f2322c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): typescript2/app-beps/convex/export.ts:25 \u00B7 typescript2/app-beps/convex/export.ts:129 \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":"typescript2/app-beps/convex/export.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd029f41690deac6048d661b758200f0982def5a298b8e0b16d4f00fef26b514"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): typescript2/app-beps/convex/http.ts:69 \u00B7 typescript2/app-beps/convex/http.ts:84 \u00B7 typescript2/app-beps/convex/http.ts:96 \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":"typescript2/app-beps/convex/http.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff5485950c5dda76e9a553553f40a11958189433ee58f11e3fffbd4ceb2cd18"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): typescript2/app-beps/convex/issues.ts:106 \u00B7 typescript2/app-beps/convex/schema.ts:247 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/issues.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"6148bfa6bfd74bc03471978fc7f7d33c1b672a5bef2d6c97697fa6cb1c4afcc6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): typescript2/app-beps/convex/schema.ts:522 \u00B7 typescript2/app-beps/convex/schema.ts:538 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/schema.ts"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"920f901f9ca9c553321e42622d682cdc02af1b7936f48afd6eec5fb5b9c77b34"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): typescript2/app-beps/src/app/bcs/[number]/add/page.tsx:37 \u00B7 typescript2/app-beps/src/app/bcs/[number]/comments/page.tsx:61 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/add/page.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"da90f1a30e89daf76fba85239ca35b135f065b25551cf2f2d618d6b8a706710b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): typescript2/app-beps/src/app/bcs/[number]/tracking-forms.tsx:82 \u00B7 typescript2/app-beps/src/app/bcs/forms.tsx:268 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/tracking-forms.tsx"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c8e43d2671ea2af300045ca8a9a97750380c194a93382583824de55a448e4e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5 locations): typescript2/app-beps/src/app/bcs/actions.ts:331 \u00B7 typescript2/app-beps/src/app/bcs/actions.ts:378 \u00B7 typescript2/app-beps/src/app/bcs/actions.ts:448 \u00B7 typescript2/app-beps/src/app/bcs/actions.ts:487 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/actions.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6296c66d1d1bdec12b7729526b00c808e84d840645bb02e3634ed322fc69ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): typescript2/app-beps/src/components/bep/bep-nav.tsx:115 \u00B7 typescript2/app-beps/src/lib/export-all-utils.ts:405 \u00B7 typescript2/app-beps/src/lib/export-utils.ts:376 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-nav.tsx"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"6322c006e323ac7d0ed36a4700912e551cc76b66f85f412acbd58730c42d5ad9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): typescript2/app-beps/src/components/comments/comment-feed-view.tsx:122 \u00B7 typescript2/app-beps/src/components/comments/comment-sidebar.tsx:92 \u00B7 typescript2/app-beps/src/components/comments/comment-thread.tsx:81 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"3656b6817b5e0695b2032fea32d359b0a3fb2ed79e30b363cf06df9304451ab2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): typescript2/app-developer-docs/lib/content/bridges.ts:9 \u00B7 typescript2/app-developer-docs/lib/generated-content/package-export.ts:6 \u2014 the two spans are one implementation copied and then locally edited \u2014 65 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/content/bridges.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"969631b2df71e9ef2c54a85ee373b2a1ef80e56a19fbb08b05c8e2d84dc679cd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): typescript2/app-developer-docs/lib/generated-content/baml-binary.ts:42 \u00B7 typescript2/app-developer-docs/lib/generated-content/release-generator.ts:39 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/generated-content/baml-binary.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21486fc4f19ff8338e45bafb6b0d86fe2f937feee03a3738e92c2968ba16153"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): typescript2/app-developer-docs/lib/generated-content/document-ir.ts:153 \u00B7 typescript2/app-developer-docs/lib/generated-content/schemas.ts:21 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/generated-content/document-ir.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e5e5a000d27cbb0092b0c3b856a771c9fec1b981d64f9c13d2b1ce893ac046"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): typescript2/app-product-metrics/src/jobs/send-slack-report.ts:363 \u00B7 typescript2/app-product-metrics/src/jobs/send-slack-report.ts:375 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/jobs/send-slack-report.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba01312064cb2c16e2407650094f2da2d8a67d6d49ebb109adf0e0dab2d59358"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): typescript2/app-product-metrics/src/server.ts:31 \u00B7 typescript2/app-product-metrics/src/server.ts:39 \u00B7 typescript2/app-product-metrics/src/server.ts:46 \u2014 all 3 copies are in the same file, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS \u2014 bindings the module declares and exports \u2014 rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER \u2014 the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration \u2014 one binding per distinct thing, differing precisely in the thing each one names \u2014 the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/server.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a185f06aebb54874117c497d2e3dd28c9fb987583f784819b8ef98c33980d69"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): typescript2/app-website/app/(home)/blog/_lib/art.tsx:84 \u00B7 typescript2/app-website/app/(home)/logo-ideas/marks.tsx:304 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/blog/_lib/art.tsx"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38d1a050533a9fe20bff1fba73ab6be31c104ac56bee3bf49d99a7b5067b896"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): typescript2/app-website/components/home/agents.tsx:12 \u00B7 typescript2/app-website/components/home/observe.tsx:8 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/agents.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34fa994eaaf7b1f09c66cc919a282a844e00f1eadfc190138eac4a04066e8a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): typescript2/pkg-playground/src/run-store-projections.ts:567 \u00B7 typescript2/pkg-playground/src/value-body-cache.ts:80 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/run-store-projections.ts"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4990dc15604f949a04af451991abe4e038bb4f386104d22a5ac25af0f028b52"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): baml_language/tools/speedtest/workloads/compute/json-aggregate-2k/main.js:32 \u00B7 baml_language/tools/speedtest/workloads/compute/quick-sort-3way-1k/main.js:35 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/json-aggregate-2k/main.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32adc939199bebcffdcfae3dd07b7201c19c24eba74b43f038e295f534646bf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): baml_language/tools/speedtest/workloads/compute/json-ndjson-events/main.js:1 \u00B7 baml_language/tools/speedtest/workloads/compute/json-tree-path/main.js:1 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/json-ndjson-events/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30f706b73e6e6cc6b28b07ae4f75268f21b229c5234175f7fea4f8ac5c2ae92"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): baml_language/tools/speedtest/workloads/compute/json-request-body/main.js:41 \u00B7 baml_language/tools/speedtest/workloads/programs/agent-loop-300/main.js:56 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/json-request-body/main.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"186bfcc5b009b898b8945498229bd8fb48f7adf5e574013cc344b3a3e4ac1e49"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): engine/generators/data/array_types/typescript/index.ts:198 \u00B7 engine/generators/data/array_types/typescript/index.ts:204 \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":"engine/generators/data/array_types/typescript/index.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64de97fb904c4c1679aef9e8865cc1ec2a8779dea7b367cdc9b0f80d3f0e971"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): engine/generators/data/map_types/typescript/index.ts:197 \u00B7 engine/generators/data/map_types/typescript/index.ts:203 \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":"engine/generators/data/map_types/typescript/index.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f37ada03a5567bb8e3d3ae61d7047107ff281d85319db58cd3dd35a8193423"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): engine/generators/data/primitive_types/typescript/index.ts:66 \u00B7 engine/generators/data/primitive_types/typescript/index.ts:72 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/primitive_types/typescript/index.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b698cd9b06f4e40d8ebe84bd0d4ed4ba60f25471d95208bfe034fd07f8d05e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): typescript/apps/vscode-ext/src/plugins/language-server-client/index.ts:718 \u00B7 typescript/apps/vscode-ext/src/plugins/language-server-client/index.ts:738 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/plugins/language-server-client/index.ts"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f2da50a474345e06f3d22a20331b035e11f0c269048eed162afc789dd112cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/render-part.tsx:32 \u00B7 typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/render-part.tsx:41 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/render-part.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0749adf81f1d2b6549c795f885f34292a000c7657ab0ee2e4a69facd8a5b870f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx:55 \u00B7 typescript2/app-promptfiddle/src/playground/vfs.ts:371 \u00B7 typescript2/app-website/playground/vfs.ts:394 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f34c27f1daea4712cbe2a469fe638a7fe58c02b0806eb1fcbdbda3c393ad1b2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx:72 \u00B7 typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx:90 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"4207856aebda2779ae0c656f3be6cab4c10b5d36cad20bdd09713d9b2aea8d37"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 33 locations): typescript/packages/ui/src/custom/icons.tsx:147 \u00B7 typescript/packages/ui/src/custom/icons.tsx:153 \u00B7 typescript/packages/ui/src/custom/icons.tsx:159 \u00B7 typescript/packages/ui/src/custom/icons.tsx:165 \u00B7 \u002B29 more site(s) not listed \u2014 all 33 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/custom/icons.tsx"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"6252f72ebc357749d1daba3694a09967eb3d8b91f900622ad2676fe7290013fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): typescript/packages/ui/src/custom/icons.tsx:218 \u00B7 typescript/packages/ui/src/custom/icons.tsx:316 \u00B7 typescript/packages/ui/src/custom/icons.tsx:377 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/custom/icons.tsx"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"735a0e04d1547bbdbf78814a5335388f38fa6f48763d4999bce0b60031009442"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): typescript2/app-beps/convex/bcs.ts:150 \u00B7 typescript2/app-beps/convex/bcsComments.ts:100 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcs.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"c301ae15457d668788e31cd017e1796843de26d9658f90e9c4a65a2cb1e8682d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): typescript2/app-beps/convex/bcsTracking.ts:135 \u00B7 typescript2/app-beps/convex/bcsTracking.ts:192 \u00B7 typescript2/app-beps/convex/bcsTracking.ts:234 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsTracking.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"e925ec65edcd7403df05a3a935f891db9a06e9288760bf6a37748c6034d22631"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 9 locations): typescript2/app-beps/convex/beps.ts:63 \u00B7 typescript2/app-beps/convex/comments.ts:11 \u00B7 typescript2/app-beps/convex/comments.ts:227 \u00B7 typescript2/app-beps/convex/comments.ts:294 \u00B7 \u002B5 more site(s) not listed \u2014 the 9 copies are spread across 4 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8231fade51363015d46309a10f80d8f8b8e9ace8a4df1496c14799e70ec0126"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): typescript2/app-beps/convex/comments.ts:254 \u00B7 typescript2/app-beps/convex/comments.ts:266 \u00B7 typescript2/app-beps/convex/presence.ts:11 \u2014 the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/comments.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"d479d46d59a271ff03b6d1052e1fca41ee37fcea82bbfe93bb54599326b28efd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): typescript2/app-beps/src/app/bcs/[number]/comments/page.tsx:26 \u00B7 typescript2/app-beps/src/app/bcs/[number]/decisions/page.tsx:21 \u00B7 typescript2/app-beps/src/app/bcs/[number]/issues/page.tsx:22 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/comments/page.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9008abd4c6bfa926b09f31a4a4404499ba1a4ccd35e2d2ccb93f2147c831620"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): typescript2/app-beps/src/components/comments/comment-feed-view.tsx:758 \u00B7 typescript2/app-beps/src/components/comments/comment-sidebar.tsx:623 \u00B7 typescript2/app-beps/src/components/comments/comment-sidebar.tsx:894 \u2014 the 3 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"3424dffa00a0f85ccc3165dd169998448698d92bf8008567820e01ffcfc3f353"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): typescript2/app-beps/src/lib/export-utils.ts:813 \u00B7 typescript2/app-beps/src/lib/export-utils.ts:890 \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":"typescript2/app-beps/src/lib/export-utils.ts"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b78640bf7cbd81cdb8b3986dea25bd78bd24ece8fa1ee30f381e2361c2e0a04"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): typescript2/app-developer-docs/lib/snippets/discovery.ts:72 \u00B7 typescript2/app-developer-docs/lib/snippets/discovery.ts:79 \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":"typescript2/app-developer-docs/lib/snippets/discovery.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2323904aa1f7ee2c92a11ede17e9ac3d74ead9ceda260d6fa33db0ac47906dc0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts:204 \u00B7 typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts:335 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a623c963cb78fc0f0da43c6dc7c2551d757cc97904bbcd8101b6b921928bf2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): typescript2/app-product-metrics/scripts/fetch-zoom-six-weeks.ts:280 \u00B7 typescript2/app-product-metrics/src/jobs/fetch-luma-eap.ts:194 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/scripts/fetch-zoom-six-weeks.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e97ac2ce53e72fdd86729fffaef9a7b9feebcb4ccb14cc3e39a7e86d2a02f4c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): typescript2/app-speedtest/src/App.tsx:29 \u00B7 typescript2/app-speedtest/src/components/TimingChart.tsx:19 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/src/App.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f323b8147d7f5d029bf1ff61aeadfeaa198f090914dfc6dc87017cf84e99ccc4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): typescript2/app-type-quiz/scripts/smoke.mjs:472 \u00B7 typescript2/app-type-quiz/scripts/smoke.mjs:579 \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":"typescript2/app-type-quiz/scripts/smoke.mjs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"231aec0756d016ce029f86c985785a08384dc93d1cdd408ce7a2cf170571aa97"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): typescript2/app-website/app/(home)/bamlcode/_components/FeedbackWidget.tsx:41 \u00B7 typescript2/app-website/app/(home)/fight-slop-with-slop/_components/pledge-form.tsx:203 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_components/FeedbackWidget.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"5207ea17f60ec5b88042e2cc0ee7f14cdf8c8c4630263d659a5f9bc2cb5b82a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): typescript2/app-website/convex/bamlcodeFeedback.ts:65 \u00B7 typescript2/app-website/convex/slopPledges.ts:60 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/bamlcodeFeedback.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0101db529784827b167ba8615abca7348d7fd0b7fe8e89ee63be3ef07e3b78"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 20 locations): baml_language/tools/speedtest/workloads/compute/call-chain-100x10k/main.js:1 \u00B7 baml_language/tools/speedtest/workloads/compute/call-chain-100x10k/main.js:6 \u00B7 baml_language/tools/speedtest/workloads/compute/call-chain-100x10k/main.js:11 \u00B7 baml_language/tools/speedtest/workloads/compute/call-chain-100x10k/main.js:16 \u00B7 \u002B16 more site(s) not listed \u2014 all 20 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/call-chain-100x10k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9f6de42db3b8d3a00ce31b670ed8e47f1d6ebcea812b319ea67f7c99b3bf49"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): baml_language/tools/speedtest/workloads/memory/live-heap/main.js:1 \u00B7 baml_language/tools/speedtest/workloads/memory/live-walk/main.js:1 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/memory/live-heap/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bac1cc75f760e1750dfc94aadb68866113c247f881df3f2465364c9bd2869cc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): typescript2/app-beps/convex/bcsComments.ts:275 \u00B7 typescript2/app-beps/convex/bcsStances.ts:84 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsComments.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ac5f9e302effb5dc1f811ed251f005925980cbc17bbccfaabaac4cbc128b8c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): typescript2/app-beps/convex/beps.ts:403 \u00B7 typescript2/app-beps/convex/beps.ts:714 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc3192f549720a8bb42fdf85b5849bc869b3e4c4262bdd6ae7925b3de75e389"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): typescript2/app-beps/convex/beps.ts:614 \u00B7 typescript2/app-beps/convex/decisions.ts:138 \u00B7 typescript2/app-beps/convex/issues.ts:163 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a192bb5012a57413719d7f33389db8f7a6305f26dca75ae92ca98b54644638"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): typescript2/app-beps/convex/schema.ts:96 \u00B7 typescript2/app-beps/convex/schema.ts:141 \u2014 all 2 copies are in the same file, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/schema.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54fc1afd26b7d43995fdf71c8d819230c9a74af63f9ab90c66e9b65502a30bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): typescript2/app-beps/src/app/api/agent/bcs/[number]/route.ts:13 \u00B7 typescript2/app-beps/src/app/api/agent/bcs/[number]/route.ts:42 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/bcs/[number]/route.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dcc29f23b00d7724e99387c6bf49cfe15377295e072390127abf22ab00513b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): typescript2/app-beps/src/components/bep/bep-import-dialog.tsx:59 \u00B7 typescript2/app-beps/src/components/issues/issue-card.tsx:62 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-import-dialog.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e550e10ac26e5036c4f4776d359d9b3abbefca4f0a378df20adf189c66754a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/lexical-type-parameters.ts:20 \u00B7 typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/type-alias-resolution.ts:100 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/lexical-type-parameters.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d33a50980666c387b564b06a0d61605655aff75366d6d069529432ce812edba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts:123 \u00B7 typescript2/app-website/playground/baml-worker.ts:116 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2e45e52d3ad40292d89074433c5b39bcd690fe44b63190eff9b27ff7aed26e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): typescript2/pkg-playground/src/graph/layout.ts:343 \u00B7 typescript2/pkg-playground/src/graph/layout.ts:350 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/graph/layout.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90093a75a331ba138d9413b19f8355981f46f482eefc766c7998fbdf5b75998"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): typescript2/pkg-playground/src/renderers/PromptAst.tsx:15 \u00B7 typescript2/pkg-playground/src/result-renderers.ts:25 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/renderers/PromptAst.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f283bdad9e339142e3da7f2fb85a400c5675a42a4d8d9853ad208a07c2f49bf"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: baml_language/sdks/typescript/bridge_typescript_web/typescript_src/index.ts:9 reaches into another package with a relative path (./shared/stream.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/typescript/bridge_typescript_web/typescript_src/index.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f238fa0a9ba9e304ac38dbc92767603f4777651972411ffff4f88e20aec452"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: baml_language/sdks/typescript/bridge_typescript_web/typescript_src/index.ts:18 reaches into another package with a relative path (./shared/errors.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/typescript/bridge_typescript_web/typescript_src/index.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0a9dbc50d0465f287648c00b6cc9402b540d01d69749c87a1a51d1a4b27254"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: baml_language/sdks/typescript/bridge_typescript_web/typescript_src/native.ts:43 reaches into another package with a relative path (./shared/errors.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/typescript/bridge_typescript_web/typescript_src/native.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9f7d87bde7541c9079a16e4cd51fe7e2dd8b5b73a3dcff0eb62cac90d6c13f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: baml_language/sdks/typescript/bridge_typescript_web/typescript_src/platform.ts:2 reaches into another package with a relative path (./shared/errors.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/typescript/bridge_typescript_web/typescript_src/platform.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b942257c1321ae217e4d6e37a488a141475b85cf21daa0af720d399eb53f1d4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: baml_language/sdks/typescript/sdkgen_typescript_shared/src/invocation_facade.ts:1 reaches into another package with a relative path (./vendor/trace/index.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/typescript/sdkgen_typescript_shared/src/invocation_facade.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82c9b642a4afa7b702e252e729a106828669d8aa15972a859c45a9e631dc66a"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: baml_language/sdks/typescript/sdkgen_typescript_shared/src/invocation_facade.ts:2 reaches into another package with a relative path (./baml/spawn/index.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/typescript/sdkgen_typescript_shared/src/invocation_facade.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a2c7c3580c9e6d6081b7609aa2c78a097decf23d3712553c0923255362edec"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: tools/stdlib-matrix/extractors/ts-surface.mjs:181 imports typescript/lib/typescript.js, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/stdlib-matrix/extractors/ts-surface.mjs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf1687c924a56132e362cbf6b7c6d1a4cb027a32efbaf9383e82defcaa62d72"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:deep-import]: typescript/apps/fiddle-web-app/app/[project_id]/_components/ProjectView.tsx:26 imports @baml/playground-common/lib/feedback_widget, which the target package\u0027s package.json \u0060exports\u0060 does not declare \u2014 use a declared entry or declare the subpath."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_components/ProjectView.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc8265cafc506351a7364477327f17eab38427b61db2e63ce13ddf26a15e9f3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: typescript/packages/playground-common/src/features/debug-panel/components/DebugPanel.tsx:15 imports typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/test-runner.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/debug-panel/components/DebugPanel.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c0d5759a156acb10d7ff512fe04f869f5846b33faf70581af5230cd7436c71"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx:26 imports typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/test-runner.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12794ab9a1ba2d8cd0908035b952e08b4f791945995447c1391d8b08e722ac9"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: typescript/packages/playground-common/src/features/graph/layout/node/algorithms/elk-mermaid.ts:1 imports elkjs/lib/elk.bundled.js, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/node/algorithms/elk-mermaid.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c562423782d247b67d92331d1538653e1f65c9a3453e618cc12072186018b4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/function-item.tsx:9 imports typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/atoms.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/function-item.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8967bbec97d323b0a6474218b645daa9a59b5ee0f17483e8472b40adb542b1"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/function-item.tsx:13 imports typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/testStateUtils.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/function-item.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2f8ceea96516ec05a8762ae57ae544088f37475265a16b2dad5e3d00603f49"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/index.tsx:36 imports typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/test-runner.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/index.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d58409616e01a115c6b91531cf31c927b50c119438574ac269393ec5986771"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/index.tsx:37 imports typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/atoms.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/index.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e352716e3713601173ae6c735eca1fd6a4e1c3d588ebf1b2fee172571580e86f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/test-item.tsx:21 imports typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/atoms.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/test-item.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa61fddebb08f347093799450a2bfd1a70eab657aeb4f72accf8201298a8cfc5"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/test-item.tsx:25 imports typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/test-runner.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/test-item.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b34362a1392d2234678eff45edd3321592e76f182f1f06e6a576e086bb7d1b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-suite-dependency]: typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/test-item.tsx:26 imports typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/testStateUtils.ts, a module inside the test suite \u2014 test helpers carry no compatibility contract and are maintained for the suite, not as an API, so production code that depends on one is coupled to a module nobody keeps stable. Move the shared helper into a source directory both layers may depend on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/test-item.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"109e962901d103667b4a85c0d3fa7f2703bb0b78102e9c8df76fb2e01b05f6f8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:deep-import]: typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts:20 imports @b/pkg-playground/wasm-panic, which the target package\u0027s package.json \u0060exports\u0060 does not declare \u2014 use a declared entry or declare the subpath."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e17850e2ffead28e6cc2c07f2da1a9eb485b1212381471ed7eb2b3aca35adca"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: typescript2/app-type-quiz/src/highlight.ts:9 imports highlight.js/lib/core, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-type-quiz/src/highlight.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd82fea26babf375e6ca634fc1b6340a13b95ad030932d6e0d3d8c32f95e362"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: typescript2/pkg-playground/src/graph/layout.ts:1 imports elkjs/lib/elk.bundled.js, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/graph/layout.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1aaa2e28081238767da2342e0e217435a9cfa31c39b009710ef884ce67b48d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ExecutionPanel (cyclomatic 105, cognitive 85): ExecutionPanel has cyclomatic complexity 105 and cognitive complexity 85; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86926815b56913bf98ce6a26ce64651cd297bebbd4ff07311437e015b8b31e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BepRouteShell (cyclomatic 103, cognitive 97): BepRouteShell has cyclomatic complexity 103 and cognitive complexity 97; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-route-shell.tsx"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be3d060a43f6449fa8b320dbcd272d9683855e7e06c03f6d3b2aaef1e524ac3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onmessage (cyclomatic 96, cognitive 137): onmessage has cyclomatic complexity 96 and cognitive complexity 137; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/playground/baml-worker.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd7e474921ce785b08bdbce090d425ed6b27c821472581f858b734440e6b334"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onmessage (cyclomatic 88, cognitive 130): onmessage has cyclomatic complexity 88 and cognitive complexity 130; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"571cd7e7d1f9f66b6f566acd4bec8a93408fd0923d4033749f679d3281f208c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 56, cognitive 49): (anonymous) has cyclomatic complexity 56 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ff862befaaf302db841a29760a14631dbfc9068a670393af13424cc89f1263"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BcsProposal (cyclomatic 52, cognitive 50): BcsProposal has cyclomatic complexity 52 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/page.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c929e40d4c17b0bae45d8aa67d263983095a0b9651fff044fb7d1af73cc360"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function WebviewMedia (cyclomatic 50, cognitive 48): WebviewMedia has cyclomatic complexity 50 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"6212aee4731e1e198616cae5495004d18ee0dbc490d4051011bbf7b291e31f53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function OverviewTab (cyclomatic 47, cognitive 41): OverviewTab has cyclomatic complexity 47 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a368b10ef0fadc9e518d46ebe5c80eb5f8c97f139672d37018d319179a814e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function App (cyclomatic 46, cognitive 66): App has cyclomatic complexity 46 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/src/App.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6939927535c1bb59caad87e3a46e8eec3fe1b2ef02f9b2519ba65020a72b9686"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testKitchenSink (cyclomatic 44, cognitive 42): testKitchenSink has cyclomatic complexity 44 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/mixed_complex_types/typescript/index.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0a0ea99c27f626841255a738f9582fd7e053005e801808582f5dc658bf86ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function submitSignup (cyclomatic 44, cognitive 42): submitSignup has cyclomatic complexity 44 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/actions/signup.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab049aad2130bd9c34cbd8d235a99973705f83ebdeed08cbd8f27ea7b11b1fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 43, cognitive 61): (anonymous) has cyclomatic complexity 43 and cognitive complexity 61; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/run-store-client.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33c49ff27d8462685f9e899d1754247da01f39c198dba8de303d350fac6587a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BepImportDialog (cyclomatic 39, cognitive 37): BepImportDialog has cyclomatic complexity 39 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-import-dialog.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"186d3275f0bcc84440029b05eb89a7781b3354a257cf8a7a46a02b93b612d0ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fromServer (cyclomatic 39, cognitive 28): fromServer has cyclomatic complexity 39 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ports/WebSocketRuntimePort.ts"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"305faeeca2401599c1ff258b6af62d46754377b3a0e1d5d054a965292f6a0450"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function walkLibFile (cyclomatic 38, cognitive 81): walkLibFile has cyclomatic complexity 38 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/stdlib-matrix/extractors/ts-surface.mjs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b690e190f5af73a9c55c12616db013b41840e19ad6cd8e1f6d452418faadde"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 35, cognitive 48): (anonymous) has cyclomatic complexity 35 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/http.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b990432eaccbcb7131bb40c586f85d33d77f001ac806855285589c106c0106"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handler (cyclomatic 35, cognitive 37): handler has cyclomatic complexity 35 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcs.ts"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"776553adc8dd193eadc83e139a6b81ea7a707625ea7312f34a47068302b7075c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testSimpleNested (cyclomatic 34, cognitive 33): testSimpleNested has cyclomatic complexity 34 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/nested_structures/typescript/index.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2cdd8853e0a153e27edf2d625b5762e4aef0046567a3fcfe637844afa3a5984"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ContextInspector (cyclomatic 34, cognitive 32): ContextInspector has cyclomatic complexity 34 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":3192}}}],"partialFingerprints":{"codehealthFindingId/v1":"047f657e6a7c80e21f3198140e88327540668421dba27f7a9732ef51c48f63db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseWatchValue (cyclomatic 33, cognitive 79): parseWatchValue has cyclomatic complexity 33 and cognitive complexity 79; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/sdk.ts"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c24265dfc8b0fc25dc6fb2810d77dbc59c2a8d8cce162187aa605daa3f0873d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handler (cyclomatic 32, cognitive 47): handler has cyclomatic complexity 32 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsSlack.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d371f1ad403f9fb0fc4db53674fbc13e0e24f0e498ff3b8bb72ac420dc5e93"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleCursorContext (cyclomatic 32, cognitive 34): handleCursorContext has cyclomatic complexity 32 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a044ccb56624d9d4b3e6ea58d6ba5a13e159f88558dbfd3934f4772164daf76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function LLMNodeContent (cyclomatic 31, cognitive 28): LLMNodeContent has cyclomatic complexity 31 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5aec470a589c7b564227850b077fb56c680fc2426161b839d519ba2600f66b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testLargeStructure (cyclomatic 30, cognitive 33): testLargeStructure has cyclomatic complexity 30 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/edge_cases/typescript/index.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26f0ff86d7804dfb989c1c2c6d9af987c558bfd660ca7cdd5dd7a381667c9a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Tracker (cyclomatic 29, cognitive 28): Tracker has cyclomatic complexity 29 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/tracker.tsx"},"region":{"startLine":2254}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0dd3575142224de83834d1f45c998db2bbd7b7653ec6aed675c1cae2a27e27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ProfilePage (cyclomatic 29, cognitive 27): ProfilePage has cyclomatic complexity 29 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/profile/page.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"006c9e25f3e0d991ae1bdb0b52e00576d56565240a854a6eed3803991276037f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function layoutGraph (cyclomatic 28, cognitive 36): layoutGraph has cyclomatic complexity 28 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/graph/layout.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"8000b3e6c584bb1c23d3048b18ead1e9cd166e2fb2a8aa7e24ba3f4069d3042b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 28, cognitive 28): (anonymous) has cyclomatic complexity 28 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/react/src/components/network-timeline/index.tsx"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ecad7477f937c46cde2c2aa8bda964482356f2ce04518c317798ef1134a015d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function StandardNodeContent (cyclomatic 28, cognitive 25): StandardNodeContent has cyclomatic complexity 28 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"af87376c4cfb5f6d7c67c3cdcfac1cda3095c833a0b721acc2605787f8fb926b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deserializeValue (cyclomatic 28, cognitive 12): deserializeValue has cyclomatic complexity 28 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-proto/src/decode.ts"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e220f0d90ae6ce9670270bdd0ba9251267e7a92d78c8c380b8444a811c877e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyGeneratedRelease (cyclomatic 27, cognitive 44): verifyGeneratedRelease has cyclomatic complexity 27 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/generated-content/verify.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf987a67ccdbaa3b90dbe205023d5af2d53849a15475d37c881d5fb1898b3832"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SignupForm (cyclomatic 27, cognitive 23): SignupForm has cyclomatic complexity 27 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/eap/signup-form.tsx"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fddb636a1d076ec6e3e8e4edd79d1240fc5ca69d755d9a5cf452b2099c65f50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseXml (cyclomatic 26, cognitive 53): parseXml has cyclomatic complexity 26 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar/tests/kde-syntax.test.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53ed556ee352bbee6b262929de5d9cf06c0d32dd3dc5901b90fa40c90f00fb7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runnerPose (cyclomatic 26, cognitive 41): runnerPose has cyclomatic complexity 26 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/tracker.tsx"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4391c76b36d664f6627b781bf381c2762b7217ec68013c0b40dea378d3169fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 25): (anonymous) has cyclomatic complexity 26 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/graph/nodes/group-node.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"164b88deab226982677a21c1bb116e0ff1f758301459ddb53c3ffa436df96300"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SingleComment (cyclomatic 26, cognitive 24): SingleComment has cyclomatic complexity 26 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-thread.tsx"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f28ce3d17862231390145ccd1450c8cae3cac5d96b6faa96bb5d4fbec57da51"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PUT (cyclomatic 25, cognitive 35): PUT has cyclomatic complexity 25 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/beps/route.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cdb0105c198f5cde0741ae4ca8ecd5f52c8ef1b0ceb6d9a457e271cda4f8f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TestTreeNode (cyclomatic 25, cognitive 33): TestTreeNode has cyclomatic complexity 25 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/FunctionSidebar.tsx"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc9a9ddd4c269f7054e07c7bd87ed60288c83d0cfcb25786ac02abf472ff169"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 29): (anonymous) has cyclomatic complexity 25 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/panels/WebviewPanelHost.ts"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c736a5a7985891c18bb81f13ce2d195d65d2c302e75f241ec3e448bde42e81"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function knownValueEvidence (cyclomatic 25, cognitive 19): knownValueEvidence has cyclomatic complexity 25 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-widen-then-assert.ts"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3206212597029a5030f65ecc2dab13bcc81051f3f6ca50fa4801dc228edd9b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergePoints (cyclomatic 24, cognitive 54): mergePoints has cyclomatic complexity 24 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/smart-edge.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"458e8a0c5ee8e78bc462742ce32d109f9e4232d9daf90bc73d732497b6948434"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadExamples (cyclomatic 24, cognitive 52): loadExamples has cyclomatic complexity 24 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/control_flow/mermaid-sandbox/app/page.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa95c1716d0100cff5b18a73a94cc6312ad2692fb06ce3be784da355b03fd60c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 46): (anonymous) has cyclomatic complexity 24 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-import-dialog.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"160e709c3cd007c299b2484fe8604d81260452dca18bc4d853a814f9d7db3d56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 24, cognitive 35): POST has cyclomatic complexity 24 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/beps/route.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6abfc84383094dcd976e867caee180cb07a49f062f2845faba144ea43803fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handler (cyclomatic 24, cognitive 29): handler has cyclomatic complexity 24 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"78744121dde157dd23622868c82b5c01a4cf9606ab959ed0251405d8e498ce37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unsafeDirectValue (cyclomatic 24, cognitive 29): unsafeDirectValue has cyclomatic complexity 24 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba95c8126650555786c35c32303ba6f66f26e3e572261a3f5af48253ed4d2615"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testRecursiveComplexity (cyclomatic 24, cognitive 27): testRecursiveComplexity has cyclomatic complexity 24 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/mixed_complex_types/typescript/index.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e21ecfaa8569b20a0fe95ef391e4047295ac4610f7360463ab921455bcd24e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 22): (anonymous) has cyclomatic complexity 24 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":3449}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d13499428ed2282e14304ec1d751ba6a7178dddfb42c87c02ae52c27a52874"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ErrorCaptureView (cyclomatic 24, cognitive 22): ErrorCaptureView has cyclomatic complexity 24 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87150a41bb2e3267a23098a3300d38fce825874365e4a7b4437a8d692df8aa1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function defaultValue (cyclomatic 24, cognitive 18): defaultValue has cyclomatic complexity 24 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/args-form-model.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2735279e28543f361f8b09eefdaaf2cf2952e1065a88e25202363ed8afb959e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matches (cyclomatic 24, cognitive 13): matches has cyclomatic complexity 24 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/args-form-model.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2c381dca0193fc81c304314f4c31a12666b2ed75a91191bc036868add3731f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractMetadata (cyclomatic 23, cognitive 41): extractMetadata has cyclomatic complexity 23 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/components/MetadataBadges.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a3ef31f9eebb45032ed836daa2c1f4d40f6eb34e9feede36211afa3c3a36f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 27): (anonymous) has cyclomatic complexity 23 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/http.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"44282ef73c98941d1fafbfc5982823ca98a02622ae7dc090b45599cae9694be1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stageInfo (cyclomatic 23, cognitive 27): stageInfo has cyclomatic complexity 23 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/lib/pipeline.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5d8841da72f04e19157396644c42734a60c396cb269745cf902991542220c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FunctionSidebar (cyclomatic 23, cognitive 22): FunctionSidebar has cyclomatic complexity 23 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/FunctionSidebar.tsx"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"d815300c40dff5ae7f6e8b96830c3f55c89aeb5ce86f1fc326f6346003fec36d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toErrorCapture (cyclomatic 23, cognitive 22): toErrorCapture has cyclomatic complexity 23 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/evidence.ts"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"b072f6aa362803480b39bda7e39abbf0c4537eb57020f3a4a09abd68ffb0a036"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FeedCommentCard (cyclomatic 23, cognitive 20): FeedCommentCard has cyclomatic complexity 23 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed2589d1d9653a330369802e820907d34586091bfb28b4f8348ad97c4021a6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseWatchValue (cyclomatic 22, cognitive 48): parseWatchValue has cyclomatic complexity 22 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/__tests__/watch-notification-events.test.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"124c668c4cd889224ce7355d547993787df6f4c4324d539373f01ad96f6bed74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitPoints (cyclomatic 22, cognitive 34): splitPoints has cyclomatic complexity 22 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/smart-edge.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46b6f1a98c200c8e469bc76ea0a0341b7510ce1484c3839a89cc1e47a1b15dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 30): (anonymous) has cyclomatic complexity 22 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-editor/src/MonacoEditor.tsx"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc0f744da93b37a444a2578500d9a33fd2874c051ee2206badfa1df1c040841"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dictionaryValueTypes (cyclomatic 22, cognitive 26): dictionaryValueTypes has cyclomatic complexity 22 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20b0dfc81d41f18cc1c80565c0b2e3066f877daf6e1ec4ed1a3b6d486881215"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ChatMessage (cyclomatic 22, cognitive 22): ChatMessage has cyclomatic complexity 22 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/hyperobs.tsx"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b151548cdc73c21704f68e492a6716461617b9eff9a8748393f1a6d6acc789"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CapturedValueCard (cyclomatic 22, cognitive 21): CapturedValueCard has cyclomatic complexity 22 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/CapturedValueCard.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c595a79bfc93c0abf9bb62bc3f2f3230a9a57fea472c4cbaeeab9101444b0da4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FunctionTreeNode (cyclomatic 22, cognitive 21): FunctionTreeNode has cyclomatic complexity 22 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/FunctionSidebar.tsx"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12343de1c79c07f137ab309e1942176ea38ca6d515f7049d747824ddd6a3a36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function App (cyclomatic 22, cognitive 20): App has cyclomatic complexity 22 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-vscode-webview/src/App.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a6fa3572c9299d73be8575180907f3756786ae5249cda4b57e3693d19ad68a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visitModuleBody (cyclomatic 21, cognitive 41): visitModuleBody has cyclomatic complexity 21 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/stdlib-matrix/extractors/ts-surface.mjs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e689f57f6836ab1d133fd58c317b3c6b0877f28b04075ea2a4b85f13ee4971"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildNodesByFile (cyclomatic 21, cognitive 36): buildNodesByFile has cyclomatic complexity 21 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/debug-panel/components/DebugPanel.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d84aa612217939fda43a20009d9427a0194077f0d7371872caf8a6e5b0f5a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileValue (cyclomatic 21, cognitive 36): reconcileValue has cyclomatic complexity 21 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/args-form-model.ts"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d55054c4f63355c463705447fc9617634ebecab534509c86717bdfab9f122d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handler (cyclomatic 21, cognitive 34): handler has cyclomatic complexity 21 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/migrations.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d8902917ff1cae0c231de0eb43b52aaa8bf13604ac5ecb147f4d5a3e30b2c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyWideningTarget (cyclomatic 21, cognitive 26): classifyWideningTarget has cyclomatic complexity 21 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"85587515ce273c1906713b9ff5979dca9ee4d6b4d1acb251b634f04af3c585b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handler (cyclomatic 21, cognitive 23): handler has cyclomatic complexity 21 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a232b7ebf7a94e9cc522e247cfc69281ad6f1993c9c4c212d56c65f187500fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PreviewToolbar (cyclomatic 21, cognitive 19): PreviewToolbar has cyclomatic complexity 21 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/preview-toolbar.tsx"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"467ba844638c556dc183a0f6a3f41f2cf3de850d6e84690a10f79189962284b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SignupConfirmation (cyclomatic 21, cognitive 16): SignupConfirmation has cyclomatic complexity 21 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/eap/signup-form.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bdfe606456d0fa2651ac570c4ce79028569d2b1027b4c6d19a3cc5267909e58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 16): (anonymous) has cyclomatic complexity 21 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/magicui/deployment-status.tsx"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c539257fcd35c3a145ca78261315c9aef0987c074e83f3bfeb23cf56e54c885"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderRow (cyclomatic 21, cognitive 15): renderRow has cyclomatic complexity 21 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/components/ApiKeysDialog.tsx"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7506ed6836d1b54555527e5e0dfc4ff90518d876a0a77f2a41d552a0b4db8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildUnitNodesAndGroups (cyclomatic 20, cognitive 32): buildUnitNodesAndGroups has cyclomatic complexity 20 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/atoms-orch-graph.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7196ac959378bab64c72629b8da238816461c0776f35b930a51a88ef36c977"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildReferencePages (cyclomatic 20, cognitive 30): buildReferencePages has cyclomatic complexity 20 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/generated-content/package-generator.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac82e4df625d1bce7875c66914c4ad60512bb5341a1f221101e7087e40efc8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyAliasBroadTarget (cyclomatic 20, cognitive 24): classifyAliasBroadTarget has cyclomatic complexity 20 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fd6348dbd7bd6e1d11dd505bd76f805e197ec033745b4f60566f7b30848393"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 20, cognitive 23): POST has cyclomatic complexity 20 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/api/completion/route.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd58bc8f7c547516cee752988d4b01a5f21de4114e18548c04d85a3ca7b5770"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function GET (cyclomatic 20, cognitive 21): GET has cyclomatic complexity 20 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/beps/route.ts"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb5e7a7ed1abc246dc63ff0dc865cbb136b05f00047ed3504d7829d4b09225c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseBepSegments (cyclomatic 20, cognitive 21): parseBepSegments has cyclomatic complexity 20 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/bep-routes.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48675fb949199b9ffcd25cc4d8f474618651a0e48b18a55f185b884d5816072"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 20): (anonymous) has cyclomatic complexity 20 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/node/algorithms/elk-mermaid.ts"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2c2d181cdd6ede8e7b81db6828619d3c52b4426758e4b736ec99e225cb1a10"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testMixedOptionalNullable (cyclomatic 20, cognitive 19): testMixedOptionalNullable has cyclomatic complexity 20 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/optional_nullable/typescript/index.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04b29265c77865565ff15f51a0d73b877f3eedf99f8226b9cc1d48e8086e42d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BamlBar (cyclomatic 20, cognitive 18): BamlBar has cyclomatic complexity 20 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/tracker.tsx"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"59aad6d7a43471e0be21c37b6396839e9ac0788a8acd883e04afad30e01c5ae7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkPages (cyclomatic 19, cognitive 30): checkPages has cyclomatic complexity 19 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcs.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9e333e3b979621f6b244fe01f28e06e0a02de44e32f2c8994d9ea14b76e014"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleConfirmSubmit (cyclomatic 19, cognitive 30): handleConfirmSubmit has cyclomatic complexity 19 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-route-shell.tsx"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"239903d0cee447b2fcd65d7aa11111d654beb78f46356992efa036a3e94ecbd9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reparentToRetainedAncestors (cyclomatic 19, cognitive 26): reparentToRetainedAncestors has cyclomatic complexity 19 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/evidence.ts"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f05c27a4608a406c42dc970035d4668498e09463d859bc7dfdd4ffd4ce2677"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testUltraComplex (cyclomatic 19, cognitive 20): testUltraComplex has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/mixed_complex_types/typescript/index.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"214edbca83317d6e548ab96502a57ef2165a30e9b2406e66db803d2d856306a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function GET (cyclomatic 19, cognitive 20): GET has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/auth/github/callback/route.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f6af86fc1a67fa5bedb1842234f9725d9f1272c235a0b417ae29b7299f2f00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testDeeplyNested (cyclomatic 19, cognitive 18): testDeeplyNested has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/nested_structures/typescript/index.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfccf7e9095f9937a5f920c4c08f9ed06771b6b0fab263173bbc6c226654c125"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 18): (anonymous) has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/nodes/GroupNode/index.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f993338eb7cad3c33b8dd873591e004aaee42fdc8da997b21bfc705b6f6e0ffe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FeedThreadCard (cyclomatic 19, cognitive 18): FeedThreadCard has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d5f953727c4e53bc8be18694742a2815c43192c226cefca207d1af8e92282b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FieldInput (cyclomatic 19, cognitive 11): FieldInput has cyclomatic complexity 19 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ArgsForm.tsx"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3d9037a92a21355605c3d8274193f2daf83b8642a779d0c2ad49a7392fbdc3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 24): (anonymous) has cyclomatic complexity 18 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ai-assistant/ai-assistant-panel.tsx"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"16efdca76b23d0f420a0d5da0e8464b8cc435bbc447310ef7e4f537bb985118c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 18, cognitive 18): POST has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/beps/[number]/comments/reply/route.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"cacd1321462b36681b5e571b27513c43b8f67ec1cfaaa3e0780756f22428c1ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testSimpleMaps (cyclomatic 18, cognitive 17): testSimpleMaps has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/map_types/typescript/index.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f1498c23aa2a87659360efdc353573ed9009bdb09036abe9c7a24c27ca9ee5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testOptionalFields (cyclomatic 18, cognitive 17): testOptionalFields has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/optional_nullable/typescript/index.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf62785471e8aa386a51a4029fffeeaa34edb6ddaed91e979de3bf6e1c782f7c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testComplexUnions (cyclomatic 18, cognitive 17): testComplexUnions has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/union_types_extended/typescript/index.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c4cd8e337db8b5acd1639da24ae387f81cc2e8e605b81e0cbd8d00bea3f393"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TestResult (cyclomatic 18, cognitive 17): TestResult has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/components/CardView.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bec02bcf919208eb3866f4c58bf88d2fb03eb2e13fb0b3675d69b1c1a49fb25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BepNav (cyclomatic 18, cognitive 17): BepNav has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-nav.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"1559101acb0a3b1e6afdd3d5959299e04d9756e70ac9e49cde92c092b7310de5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function IssueDetail (cyclomatic 18, cognitive 17): IssueDetail has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/components/issues/issue-detail.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3edf65f9bfe54402287124db096d2a7a27e078867555b5efd6d6e1ebd55e6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testMixedPrimitives (cyclomatic 18, cognitive 16): testMixedPrimitives has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/primitive_types/typescript/index.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca10844fa76e08acda4ea0175963503869b1709e3b798607034a9d4344ff701"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function UnifiedPromptPreview (cyclomatic 18, cognitive 16): UnifiedPromptPreview has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/unified-prompt-preview.tsx"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e16a50eab974dff6209a5e31f020948eefe0c08375dd75ce56e6832be3f522"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function MDXMedia (cyclomatic 18, cognitive 16): MDXMedia has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/media.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"42dc19922577ced470abcefb797afe242419d171fd70bec39c54d47c1b45f129"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function IssueCard (cyclomatic 18, cognitive 15): IssueCard has cyclomatic complexity 18 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/issues/issue-card.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2fc989548b0ad93c4802611236c4bea554bbafb056ccf36411c3f942f45301"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isBroadRecordType (cyclomatic 18, cognitive 13): isBroadRecordType has cyclomatic complexity 18 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-widen-then-assert.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0580c03ab3cbc59d7d9f5f3450ce916d40a4b94f45bb740fd9d89edfb3229cc2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadRuns (cyclomatic 17, cognitive 46): loadRuns has cyclomatic complexity 17 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/api-server.mjs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9a22d1bb918055e83fc2045a8db38c3b33fa023eb319ca189a9c932f8b4522"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function simulateExecution (cyclomatic 17, cognitive 35): simulateExecution has cyclomatic complexity 17 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/runtime/simulator.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33cb71f3c05c9386c195a659bd4bed3e0d5ec813f757fc24716fb6c3e69990b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRegistrationAnswers (cyclomatic 17, cognitive 31): readRegistrationAnswers has cyclomatic complexity 17 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/luma-answers.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5289926855da6c16793cad45d6213eb684f2b4a44a9e756ac7f889212c2e125e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleSubmit (cyclomatic 17, cognitive 25): handleSubmit has cyclomatic complexity 17 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/react/src/components/test-client/hooks/useFormSubmission.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"603970f61e8c45a498351bdf13d9cea702cb49ee73b094a2c9b9c9c2076926d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PdfViewer (cyclomatic 17, cognitive 22): PdfViewer has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/pdf-viewer.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d1430bc03d129c20da8b9433d8a608830a75e000de6c47a76c98e0839265ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyLevelOfDetail (cyclomatic 17, cognitive 22): applyLevelOfDetail has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/graph/lod.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0fa6a675e151eb9c29735ed048165a1fbcf364d314b8ab2a3a043c89cffb2c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onMessage (cyclomatic 17, cognitive 20): onMessage has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/frame.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f7cbdf6e487dc6830ce33b5c396c631ed781950302b394cd3c37b636fa865c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 19): (anonymous) has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/bcs-render.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc71d34b8a26629d975cf3b42bf951747cc7d2a106730935814d1be8f190ad65"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 17): (anonymous) has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/function-item.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2294f195afdcae8b0b1beb19c2fbd8d3f6584c6a7fcc93e38bf9d6baccecbdbd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testNumberEdgeCases (cyclomatic 17, cognitive 16): testNumberEdgeCases has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/edge_cases/typescript/index.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"61636baf516992198af6109d88fffb40662715df0bacf27e887237044e13a46e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testNullableTypes (cyclomatic 17, cognitive 16): testNullableTypes has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/optional_nullable/typescript/index.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6aded245de78a9e711ab16e25c82b7dc6125a5ac082b3c9a29da6518f26fdb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verify (cyclomatic 17, cognitive 16): verify has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/bcs-auth.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"15659276bebeebbd9e188797dca3e8d35aa707c7fba14426781bdb8ddeb2776d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ContextTreeRows (cyclomatic 17, cognitive 16): ContextTreeRows has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":2985}}}],"partialFingerprints":{"codehealthFindingId/v1":"db21432bf381a8ab0f56e579237f9a46ce5588b4a84a76143900ecae153cf2fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Question (cyclomatic 17, cognitive 14): Question has cyclomatic complexity 17 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-type-quiz/src/app.tsx"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"741c9dc0a67bbbd22d7531ef19997f097bdccdc94e689961f1aa3285c52174b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 12): (anonymous) has cyclomatic complexity 17 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/chart.tsx"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69fccaaf487856480c94222da983c79a09bd078a01f7dcbabfaa190195a9c89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function EpisodePage (cyclomatic 17, cognitive 12): EpisodePage has cyclomatic complexity 17 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/podcast/[slug]/page.tsx"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"3faf1cc0a2fc6ae5530a9492e17b0239fb9339c441fc6807adb188844f6a49cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildGroups (cyclomatic 16, cognitive 29): buildGroups has cyclomatic complexity 16 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-stdlib-matrix/src/types.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a54254bbae5a1b9b47b14028304b25a6f4492da7a5c35e3e6807c3568240c7a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listEvents (cyclomatic 16, cognitive 23): listEvents has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/jobs/fetch-luma-eap.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"930c872c98eb623e15f061d4d7e95ea0e1be107355087c9a2729070e1574e193"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lumaEvents (cyclomatic 16, cognitive 22): lumaEvents has cyclomatic complexity 16 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/scripts/fetch-zoom-six-weeks.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d35672ac352fd68a79b9d6f68ed0afe7fedffb578b74f1ebc0d8df553f016d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 21): (anonymous) has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar/scripts/emit-sublime.ts"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"a421d0ce0fc287bb7b778861803d6341a702d010520e0885ee3145b083365464"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 20): (anonymous) has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/plugins/language-server-client/index.ts"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c888e88d7442d210d812428a65205e73e66493d0acdafd36d109257a54c0cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function awaitRunCompletion (cyclomatic 16, cognitive 20): awaitRunCompletion has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/run-await.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e036fd558c5cfd79b03c28b17335c7672f46126b2d2ce8f959feb75e6f378d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleSelectionChange (cyclomatic 16, cognitive 17): handleSelectionChange has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-sidebar.tsx"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"d984373c572384a1b4e2cb28037f5c9cd6029d5006cc82650f8679003c030277"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postMessage (cyclomatic 16, cognitive 16): postMessage has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ports/WebSocketRuntimePort.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b0898be1b3ddae1a9b6a8c20205ba6900d785846692b43aeebde1d7ad2ea8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testComplexNested (cyclomatic 16, cognitive 15): testComplexNested has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/nested_structures/typescript/index.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7c2510a52b927e322c041f5c6591aeac8265bfc35c7f78d39adeb025409d6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 15): (anonymous) has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/src/App.tsx"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f9d3f124179c41a0e80a44630efe1b0b362f65d65da2771f59e5e980a0c990"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 15): (anonymous) has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/adopt/architecture.tsx"},"region":{"startLine":1813}}}],"partialFingerprints":{"codehealthFindingId/v1":"f490e5d306b04fef06fc6be46658a6dff62ef770f266e9c83bf2ee214587c0ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decode (cyclomatic 16, cognitive 14): decode has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/programs/agent-loop-300/main.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d289425814b11a6507095fba28ce2d45dbe1975b7b3940430034b335b823ea2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TestItem (cyclomatic 16, cognitive 12): TestItem has cyclomatic complexity 16 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/test-item.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc39791e9c343b022f1aedfb596cdf0d5daf9089cb9097fbfa215a32ddad395"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runOne (cyclomatic 15, cognitive 26): runOne has cyclomatic complexity 15 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_lib/runtime.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d76caa99d765d731d2ee021a9a1c3385c0bc77b7e16b3e101bb64265a24dd9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenize (cyclomatic 15, cognitive 25): tokenize has cyclomatic complexity 15 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-stdlib-matrix/src/navigation.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f52f4d7c7277db049d3b474c80bf3e68c1ddda3ab42ac6f9694e21834f4bf46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readValue (cyclomatic 15, cognitive 22): readValue has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/programs/json-parser-15/main.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0427e2b9dbca3d9e1c5d1a1beee532d8422b3454f763228618c35f35e444602"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handler (cyclomatic 15, cognitive 19): handler has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/export.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de7227a5690941794dad8118a2fa3a6801714820fd4b947d4bc7c82ba897b49"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PromptPreviewContent (cyclomatic 15, cognitive 18): PromptPreviewContent has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/prompt-preview-content.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dcf919109a782d1aa2715f49777a430ce5a37324674332e25e3721a75a148db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function upsertGitHubUser (cyclomatic 15, cognitive 18): upsertGitHubUser has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/users.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"304e7aa65c3202d37ad6d1ab4ca49f422cbde803f5bd4ffc43d39102b01425f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 17): (anonymous) has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/rehype-preserve-code-props.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"179d1a5390baff8a7161c3cce2ab34d09050c7ee48d5b300a3a6970775074ed2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function GET (cyclomatic 15, cognitive 16): GET has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/beps/[number]/comments/route.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc52274a4e39983929089462d5167fee78b01595d8618b3e978e16cfa3a0e0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testComplexMaps (cyclomatic 15, cognitive 14): testComplexMaps has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/map_types/typescript/index.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc95af1dcf2740bfd293ad68fdc34935d671d24b83ceadd6ce7802882dd99de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasKnownCallArgumentEvidence (cyclomatic 15, cognitive 14): hasKnownCallArgumentEvidence has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-known-value-widening.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8d21edeba4b3b7858721a29db14b1e4b10a96d35ccd5cb024c56ed33d21ecc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handler (cyclomatic 15, cognitive 14): handler has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/bamlcodeFeedback.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"8256e480fadc5067eb96834affc24fb1cb785a82160a3d5deba7a5bb8e86537e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TreeNode (cyclomatic 15, cognitive 14): TreeNode has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ValueRenderer.tsx"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"096cac5d6bcb77bec54c8adfb3c64c1c6c0c1b0326d5111a5c5579d693d875d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 13): (anonymous) has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/components/TabularView.tsx"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9b6b992915088031cf2379638f19595415f56d7555e3bbd90e40a0b91592ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AIAssistantPanel (cyclomatic 15, cognitive 13): AIAssistantPanel has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ai-assistant/ai-assistant-panel.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65f49b4afd33ab5dd9704150e1674b1313e8d321504824bff4db7b3a5ea7450"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isBroadMappedKey (cyclomatic 15, cognitive 13): isBroadMappedKey has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf48bbe9e7ddc6fcdd4dbbcfa4b46122dfe1e8ff487f0b05e0182846450ba5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DocCard (cyclomatic 15, cognitive 13): DocCard has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_components/baml-reference.tsx"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b483514584f6b0f585d26a52cb2193767df218fcf5a0c9bb6d9ebe11cbf6ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function GraphViewInner (cyclomatic 15, cognitive 13): GraphViewInner has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/graph/GraphView.tsx"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a215f60b5d1858c80536cec27d929ba960770e7e279cb703cf50be88a610f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderMediaContent (cyclomatic 15, cognitive 12): renderMediaContent has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b8fa331fd1a9631f5101b4ff1dd0ad985d11123056e1b3d715b848c913ab53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 12): (anonymous) has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":2447}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8dfe2f13172058af3881dda2dabce5f0969498584be1cafc78abf85853f2d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 11): (anonymous) has cyclomatic complexity 15 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/custom/date-picker-input.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"680ccb80d809107160a12622b8574915e05996ed3481fbf559af230ee18bcf37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ScenePlayer (cyclomatic 15, cognitive 11): ScenePlayer has cyclomatic complexity 15 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/scene-player.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eac9e8c972cea27047b4fb5450fc25ae0ee9e2f445ea7e15c6a6fe67fe81c84"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BcsReader (cyclomatic 15, cognitive 10): BcsReader has cyclomatic complexity 15 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/reader.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f570ecaf5c9861443aff791e0d9f4e41f2cffcf1391506166ff9f536262d5e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 10): (anonymous) has cyclomatic complexity 15 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-sidebar.tsx"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"e363c7d74f839cc79791f424fc9e8ae6cd66edb256508428860291900fb07450"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function path (cyclomatic 14, cognitive 24): path has cyclomatic complexity 14 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/json-tree-path/main.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6200b4a4bb2c8b426886e5c411da81f8a0937388cff69e26e0d90f5855b81a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateClaudeMd (cyclomatic 14, cognitive 23): generateClaudeMd has cyclomatic complexity 14 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/export-all-utils.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91b1d9a4edeb2757fdd25607011036106e7054ca3aff21a420d3f4a7556c033"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 22): (anonymous) has cyclomatic complexity 14 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/edge/algorithms/a-star.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4cd6eb49b781036198ebc3470aea33d515fb527700cf349ca718cc29638104a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveCliPath (cyclomatic 14, cognitive 17): resolveCliPath has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/plugins/language-server-client/cli-downloader/index.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f96b26b3273ba661ade0792a6b35083591661bb333811ff69b1a0cc8f52df8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getBAMLFiles (cyclomatic 14, cognitive 17): getBAMLFiles has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/runtime/BamlRuntime.ts"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8a9cdd817cbb871b3c77c5572562b5874bc8b35b4ef02e978a29835b3730db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 17): (anonymous) has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar/preview/main.ts"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"88be25dc3e10535b09e4fdc6a30608b3c8585cec7dd669335690fbc059c60b06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 17): (anonymous) has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar/vite.config.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b2e579cc8f8d14a105567be569c220de3a269192f9d7d7397139251cb364d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatValue (cyclomatic 14, cognitive 17): formatValue has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/shared/format-value.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b51e977c04d00e3d7d56e5f1e906a1bbe660c7d2e8d343d1321f92d68696db9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleWorkspaceCommand (cyclomatic 14, cognitive 16): handleWorkspaceCommand has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/baml_wasm_web/message-handlers.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3b69e91aecb1ae8a66f25855d79809b5b77dbc9ef859ed4f795fca89511564"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadPersistedFiles (cyclomatic 14, cognitive 16): loadPersistedFiles has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/PlaygroundProvider.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc32b4c9fc34d17c53b791d435635b91bb7733c6b11b8b5163ff1d2fe971ed7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pages (cyclomatic 14, cognitive 14): pages has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/bcs/shared.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0ebeedd95e235cd97dc8bc6b8ed24d430dc610079d2e12149d4a74c1c49b69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testNestedMaps (cyclomatic 14, cognitive 13): testNestedMaps has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/map_types/typescript/index.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"9535ade265763696c640d29dab46ff6c6f52ed8fcc481dbc171bca36283321a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function VersionAnalysisStatus (cyclomatic 14, cognitive 13): VersionAnalysisStatus has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ai-assistant/version-analysis-status.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7355c328a388a787686874f17a3c95cbd1ddc4561a492d4c63ad8eacd97a7761"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BepList (cyclomatic 14, cognitive 13): BepList has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-list.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d6429f66735ad1e80761e94e9c53869a6712d0906c682041ea2265502c2379"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 14, cognitive 13): main has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/scripts/populate-generated-content.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed1244f5e6f1453db36e1c208cadb8603cb864f02a12dd3e601885475227e6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureDashboardOnce (cyclomatic 14, cognitive 13): captureDashboardOnce has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/jobs/send-slack-report.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"304a2a6fa15d196b7a183d733314cff9c5d525af84c25fb2f37edf8b15219cc3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/eap/signup-form.tsx"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6863d4113403d02c346c2babda83be45fb75ede57bb1d8345a502c7c250b25"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/hyperobs.tsx"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a6896d72e3787e8cf26718b0960180955bb0434cbb20f5f3cb159e205fec29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7970903a3205aca0c4718de7e9e151b10aa7a2b51630ecfb9e9a5e0e025533"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":2974}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8abec3307ed05fd03742415ae0287424b77428f409a796006b16ad6c67c77e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 12): (anonymous) has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-nav.tsx"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2dd76e99fef489e533eb0df222d192f919eacbfd200697cd2d1a351448e39db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CommentThread (cyclomatic 14, cognitive 12): CommentThread has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-thread.tsx"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"2546ccbdc3885c63384a2521435bc6422aca14a82af1140639aad2eb04b95356"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ExecutionRowView (cyclomatic 14, cognitive 12): ExecutionRowView has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5cc9801d8afbdab64f1434ea7a1efd224967a2aa1a6379e493b85e9b625c5c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function widenedBinding (cyclomatic 14, cognitive 10): widenedBinding has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-widen-then-assert.ts"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f804b550a30bad4d172492aa324cac81ef9780438164b94fc91e4a28fc3c504"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CommentSidebar (cyclomatic 14, cognitive 9): CommentSidebar has cyclomatic complexity 14 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-sidebar.tsx"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40854b88193023bdb8ecb9d2b800ca68a22e97018b6073c0fb45138f0a35bc3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderYaml (cyclomatic 13, cognitive 32): renderYaml has cyclomatic complexity 13 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar/scripts/emit-sublime.ts"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf742f4fd046ae03b88fffb35a8d6529f1cc798a5548d2ad80adc957fffbec52"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 24): (anonymous) has cyclomatic complexity 13 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/node/algorithms/elk-geometry.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea065089bf3785652273eabe77003dc409424d6a6da57cf384594cd92d1f1f43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyChanges (cyclomatic 13, cognitive 20): applyChanges has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcs.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"87123d3864086221fe4a7a0d515675a0bee274fe521f336741ec7700651b2664"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listEvents (cyclomatic 13, cognitive 19): listEvents has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/clients/luma.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24ea1995477f95053554b229d32fba64e72fc1b8b9319ddc91796b6e2db7bf5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 18): (anonymous) has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/graph/layout.ts"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"14fe9b97a3edf45b0b25d4265102c87fa28dc03fac05e1ae565959e16c65377c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toRust (cyclomatic 13, cognitive 17): toRust has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/renderers/HttpRequestCurl.tsx"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfae80f0b5d26d323a9b50f30995d0e703b2ce3af3d2b8484e5e4f33277ff26c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadJudge (cyclomatic 13, cognitive 15): loadJudge has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-type-quiz/src/judge.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e358a7c1411e88205d93180bfc4d3996bceb71632e4f0baf8f25bc3fdffda87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 13, cognitive 15): visit has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/shared/media-values.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c51f56f7313d21af8607c146bf6a6379e23ff651b890048be734fb0f394ae06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Council (cyclomatic 13, cognitive 13): Council has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/sheep-council/council-gate.tsx"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecca872a6de96d572691098429b6aa2ab7e28b4a6b03468f33d855462e9e2cfd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readStoredEnvVars (cyclomatic 13, cognitive 13): readStoredEnvVars has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/session-store.ts"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e1433ff236ff8db9796adc2e62e009f2351489ab0136c66bfa2c4148553b3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testSimpleArrays (cyclomatic 13, cognitive 12): testSimpleArrays has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/array_types/typescript/index.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"0563c5d1a994839683bec99e26bfcd2209d6a6520f67c2e73677373209896fe6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/nodes/BaseNode/index.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bac597bc4d0d457e5744a57881aaa2eca68a4e736906d23d96f757380055b37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyUser (cyclomatic 13, cognitive 12): verifyUser has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/beps-user.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6b4ea89cfd242b73127ee6080ecdd264eeccb4c7856b9bf70691542e1a20f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Media (cyclomatic 13, cognitive 12): Media has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/stack.tsx"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"08bd6f5066b5b3f4dd81233ca2e767069a701b38e6b4571e78c7db76ad9ace64"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/tracker.tsx"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a674af1cf5b9c3e69c82dab2ed5aae8c40f256c89c4b6534d21a04c5454c3d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ApiKeyListItem (cyclomatic 13, cognitive 11): ApiKeyListItem has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/components/api-keys-dialog/api-key-list-item.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c044cfde0ce9700cf00800f5bccf101273c46b681291b34b3e492a6b49e6b1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildEvidence (cyclomatic 13, cognitive 11): buildEvidence has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/evidence.ts"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"351a0426331f6b73235bffae45116e79fca4e7fe5cbc4e630861041479e4b441"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function WebviewMedia (cyclomatic 13, cognitive 10): WebviewMedia has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a9efce66596358420d7bbd3e59af9e37b888958086256ddc5c6f4dd4f3cf77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function EmbedComponentInner (cyclomatic 13, cognitive 9): EmbedComponentInner has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/embed/clientwrapper.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0683ab8c00e2def595e3a6e7f17807f65adc48ddd2eb94608a856c29af9f77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 26): (anonymous) has cyclomatic complexity 12 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/plugins/language-server-client/index.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc91cbccc53180166076405ddb3012de798815f05f1a3ed3ac237c66e9eebb2b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadDistinctGithubIssueAuthors (cyclomatic 12, cognitive 21): loadDistinctGithubIssueAuthors has cyclomatic complexity 12 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/clients/github.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1d5dea7bf5191e5537dcb676bc480347a8cd95345df0088d9ba534dd86e26f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMetadata (cyclomatic 12, cognitive 20): parseMetadata has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/snippets/parser.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9a1be2e0092b9e8211934f9b6811dcd0b90d5afef6e4cd3fa9d64546c85060"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectLongestWorkflowFunctionName (cyclomatic 12, cognitive 19): selectLongestWorkflowFunctionName has cyclomatic complexity 12 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/default-function-selection.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02bff87f4b7ab3408fd81e833ecda4bce057af27da44aa0f9e96fbe06f3e116"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateBepReadme (cyclomatic 12, cognitive 17): generateBepReadme has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/export-all-utils.ts"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69167c8ccd2fd3b8712523de1d13b541b4eeb6dd4b361e8b856a66495346505"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getEapEvents (cyclomatic 12, cognitive 17): getEapEvents has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/luma.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9ed9d3a6ae55ee000084fe5f4e998b59547beea0e1decd144e2639937d5951"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildFunctionSidebarTree (cyclomatic 12, cognitive 17): buildFunctionSidebarTree has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/function-sidebar-tree.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6fa331d924d0b2b318681f5a79584ccb1cc46335fb0caa1222f31b78a467b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findTests (cyclomatic 12, cognitive 16): findTests has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/navigation/target-enricher.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb61a8d99c7bf0031b8319be16967e77278c3ff5a0fb625f0f00dd118f43bc6b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function liftGroupValuePreviews (cyclomatic 12, cognitive 16): liftGroupValuePreviews has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/graph/value-previews.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d48c4f8ec2885f6e98e2ece2a07e0e734e7f2543a20db03571785dbea2e41a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 15): (anonymous) has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/sdk.ts"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6756f4d02b402867d7883e4e7a75e4d3a1682dcb9a3ff0b70520e673ad4e8de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getMediaIndicator (cyclomatic 12, cognitive 15): getMediaIndicator has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/collapsible-message.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ffde90de4fcb94e8bea289f82c9a17cfe2fbf63fb811b4e97f43945592fca8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleNavigateToComment (cyclomatic 12, cognitive 15): handleNavigateToComment has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-route-shell.tsx"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30120b4d16692b2b6a4cc8dcbbce18fa66da5568f332515102e17d3e39cf5d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toCurl (cyclomatic 12, cognitive 15): toCurl has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/renderers/HttpRequestCurl.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3540f98309e51f8a8b33737b0e2704e21f7de361d19045d7f50ce5bd9577fdc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 14): (anonymous) has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/node/algorithms/elk-mermaid.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"7841efaf173901d0dcd3f6daefdb58d8358d8f5dc4d52fc5e5d9b45e04a7f545"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 14): (anonymous) has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar/tests/kde-syntax.test.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"234a6a3be76eae201bc346c16cd05390269258eac661958721fa4221539900f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toPythonRequests (cyclomatic 12, cognitive 14): toPythonRequests has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/renderers/HttpRequestCurl.tsx"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"269dc06d4e43991815357946fbdb52c6e622e51a4abf4fbe77d62e7606fc3902"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 13): (anonymous) has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/runtime/BamlRuntime.ts"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"50924d5a2c15b5612e582597945a56d870cca1f4e56b4d7b718ad6365317aaea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizedNamedExports (cyclomatic 12, cognitive 12): normalizedNamedExports has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/typescript/bridge_typescript_web/scripts/sync-wasm-declarations.mjs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d8e8adfe92a2a68189a6397b18d57d06c053ce180e1c5e40fe09b4eb569b98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function GeneratedReferenceContent (cyclomatic 12, cognitive 12): GeneratedReferenceContent has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/components/generated-reference.tsx"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aae471ea20a46515ca2ef4a1d7e85d31884555a8c7dd046d61dfaa067c7003b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SessionQuestion (cyclomatic 12, cognitive 12): SessionQuestion has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/eap/session-questions.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5424ee58df710065c852eddc76166bbd36885981824ce211ea116ac40439858"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generatePost (cyclomatic 12, cognitive 12): generatePost has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/scripts/new-post.ts"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"a569ff972fa709d1f6da9fab9bfc229d35fa26e6fb3fa5c4c97b3582f9db4079"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":2108}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda1af86281cf2eb32a7278423349ee39a5a45e6284e8c51f5a7387737d8cbdc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toGo (cyclomatic 12, cognitive 12): toGo has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/renderers/HttpRequestCurl.tsx"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"4677dfa771b48f677f009650902bc6a00cd36ecb31d681b4fc4d2eed919046fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testEmptyCollections (cyclomatic 12, cognitive 11): testEmptyCollections has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/edge_cases/typescript/index.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3d825ec7e1c0d643e27725a60c58e09f2b7d5ee6b1eff5cb4d076229ba0fc9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FunctionItem (cyclomatic 12, cognitive 11): FunctionItem has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/function-item.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a60f40aae6747728a662b2c132e8d8c6e9eb03f6d4ef955d0228d872cc37fa6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getPayloadConfigFromPayload (cyclomatic 12, cognitive 11): getPayloadConfigFromPayload has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/chart.tsx"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba2052b30fb7af9445c9b6fc6268cae4090f5e0957325f9f52c83fe10392cf1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handler (cyclomatic 12, cognitive 11): handler has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcs.ts"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"82816a5eb724e50c0cc44b3e189c877708a5f3af5c043d58e86becdf90e1d68a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 12, cognitive 11): POST has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/bcs/route.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7355741c864bbf5426a09be42185801bf0d8b9a07e8a6fc62da1d24073cbbaa4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BcsBoard (cyclomatic 12, cognitive 11): BcsBoard has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/board.tsx"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f885b80912214617612e659d137cc1ff68d85a65ddd21e3617aed9c3e139d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function UsersPage (cyclomatic 12, cognitive 11): UsersPage has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/users/page.tsx"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"263cebe2fe518b956597e6dc40ba618411227e62d857d38c6499499f883d663a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function localFunctionForCall (cyclomatic 12, cognitive 11): localFunctionForCall has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-known-value-widening.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e17bc58f295026f65cb9a6ffaa70107cfb2211e9721ae4955ba6d690887889e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 12, cognitive 11): render has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-stdlib-matrix/src/components/matrix-symbol.ts"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4c2159fac4fc7c947f8295ae5e19677aca28a61f8553bb095760f1e5f69641"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Reveal (cyclomatic 12, cognitive 11): Reveal has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-type-quiz/src/app.tsx"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5802eadec5b74c2c93f44f265ec4d7ab013c0a039af5af5bb4e971dd004ba89"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function asAnswer (cyclomatic 12, cognitive 11): asAnswer has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-type-quiz/src/saves.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f48dd0b5b9ce796eec6d695b8e4361d16d604f6a1525a2173bf95a789e26b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Workbench (cyclomatic 12, cognitive 11): Workbench has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_components/Workbench.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"5473ac3e37873e8fe842121c34459ac3ee63c96ee7087e9f25a4e155b990ca77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/code.tsx"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f69b2ee29b7cd480f425cc920d5c307b5c30f51d606abacf2365dde4f595e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Side (cyclomatic 12, cognitive 11): Side has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/stack.tsx"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc6c08243e5a5445b93a28802343c0ce0342b0878742ed5e8e6e894842f02b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddf251b82353853a84c20f2cf1650885af108ff325f7418c0df40c55f0ab199"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":3039}}}],"partialFingerprints":{"codehealthFindingId/v1":"9758f769203cb2659f88384a971ee92523eeeb7922ab9896002441691ddb58dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":3548}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ce08b044dbc32b1cecc85b58042ca21f3e1608f7fd16ff5ad505fc371c3870"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/graph/GraphView.tsx"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9ea690d89bf153f178eb249b8159c5aa00be45a92b754a9f4ba63ba2a4b7f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function panToNodeIfNeeded (cyclomatic 12, cognitive 10): panToNodeIfNeeded has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/utils/cameraPan.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92f4d3f4655698baeed000cc59a363043e0092bd170bd6e3b6d9d6db49343de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function moduleMockCall (cyclomatic 12, cognitive 10): moduleMockCall has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-module-mocking.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce50774a65286df9bd6b2f2945748744aea367001284341f6b45c8cf435aaaba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 10): (anonymous) has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/graph/nodes/BaseNode.tsx"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"266825adc22a8a88126a3416bc7cb77ded4f146eaa1e781f0d261088958166a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rootResultToGraphValue (cyclomatic 12, cognitive 10): rootResultToGraphValue has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/run-store-projections.ts"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"62343371379700fb3de6d4d4fd83d220f0a19a62ae15315e7d57d31df494fcd2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splay (cyclomatic 11, cognitive 26): splay has cyclomatic complexity 11 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/memory/splay-2k/main.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10e66690d3f5b74e2d13bbf50804a7906ecd1fbf47b4c36b03c1a1679712cd2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 25): (anonymous) has cyclomatic complexity 11 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/edge/algorithms/simple.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"596dd6b7adee3ef0871495bce67738d4b9ee7e8a5a9388f780a289cf68c3b3ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 24): (anonymous) has cyclomatic complexity 11 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tests/authored-content.test.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"172f7a0d14d809fd43c55bfed75117bcbc408042b8b75a6d321cffd0bc8065bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 23): (anonymous) has cyclomatic complexity 11 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_components/Tree/FileViewer.tsx"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b01636474d8f30ea8598b12869c9948c2653b9220d8180c604a12ffe1b1299"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateSummariesMd (cyclomatic 11, cognitive 22): generateSummariesMd has cyclomatic complexity 11 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/export-utils.ts"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4e46647698d2168eedff289a394c79d24be8af65e020e2368d857c37864f4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseBamlSource (cyclomatic 11, cognitive 20): parseBamlSource has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/snippets/parser.ts"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c068615c5441d33a71041f3feec2a278c0fd2fe604e8dbe8268d5e88c8cf0dfa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseErrorValue (cyclomatic 11, cognitive 20): parseErrorValue has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/evidence.ts"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"86691758c00138854d352cf41d1c64f48fb11dc7a67f673e40bb1b59b3a0f68f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 19): (anonymous) has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/typescript/tests/input-output.test.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9a3156d851755b5556b9e192ac4a40c4a074684afdf63b2d21672ae522f8e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function searchSymbols (cyclomatic 11, cognitive 19): searchSymbols has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/baml-docs/index.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f32bdc601236890af7cc667882b011f78e3eca49ec030be01ca835d9447986"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pathFromPoints (cyclomatic 11, cognitive 19): pathFromPoints has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/graph/edges/BaseEdge.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec5e9b1798ecc6f8950af8eaaa5dab7402312ed4df1b9c93660a738c59c1501"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 17): (anonymous) has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/plugins/language-server-client/index.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6823ef615995e8f2d8aeffa9cdb631e10fedc5e5044f814ef795f2e12ac654"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractHeadings (cyclomatic 11, cognitive 17): extractHeadings has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/heading-utils.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"96556dbbcb2fe03a81347c2b37d2462f8247218555b0d508ebe76dc35bc0b04a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fromPages (cyclomatic 11, cognitive 17): fromPages has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/scripts/refresh-podcast-views.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29eb05e15b3c1ffee09f2b0360622b4f3f84c5cd7dd68b21a2d6cca8bf6581a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 16): (anonymous) has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/mock-data/convert.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd2cdcba3110d2c598eac5668e0fd0b56a69e38ba52d98455ce7ae2c470460d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildTransaction (cyclomatic 11, cognitive 15): buildTransaction has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/navigation/state-manager.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f046355f90679c38666199c38992afc3da49d453c367268cd3a84461264752ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 15): (anonymous) has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/comments.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"de19863c598f89af78d321d3ac28ba369fc16ae6287eef94edc30a87601b69d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function lexicalTypeParameterNames (cyclomatic 11, cognitive 15): lexicalTypeParameterNames has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/lexical-type-parameters.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30f0438d7daeb60d264f306166d0e18a5b11569b24b17f2e23c084d9b8bd0e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 15): (anonymous) has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/playground/vfs.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6f95b8770303cbab801bf7ceec1145bdfbdd8f96704d99493d0ee0a64829d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 14): (anonymous) has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_components/ProjectView.tsx"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad775abba56bf5c698959bcb0ffc50b0272f7580bf1fd4d1421b16b4e9c31fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getNotificationLabel (cyclomatic 11, cognitive 14): getNotificationLabel has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/utils/notifications.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab38c0a11462b1602d842d10d790c0dc62dd5e50afe629b54b7c71740579667f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handler (cyclomatic 11, cognitive 13): handler has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcs.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32440facc07b0d138b10bc1a31fd5667ea28796fced030c7e9603c42cc077ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-route-shell.tsx"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1ed167db682b0000da5f8d9e51c8c7c51f25b4e72488ed285235d50abfa2ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_lib/runtime.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c9bd1afe4b93cdaa8930248806a4f9009f780d2d9cbc3a2ac205c144479e4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 13): (anonymous) has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":1867}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d24a77f8d27efcaeb1cd968e03fa63465d2278ee75165e46cff6884f82c4e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildAIAssistantPrompt (cyclomatic 11, cognitive 12): buildAIAssistantPrompt has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/lib/prompts.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ea57256c560907fc356128c9f0a6bbbfb94a2e3fc3e3971475962e916dd355"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderAnnotatedSnippet (cyclomatic 11, cognitive 12): renderAnnotatedSnippet has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/snippets/annotation-svg.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e25a9ededdd4e39533656acc07084bd5a2d892083ab8def6bb1e88b1b16fbc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleControlFlowGraphResult (cyclomatic 11, cognitive 12): handleControlFlowGraphResult has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff06fa33637170120ec852a8472cb4b6128f23d8303399d433e0a8f239171d34"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveGraphTheme (cyclomatic 11, cognitive 12): resolveGraphTheme has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/graph/theme.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5795e65d2bcdee5e06e6fecf785716a50632f1ceadb49bd27f49cdd756329f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function webFetch (cyclomatic 11, cognitive 11): webFetch has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/typescript/bridge_typescript_web/typescript_src/native.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"1015b6792485c71b8a3826fd6a20c8e79107330b30cd1d8c9f41d39e507e5a18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolve (cyclomatic 11, cognitive 11): resolve has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/navigation/rules.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"091678766c270a319bf715af42c97580de6f86cdc5cf8d62def6674983054062"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeTests (cyclomatic 11, cognitive 11): executeTests has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/runtime/BamlRuntime.ts"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5f11981a4c7927cf754334ca328f0eef68d184ada7bb35763796aa3e1b55d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handler (cyclomatic 11, cognitive 11): handler has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsTracking.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5be97db4e0cf2ead33d9ecf807a20a5c75f3cb56900f118282d1fedf1ce350f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildBepPath (cyclomatic 11, cognitive 11): buildBepPath has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/bep-routes.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c42b5a6676acf496f12be74d158190776fb72924a26ef35888d00fb784c8e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/snippets/annotation-svg.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc41312461ad415723a2deaf5e535dd51e1f421c09661984e1a7a91d384a7c3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function releaseControlValue (cyclomatic 11, cognitive 10): releaseControlValue has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/typescript/bridge_typescript_web/typescript_src/native.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"2850b13715e6100a46c30d0b1c5a63e5e018c227a9c77fe46f0d671fd7dbb32b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testLargeMaps (cyclomatic 11, cognitive 10): testLargeMaps has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/map_types/typescript/index.ts"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a706826077249f5d28e68d5f33a797b8e177048f41b5c1c2a9e370680377158"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function testPrimitiveUnions (cyclomatic 11, cognitive 10): testPrimitiveUnions has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/union_types_extended/typescript/index.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa2d19a5134d87a65b13365f274c726e6360ca26b611c5e5744b1e296c9a4f1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DurationDisplay (cyclomatic 11, cognitive 10): DurationDisplay has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/react/src/components/network-timeline/index.tsx"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1e1c87e4f57ec713035f40b8958735e1c35bea34b4f55773df666c42dd19a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DetailPanel (cyclomatic 11, cognitive 10): DetailPanel has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d7bdec56495fc2da02aa96eb0481a4436fec614750a56423a7e658dd520093"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RunButton (cyclomatic 11, cognitive 10): RunButton has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/preview-toolbar.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c35e948711bf7336a6733e26d12e6a25efc0a85671b8e2324d3e1b77cbbf88"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TabularView (cyclomatic 11, cognitive 10): TabularView has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/components/TabularView.tsx"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0ea6e2ec87ffb145f4d4390f1ff9e0c13a2256a4ac7cacf5a43d417a5eb1de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BepExportDialog (cyclomatic 11, cognitive 10): BepExportDialog has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-export-dialog.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3803f8a3086fe6fe41d27c8b61f9a79cfb9ba8b957e6808ff5ba907123667da4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DecisionForm (cyclomatic 11, cognitive 10): DecisionForm has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/decisions/decision-form.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4bb6d2854ef3f132a02592cef82c53a0e9b1efe454d1ceffbcca6f389822db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveBepLink (cyclomatic 11, cognitive 10): resolveBepLink has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/bep-link-resolver.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1879940aefb33257ec8bf6ceea93c2d779e2f588081fb51144a2d10cd0357a9a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function NavigationBranch (cyclomatic 11, cognitive 10): NavigationBranch has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/components/docs-sidebar.tsx"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba060a3ceaff0d94868d875b1f6f08f0741c26edd89a2ee15129b44da2752d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function outcomeOf (cyclomatic 11, cognitive 10): outcomeOf has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/lib/db.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"84699021c730245830abbb1e433684f5b3d362d6b0a710aeaf60c1d2ce1d6eea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/src/App.tsx"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"59780a92598176b9939685c6f04121629c089b8ad017fbe3d975f11a7c02aec2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function qualify (cyclomatic 11, cognitive 10): qualify has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-stdlib-matrix/src/signature.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"98cb0f781df67644b2d7b1abacfc9002588492a0bab8984ea8ed53f2541d39e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_components/Workbench.tsx"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9a3d906c57c4dbe06840c5696457e06dd03f6d3032af17776039c6c2f23543"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/adopt/architecture.tsx"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"9967064ffc1769b3089dbb6fd34ebbef8ae6c90417066cc6bbf87f5c74cb72a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/tracker.tsx"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2f01f1ff8e5819feb394b3f8d0382b8abaa5464d62fdaf47f5e91b95b54ce2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Vertical (cyclomatic 11, cognitive 10): Vertical has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/tracker.tsx"},"region":{"startLine":2038}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76467b75ee79c4403211550fe7bb57845c6728da93957900f2b1174ea6fac1f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function colorForScopes (cyclomatic 11, cognitive 10): colorForScopes has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar/preview/main.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3c5b6e06bbd2b0a6603b17c4848b666c416812cfe9eb0bbc387f6189ec5eba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function MediaRenderer (cyclomatic 11, cognitive 10): MediaRenderer has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/renderers/Media.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c12a0353edb15ef26a481021677fd58dff42782532015b4ac5b702cf40e7a1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function changedTitles (cyclomatic 11, cognitive 9): changedTitles has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcs.ts"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"673df843dc94ae00fb6ae1828b9f90e98cf8c1e1f3ce43076aa8360dd089a3e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ThreadCard (cyclomatic 11, cognitive 9): ThreadCard has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/reader.tsx"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31f60d0df1591df0a0b5fcb79f2d5166fcea887b0ed1f6b032bfca90ce5aa05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function UserRow (cyclomatic 11, cognitive 9): UserRow has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/users/page.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"05dab8e0f61d0f69c643765a8d1011398add0a29972c1b831a2105331030f6c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function variableTypeAnnotation (cyclomatic 11, cognitive 9): variableTypeAnnotation has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-known-value-widening.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"637a88897f491921d1359afcb24edc17f7aef4d391d52cc1e642d67d42baf6cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handler (cyclomatic 11, cognitive 9): handler has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/slopPledges.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cba06a9b45da9e2e973ad8406073d82132238290923010f454386fc2e1495b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ApiKeysDialog (cyclomatic 11, cognitive 9): ApiKeysDialog has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/components/ApiKeysDialog.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e62543f428b89d107bdf98b12050870b1cc6f6799b5941d596fea440fe890c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/graph/GraphView.tsx"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ebb0c56bc3673c228fac6c5104538fe8b0fb5b793daa3cee123440cc35693f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ErrorsPanel (cyclomatic 11, cognitive 9): ErrorsPanel has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb868901dafd278fd54ee1656cca1d25f6e4e33e15645decd15359bc0f26842"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/pkg-playground/src/ExecutionPanel.tsx: 3618 lines of code: typescript2/pkg-playground/src/ExecutionPanel.tsx has 3618 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f8b569ee0a028f0b3538e8c7862cd6a966495296977f5d2e53d7759e065d46"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx: 3339 lines of code: typescript2/pkg-playground/src/telemetry/TelemetryView.tsx has 3339 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25eb0833da33402bbd665cb8898daeeccec48d8d8baf1adc23f7e460f7cb3f6f"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/components/home/tracker.tsx: 2634 lines of code: typescript2/app-website/components/home/tracker.tsx has 2634 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/tracker.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a763eab23aaae87e7ac940d771f2debe0457128fb4eba624e16074e0e50dc61"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/components/icons.tsx: 2463 lines of code: typescript2/app-website/components/icons.tsx has 2463 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/icons.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"550c572c879f5f6ebaa6706068ef581b240d9a47fd6dd4d78860d0e003d067ff"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/pkg-grammar/src/baml.ts: 2443 lines of code: typescript2/pkg-grammar/src/baml.ts has 2443 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar/src/baml.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5aacf8b1f1295726d709d5bd8357615e07770d1db76836757102585975d03f4"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/components/adopt/architecture.tsx: 2052 lines of code: typescript2/app-website/components/adopt/architecture.tsx has 2052 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/adopt/architecture.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4d6a137807d18ad601493302fc619d1bd22204dd66a62d8f3d628b91d60590"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/components/home/hyperobs.tsx: 1591 lines of code: typescript2/app-website/components/home/hyperobs.tsx has 1591 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/hyperobs.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0b9ca0c14b9d2d59c51ab0b21ec2e1eba9ba4405a55f8bec61cdc18fbf8edd"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/components/home/stack.tsx: 1512 lines of code: typescript2/app-website/components/home/stack.tsx has 1512 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/stack.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e7a9a27a72508985def0d00261e847925db0292dec5a2ea697f93c0e57a7e9"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript/packages/playground-common/src/sdk/sdk.ts: 1337 lines of code: typescript/packages/playground-common/src/sdk/sdk.ts has 1337 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/sdk.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d02f1922fdc15dfcdf3716c3d196a58db4eb6757d1e98f464b7c49969f34211"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/pkg-editor/src/MonacoEditor.tsx: 1316 lines of code: typescript2/pkg-editor/src/MonacoEditor.tsx has 1316 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-editor/src/MonacoEditor.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed57f2e2257eb2ac470f892c896d4996494c64811b88433617a3cd12ccd8ca36"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/components/home/review.tsx: 1238 lines of code: typescript2/app-website/components/home/review.tsx has 1238 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/review.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbcbfe1c08f68a6d0cbea7ecf35a95b3baf30ebd51a601c9fd657de492e31f1b"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/pkg-grammar-treesitter/grammar.js: 1200 lines of code: typescript2/pkg-grammar-treesitter/grammar.js has 1200 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar-treesitter/grammar.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88f4be1e5479040809cc265b7c7a430a801af718516982cc33af5e2ce53d113"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/pkg-playground/src/worker-protocol.ts: 1186 lines of code: typescript2/pkg-playground/src/worker-protocol.ts has 1186 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/worker-protocol.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe99fa0b857019ecfae14ed75f8b18d63596ed446836a726ce26fac451803a2"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/lib/mdx/bfcl/_components/TestResultsTable.tsx: 1131 lines of code: typescript2/app-website/lib/mdx/bfcl/_components/TestResultsTable.tsx has 1131 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/bfcl/_components/TestResultsTable.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8a0328ec1628e15d508d878d5f4fd6549e2c3ec627c867fa5d45f3543e3c7f"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/pkg-playground/src/telemetry/evidence.ts: 1064 lines of code: typescript2/pkg-playground/src/telemetry/evidence.ts has 1064 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/evidence.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dace455d0b5f68f13eca51fb271b6678812ac9d1102bc7eb70e0d218a874a0e7"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript/packages/playground-common/src/sdk/runtime/BamlRuntime.ts: 1050 lines of code: typescript/packages/playground-common/src/sdk/runtime/BamlRuntime.ts has 1050 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/runtime/BamlRuntime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4793f271a7f5de1bf5fc31bb20550dcb9d110e84b44ed770a16895943cf06d"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-beps/src/components/bep/bep-route-shell.tsx: 1044 lines of code: typescript2/app-beps/src/components/bep/bep-route-shell.tsx has 1044 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-route-shell.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cafca64c34b2d23b9e90781ed5dec94a28d93f09d14d0b3b82ab449fda982a4"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-beps/src/lib/static/bep-script.ts: 1023 lines of code: typescript2/app-beps/src/lib/static/bep-script.ts has 1023 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/static/bep-script.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"653ae7c6c95670c9479454a4e7dc8da6a34072473bcae17ef3b265d5b15d0d53"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript/apps/vscode-ext/src/plugins/language-server-client/index.ts: 979 lines of code: typescript/apps/vscode-ext/src/plugins/language-server-client/index.ts has 979 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/plugins/language-server-client/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"979f653d3ec4191f4a2b0995b8c0916cc4c6b2e39d74dad59884713537aa766f"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/components/home/hero-video.tsx: 975 lines of code: typescript2/app-website/components/home/hero-video.tsx has 975 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/hero-video.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c548ce7e592ec75a62d30bd74cdb87816a940366d0e592ac798386b32f771ed"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx: 941 lines of code: typescript2/app-beps/src/components/comments/comment-feed-view.tsx has 941 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ed844536f0b31cc65c5c5fd7effb926f1cba4617496444b02b540c0c946d1c"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-beps/src/components/comments/comment-sidebar.tsx: 906 lines of code: typescript2/app-beps/src/components/comments/comment-sidebar.tsx has 906 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-sidebar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f844413abf0791b423687ff738f38dda6ae535a7e5169a9383e62c5a1520bbf1"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/components/home/improve.tsx: 874 lines of code: typescript2/app-website/components/home/improve.tsx has 874 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/improve.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce3f9f0c37df3d76b73cdad6358814c7a2f0bd036e36d32b89a7ed44d86438c"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-beps/src/lib/export-utils.ts: 873 lines of code: typescript2/app-beps/src/lib/export-utils.ts has 873 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/export-utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d260664c93f9b5c6cd3aee08cea2b35a6658fed689fd462b2983b476c55a8463"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/app/(home)/logo-ideas/generated.tsx: 859 lines of code: typescript2/app-website/app/(home)/logo-ideas/generated.tsx has 859 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/logo-ideas/generated.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2ca725170d9ef1bf23e9dfa3ee5e26dfd205e40deba3bc2b28b3521446602f"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-type-quiz/src/app.tsx: 820 lines of code: typescript2/app-type-quiz/src/app.tsx has 820 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-type-quiz/src/app.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8f6a56fe65d1f1ae1f04205eddf53ebd856c93c4cfbb7f83fcef2a4628f4c8"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript/packages/playground-common/src/sdk/atoms/core.atoms.ts: 818 lines of code: typescript/packages/playground-common/src/sdk/atoms/core.atoms.ts has 818 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/atoms/core.atoms.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2b5c5a6b1a780b4c9dec3eb3d1cd1a4c683845d4191c25fe9c8219c9e7a96e"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/pkg-playground/src/graph/GraphView.tsx: 817 lines of code: typescript2/pkg-playground/src/graph/GraphView.tsx has 817 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/graph/GraphView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d16a34988a5b49523728e0cfe0b9e94b310270ff442b76d5b1dcb00b3d4be1a"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx: 800 lines of code: typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx has 800 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"048d92e863d5cbabb4242d12312cf142fd7934968fa7a34195ea441e59224f92"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx: 793 lines of code: typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx has 793 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e0f2cbe2f289dfdcecb29271a93168508cf7d645858e06b884a21595edc0bf"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/app/(home)/bamlcode/_lib/baml-monarch.ts: 776 lines of code: typescript2/app-website/app/(home)/bamlcode/_lib/baml-monarch.ts has 776 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_lib/baml-monarch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d85e208a46fbaafe89731e430e1cf15c2477b7821c646cc41b5df36a9c472f"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-beps/convex/beps.ts: 775 lines of code: typescript2/app-beps/convex/beps.ts has 775 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e992a59900b05887cfca4f60d3642b5585ce93b963000a882a391ae915632a6"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/app/_lib/config.tsx: 756 lines of code: typescript2/app-website/app/_lib/config.tsx has 756 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/_lib/config.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e83ea136f7b21ea8c63d535b323d30101fe1412de54b2cc68bd75fd6124b0e7"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript/packages/playground-common/src/sdk/mock-config/config.ts: 751 lines of code: typescript/packages/playground-common/src/sdk/mock-config/config.ts has 751 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/mock-config/config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"387e5162cbd1171883537610e1a60f9a09e018cbf71a821de6482a74f7c5b9ac"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript/apps/vscode-ext/src/panels/WebviewPanelHost.ts: 727 lines of code: typescript/apps/vscode-ext/src/panels/WebviewPanelHost.ts has 727 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/panels/WebviewPanelHost.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"914eb406039959e60d786cd7f5eed388807a53be2af0be0b0ed92a20274a0547"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/pkg-playground/src/ArgsForm.tsx: 702 lines of code: typescript2/pkg-playground/src/ArgsForm.tsx has 702 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ArgsForm.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bddcc8265b5cea3a68f8f84874fad73c39a8afce10ee27e3d9bfb03bdeb174e9"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript/packages/ui/src/components/sidebar.tsx: 673 lines of code: typescript/packages/ui/src/components/sidebar.tsx has 673 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/sidebar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93da29796009bd3de905d5af21f641a999ed88f59cf93999b0f445409ea39d52"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/pkg-playground/src/FunctionSidebar.tsx: 671 lines of code: typescript2/pkg-playground/src/FunctionSidebar.tsx has 671 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/FunctionSidebar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5bb4281c5a549bbf16b95585306bd70a6c2469a90e95ed473114cb5ea95dbf"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/pkg-grammar/preview/main.ts: 669 lines of code: typescript2/pkg-grammar/preview/main.ts has 669 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar/preview/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"845c73bc29419663fdc3edbe946560695068d28bb687661585d512f328f46b6c"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript/packages/playground-common/src/features/graph/layout/node/algorithms/elk-mermaid.ts: 663 lines of code: typescript/packages/playground-common/src/features/graph/layout/node/algorithms/elk-mermaid.ts has 663 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/node/algorithms/elk-mermaid.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a3317d3c18fbe17c808e7bf4c26dbcf2cc00020665a7e3a36b9e248bfef335"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/app/(home)/blog/_lib/art.tsx: 661 lines of code: typescript2/app-website/app/(home)/blog/_lib/art.tsx has 661 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/blog/_lib/art.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ec17cef36e2cc132b1dd0cd45158b675cd1f5b73cbaf0a002fa7f5bef83273"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript/packages/playground-common/src/sdk/hooks.ts: 658 lines of code: typescript/packages/playground-common/src/sdk/hooks.ts has 658 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/hooks.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a69ae2aeb9878cbed37c9457cdb4c703bf6e9bd33f355d8e38669d34cd46b37"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-beps/src/lib/export-all-utils.ts: 656 lines of code: typescript2/app-beps/src/lib/export-all-utils.ts has 656 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/export-all-utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"076f70d884afd9c38299f25881d8d19249aa83ed5cba56b8db60bda3b28a1317"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-developer-docs/components/generated-reference.tsx: 651 lines of code: typescript2/app-developer-docs/components/generated-reference.tsx has 651 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/components/generated-reference.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e3fb13bd79a18ddfe44f5d9b52d422adc8b043172d3b59fb5965059bd31733"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/scripts/new-post.ts: 650 lines of code: typescript2/app-website/scripts/new-post.ts has 650 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/scripts/new-post.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba8191dd6b69c1e775096089bd40e8409e2a82eef014ba6e13c096f53350ce8"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/components/home/workflow.tsx: 647 lines of code: typescript2/app-website/components/home/workflow.tsx has 647 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/workflow.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71079fd3bc14fe4b4e62d9f0d240b753f79ec5120366ac2ebcb03a8dfcc82f1"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-beps/convex/bcs.ts: 643 lines of code: typescript2/app-beps/convex/bcs.ts has 643 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85576d1370763bb5ee8237d206a48486c45a0652ddf75e4fc61d31df8ca6bd82"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/pkg-playground/src/ports/WebSocketRuntimePort.ts: 631 lines of code: typescript2/pkg-playground/src/ports/WebSocketRuntimePort.ts has 631 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ports/WebSocketRuntimePort.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c62e8a00cb8da0ed5061bf971af0e2df85b21bdc6593afb7396cda783d9fe58"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/components/pricing/meter.tsx: 625 lines of code: typescript2/app-website/components/pricing/meter.tsx has 625 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/pricing/meter.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"917c6dd73d4d24c20b87d53d090ff56e57225347aeb06ac204c9ee6da81ef8c5"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-beps/src/app/api/agent/beps/route.ts: 602 lines of code: typescript2/app-beps/src/app/api/agent/beps/route.ts has 602 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/beps/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2a5e3f164d644abb4a01d6c8d8c3f7110acd632312ddc0f9e15350c576fdd2"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/pkg-playground/src/run-store-projections.ts: 595 lines of code: typescript2/pkg-playground/src/run-store-projections.ts has 595 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/run-store-projections.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d14795b4c7c0fc1d4cd30e6a7691a3867e843c36b12662c3c9d4a47b0a7307"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-beps/convex/slack.ts: 589 lines of code: typescript2/app-beps/convex/slack.ts has 589 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/slack.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7216d21ac0464898f4738a02807ef0ae1a10b505f4bba59eb9a6a413915d42ea"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/components/home/software.tsx: 589 lines of code: typescript2/app-website/components/home/software.tsx has 589 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/software.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a436d057d0020531ce2280713a9a9f0abe34591bd401ff3d8a8abff7777eca3"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-beps/src/components/bep/bep-import-dialog.tsx: 586 lines of code: typescript2/app-beps/src/components/bep/bep-import-dialog.tsx has 586 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-import-dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fb9763c61e3cccbbc0c83f66fca4cb46c4287f2792d67e819df8441c739454"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-beps/src/components/comments/comment-thread.tsx: 579 lines of code: typescript2/app-beps/src/components/comments/comment-thread.tsx has 579 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-thread.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b106c5e89f3ab0f8b00f8b850b824087317e03ee3bef6b6e07e5ee70b9c97077"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/pdf-viewer.tsx: 568 lines of code: typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/pdf-viewer.tsx has 568 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/pdf-viewer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b349e74176e22ba8c45bf599a442a08fc0080c2cc2b610922dc85f2294e8a9c4"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-beps/src/app/bcs/[number]/reader.tsx: 559 lines of code: typescript2/app-beps/src/app/bcs/[number]/reader.tsx has 559 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/reader.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf52b12ab0e866359debfda89de24cb5830725234da86dfd3b080179eee9a41"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/pkg-playground/src/run-store-client.ts: 554 lines of code: typescript2/pkg-playground/src/run-store-client.ts has 554 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/run-store-client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8e5639b59d0a1ab80d13b66934df49688c94bde46adf21417a9b0039001faa"}},{"ruleId":"R3","level":"warning","message":{"text":"tools/stdlib-matrix/extractors/ts-surface.mjs: 545 lines of code: tools/stdlib-matrix/extractors/ts-surface.mjs has 545 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/stdlib-matrix/extractors/ts-surface.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da12a92fbe1d9f79659c28b78f04e5320c4d36a00c2a4cf590e6f024424d422b"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/smart-edge.ts: 530 lines of code: typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/smart-edge.ts has 530 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/smart-edge.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b34f30695f06f8b08fe9f25fab495fd1101c2ca08aa07ab8898a8acd38841b"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-beps/src/app/bcs/actions.ts: 527 lines of code: typescript2/app-beps/src/app/bcs/actions.ts has 527 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/actions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ffbb14d31ff5e3a96ea283d34c47cfad16ff3cc0791b026e3ad15b2f32d2e9"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-vscode-ext/src/extension.ts: 526 lines of code: typescript2/app-vscode-ext/src/extension.ts has 526 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-vscode-ext/src/extension.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae54cd4c4dc5b7b90ed23c067390af435aef7b008b014c998dc6ac34292407e"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/pkg-playground/src/graph/layout.ts: 517 lines of code: typescript2/pkg-playground/src/graph/layout.ts has 517 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/graph/layout.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8107ed5a69c95c46f345894af0409421c58c4f0ebf9adf75318c5255ab3a1ae6"}},{"ruleId":"R3","level":"warning","message":{"text":"baml_language/sdks/typescript/bridge_typescript_web/typescript_src/native.ts: 516 lines of code: baml_language/sdks/typescript/bridge_typescript_web/typescript_src/native.ts has 516 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/typescript/bridge_typescript_web/typescript_src/native.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89678d0ccc15137eff1a0bc540409432946ba2db668615795c0c63c4a733814a"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/app/(home)/eap/signup-form.tsx: 510 lines of code: typescript2/app-website/app/(home)/eap/signup-form.tsx has 510 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/eap/signup-form.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8b0e7932a3c6d9f66000c368e37ad7977deae7e94baf7a5273558b4e62fe37"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-speedtest/src/App.tsx: 508 lines of code: typescript2/app-speedtest/src/App.tsx has 508 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/src/App.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4cd535f4687cf6306ff8f48b60cdca276dc1bdd73cda534bab237ecca05a62"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/scripts/convert-videos.ts: 506 lines of code: typescript2/app-website/scripts/convert-videos.ts has 506 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/scripts/convert-videos.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50a2db93d29bf2cc3d0efe8158161b6c94c9bec78e504648b5f8a65923c521c"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript/packages/ui/src/custom/icons.tsx: 494 lines of code: typescript/packages/ui/src/custom/icons.tsx has 494 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/custom/icons.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4957b3860e902136793a769dbc2b043f87960ec3150abb7ed65839a12d3a08d"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-beps/convex/schema.ts: 492 lines of code: typescript2/app-beps/convex/schema.ts has 492 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/schema.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ccbcf2b81efeb653d6b382952dca8d0d7ec9cb4022528f292f84cb00c12ef6"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-beps/src/lib/bcs-render.ts: 483 lines of code: typescript2/app-beps/src/lib/bcs-render.ts has 483 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/bcs-render.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67282ebf4db27845187f189c3642c6e6809b3592b5b84512218d3e7ed5f00ce9"}},{"ruleId":"R3","level":"warning","message":{"text":"integ-tests/react/src/components/network-timeline/index.tsx: 482 lines of code: integ-tests/react/src/components/network-timeline/index.tsx has 482 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/react/src/components/network-timeline/index.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3430fea02e218d70d6beeff4404ca7e782b3b5620c90ae64b99958915826465c"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript/packages/playground-common/src/shared/baml-project-panel/vscode.ts: 477 lines of code: typescript/packages/playground-common/src/shared/baml-project-panel/vscode.ts has 477 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/vscode.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e293d581ca05362f255df918023d0c6b5cb32ab485bb4ad805e6078142abd73"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/test-panel/index.tsx: 477 lines of code: typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/test-panel/index.tsx has 477 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/test-panel/index.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88e01e89d28ab69363b2fe17843ae9fd71dcd3bdd51d7e5499c702c7c3e4559"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-beps/convex/comments.ts: 476 lines of code: typescript2/app-beps/convex/comments.ts has 476 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/comments.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c77baaec731d4d847945e426d17d2ee86a67b6ce4b6e5bfb879c8662a5c82a"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript/packages/playground-common/src/sdk/storage/JotaiStorage.ts: 475 lines of code: typescript/packages/playground-common/src/sdk/storage/JotaiStorage.ts has 475 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/storage/JotaiStorage.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b48ff88b755f148c01cdf8998c3a12ff19787ad5b23905427e20b566aa452d"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts: 475 lines of code: typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts has 475 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb2bf0b5909d5e56efac35b95c099c97b940a597533a6a0ebaccb8309166665"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/app/(home)/bamlcode/_lib/runtime.ts: 474 lines of code: typescript2/app-website/app/(home)/bamlcode/_lib/runtime.ts has 474 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_lib/runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be49838e0442c0be71a33703c6da58c1d65028d09ace6070e01f7236202345b"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-stdlib-matrix/src/components/matrix-symbol.ts: 472 lines of code: typescript2/app-stdlib-matrix/src/components/matrix-symbol.ts has 472 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-stdlib-matrix/src/components/matrix-symbol.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b7106ec99a09001a52abfae4e2d76b720a1f3efb98b628cfd2624175c434e2"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/components/home/language.tsx: 467 lines of code: typescript2/app-website/components/home/language.tsx has 467 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/language.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2edd9c52d9159866e088e12a891012ed9ef2dc42ea9b2a15ac2d86e077fb97"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/components/home/agents.tsx: 466 lines of code: typescript2/app-website/components/home/agents.tsx has 466 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/agents.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79873a9a38cffda42e8ea136dfc5065d1288e679b0500911be217b4ef06a9718"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/components/magicui/deployment-status.tsx: 466 lines of code: typescript2/app-website/components/magicui/deployment-status.tsx has 466 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/magicui/deployment-status.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"942024558ea307b78ebc931a8df11b247c8c5f498c44c7dfff2b3d51e57dc6ee"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript/packages/playground-common/src/features/debug-panel/components/DebugPanel.tsx: 464 lines of code: typescript/packages/playground-common/src/features/debug-panel/components/DebugPanel.tsx has 464 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/debug-panel/components/DebugPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"893330a569093670b336854246194f506e82708b6720c2252cd0a56cdb3a89c0"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-developer-docs/lib/generated-content/publisher.ts: 463 lines of code: typescript2/app-developer-docs/lib/generated-content/publisher.ts has 463 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/generated-content/publisher.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc4e49ec629c65827445cf124da034df9d4665d9c45b1586abcd08a3b3889b2"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/components/EnhancedErrorRenderer.tsx: 457 lines of code: typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/components/EnhancedErrorRenderer.tsx has 457 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/components/EnhancedErrorRenderer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77e9b88a93a0049b4264569530a7b95d3507b02559161875f367f4c6286372d"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript/packages/playground-common/src/shared/baml-project-panel/codemirror-panel/code-mirror-viewer.tsx: 453 lines of code: typescript/packages/playground-common/src/shared/baml-project-panel/codemirror-panel/code-mirror-viewer.tsx has 453 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/codemirror-panel/code-mirror-viewer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a169c272c931bb62f1050c95980294abc5bfe318af082b26500add02180cdb1e"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript/packages/playground-common/src/sdk/interface/adapters.ts: 449 lines of code: typescript/packages/playground-common/src/sdk/interface/adapters.ts has 449 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/interface/adapters.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b566094392b53bbdb8142d1ef215d6665238880434ff1acd37c6b7f60ef5765"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/app/(home)/logo-ideas/marks.tsx: 449 lines of code: typescript2/app-website/app/(home)/logo-ideas/marks.tsx has 449 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/logo-ideas/marks.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ec1bf85acb0239a8aaec94ce0c9ac96dae7eb2ea4df97d99ea44ce7cc13ce6"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript/packages/playground-common/src/features/detail-panel/components/ExecutionLogPanel.tsx: 448 lines of code: typescript/packages/playground-common/src/features/detail-panel/components/ExecutionLogPanel.tsx has 448 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/detail-panel/components/ExecutionLogPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5149c160858f2ee6d0855c8cdbefd8203f78d0428059227cf6a0c1c93494de2e"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/components/home/deploy.tsx: 446 lines of code: typescript2/app-website/components/home/deploy.tsx has 446 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/deploy.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a01d6729e1a1cc6ec8c2a23d7d7089d970aac38af9f8f6999863fd3e1bb0c62"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/pkg-playground/src/components/ApiKeysDialog.tsx: 443 lines of code: typescript2/pkg-playground/src/components/ApiKeysDialog.tsx has 443 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/components/ApiKeysDialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f3bbb40761876cf01a9232e8b8948bd4aa966df6386e5af1e9bf55cf60e9ea"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript/packages/playground-common/src/sdk/interface/types.ts: 434 lines of code: typescript/packages/playground-common/src/sdk/interface/types.ts has 434 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/interface/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"759ff68b82b1bd4fbda9aca5f9b1d72c836de59142c7f8efee4b357b085ca642"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/app/(home)/sheep-council/council-gate.tsx: 434 lines of code: typescript2/app-website/app/(home)/sheep-council/council-gate.tsx has 434 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/sheep-council/council-gate.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"785e7c386bebe8250aa4c16e71eab48739f44acbd1b491e1cf517048e63a1006"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/pkg-playground/src/args-form-model.ts: 433 lines of code: typescript2/pkg-playground/src/args-form-model.ts has 433 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/args-form-model.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46f2b5b8128bd0787cbd4fd36114e32957bdc8c9588c2261f3db5654ddc324b"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-developer-docs/lib/generated-content/package-generator.ts: 424 lines of code: typescript2/app-developer-docs/lib/generated-content/package-generator.ts has 424 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/generated-content/package-generator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f09b60d0f21869d2f0781cc23821e0717e38ebec3e4b291a8b5d3b8d6a8f7b"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-developer-docs/lib/generated-content/document-projector.ts: 423 lines of code: typescript2/app-developer-docs/lib/generated-content/document-projector.ts has 423 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/generated-content/document-projector.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbbafdd8de31676a3594aa7aa50f8cde0617a8437d723a6a3184f632701c898"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-product-metrics/src/jobs/send-slack-report.ts: 420 lines of code: typescript2/app-product-metrics/src/jobs/send-slack-report.ts has 420 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/jobs/send-slack-report.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7e56f5c528f011f119efaac7c077f478ba459cfdee771dfe431b1281433802"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-beps/src/components/ai-assistant/ai-assistant-panel.tsx: 419 lines of code: typescript2/app-beps/src/components/ai-assistant/ai-assistant-panel.tsx has 419 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ai-assistant/ai-assistant-panel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"164fea10c6d185d8ea1ceb3ba4b80f67fb2833bb5769b6a1959d88ab8692f55d"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-website/app/(home)/podcast/podcast-data.ts: 417 lines of code: typescript2/app-website/app/(home)/podcast/podcast-data.ts has 417 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/podcast/podcast-data.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f702ce9d6c6dbbe8eec7c2b7427e0f8e89c978924188742be9ef7fa756e26596"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript/packages/playground-common/src/components/api-keys-dialog/atoms.ts: 414 lines of code: typescript/packages/playground-common/src/components/api-keys-dialog/atoms.ts has 414 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/components/api-keys-dialog/atoms.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6099806cbfce8e5ec0aea72f17edb5f9906a615da299d8ccb27ebf72e57f48f9"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-developer-docs/lib/generated-content/cli-generator.ts: 410 lines of code: typescript2/app-developer-docs/lib/generated-content/cli-generator.ts has 410 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/generated-content/cli-generator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c4a0e4bb83bf446847d230358986d6509cb354e54c6b4cfe08f69ede344749"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/prompt-preview-curl.tsx: 409 lines of code: typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/prompt-preview-curl.tsx has 409 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/prompt-preview-curl.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7f242010a6998097bb34af82b74b6334fca8b11f05adf047ee3f3839dbeca7"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript/apps/vscode-ext/src/extension.ts: 408 lines of code: typescript/apps/vscode-ext/src/extension.ts has 408 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/extension.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58808e2df43276f4c12b057be57ebc2c899bfb958410b1146a179ddba0c1663"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-stdlib-matrix/src/types.ts: 403 lines of code: typescript2/app-stdlib-matrix/src/types.ts has 403 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-stdlib-matrix/src/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5a649634b594dfd33fbcb488968494d2b2a5c082b4c5a29d81efe77df0fbee"}},{"ruleId":"R3","level":"warning","message":{"text":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-known-value-widening.ts: 402 lines of code: typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-known-value-widening.ts has 402 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-known-value-widening.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0d28c98d188f9c57ceaaecfddc9afd33e0e978c313acb173909b9faf12f843"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/tracker.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60549683b39c328d653f263208227a1d2aeb6911c23b6a7f94551f64b4b41f77"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar/src/baml.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc50312651a6801d9c955c09ca45b9b760f639f02220b2419a9d686ad2b8047d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/icons.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0bca461851cb821de9f8dfbf79659469afafbabd46db33dc14b139ec7e15df"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/adopt/architecture.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f325291fccd0d13e69ccbcd2559010f809da6d91c43e5a731fc9e54440ee1a0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/hyperobs.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0dd69bda0023e5f5d21d181f1c2bf7111f7c0c355168a782c1f719be0297154"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/stack.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"222ef8ced40b3f459e4c4c5615e303f0de69617b82c53c32651660b63a1240f2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar-treesitter/grammar.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"748b09f6f2d63db37da3d4fc6b7c6199bef22098158a866032edc52702c8f44d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/review.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d393b5e556e3886be9566e3b39f3c4e2e4a785828618e7b2ad33c9c1971b8b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/static/bep-script.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd482919bce334b3b3d15ea19749ea789280b3a014f5f666bd8c4851b080eb0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/bfcl/_components/TestResultsTable.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"005520000fc2f71907fd57afe5c8724ac6f0305db02a6439ae74e5567f54c24b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-route-shell.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b68faddddc7f4203c611339a06f8c8112322bcace3b49b175c545aa3417bf3e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5667b1f86ea0cef7ce0efaaa796e0bafc61bd6e4870780277927604f7db90b3d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/plugins/language-server-client/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30472662db2104a60fa41a908bbc48d1ec4412a8d22b2772dd4f173bc34cd1e5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/export-utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0ab3f256d18535d15cd28486c3706bf737dd04c0bf4907da76ae47a2b2b1aa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/hero-video.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a9ffd159815f2c4dd8f70613b464e3f00a3fa0a91e0ffe823c196297f9dc33"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efc9230f960d8f5801b69337f125df6cf418acef28bdd8e97e30fb9b64046eb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-sidebar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ae080294fca3e53ddf2fb8dc25aecdacf333aaf2abe472efde4778b2d601c1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/playground/baml-worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b358c28916bac028ecf4b91879ab5eb4f710531a05001b757bd7ce640cb3244"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/improve.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"131107cda3fb53584e0ab2b6e2ce6d1fd6401f74201b36a704a112023af6cd20"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/logo-ideas/generated.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46efbd85fb04b5cc98ace67853921e59cb53ea97524f9eaf65cce6a4966b0fa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e4e82764b4e8e593cfd2b312b45a5b0048b97cca8dd2899dfcbd511aef132d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/export-all-utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f48d40bfff624f4be84167e8a382292acc035bae0c8a21e1a10d859d22e93b0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_lib/baml-monarch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba8fbc5c2a9750d9042ce007419218fb79e8e75e3e83803d7d7921078271e48"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/_lib/config.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6f6390f8d6111af4c79fb4b6c6f27db4317d34b3c44040aecf3038870a6d0c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar/preview/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b46af485536983850c09a717a50e24f77959b9e23c46b861fb3cb95541ec13"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/panels/WebviewPanelHost.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a518f275b581cf261ade88c9f08c62bd17b2b07d2a47d7a45a8f539548ab666"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/scripts/new-post.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b27293176d832b492158e1d9c4416209f362637b8000b156f8e180d1793b88"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/beps/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"947ab66033724a653a7fab86515d04adfa57ac3c7ea41cad59c2939b1e279739"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/quickstart/_components/try-baml.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c5aa26f7cc0e23e3cb2d2bcf01c03e6c527e9df38b5d2e48dc38100aa36669"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/blog/_lib/art.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e7afe5435c6f0d6cd344ef4ba819fe2a39511fdac1c2b966ddb1280274d45c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/workflow.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7614fecb9f0708339952e9a4731eb171bcfab004600f17a2c634ce84b454e3e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"611f852086f84e4ba0628c5b1bd600510a45b1556caaac9c613aff22077b3ca5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/slack.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecba3b229944f3e07e5c8d5760e77e6b26acdf818ceb67b99716660033b08f3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/pricing/meter.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5486fc8e384e7e3c57b482005620d69ca611a25b85024499ae9d604b0c51605f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-import-dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"638639302d0267e01611980f8ec2ee43bf5cf02edb8fb1da2d8fa4832495746c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-thread.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7510ed6d5197d0f84063eaedbf8b215c756dcfc0579ecbb5fe5938cfba4b66e8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/software.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf969368aced5892e1d80f0a611abdc83d6cb3c2cff4c739fdbb857646fc403"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/stdlib-matrix/extractors/ts-surface.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a80d248fd4381f5dd45ee30006d7ccd079523620ab11a61eeb374d0f6c4438"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/reader.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c46c42d67f32c5417d7429a3a955191bba6e32aa419f3ada88271eaad88dbb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/scripts/convert-videos.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7f9f104b8ca332fc24585371e32ad6cb02b0e7f0eb9dfe49dff9f69e56eee6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/smart-edge.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8778de379284216b1b99f1ebd1e766b2b43c9f7d21d1df12aae46a4de10e7cb1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/actions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42c2711d9c0209afdeea85e9b7213880d66fde855047359c835dddd9b415535"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/schema.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a5b3ed766c98fb7e685f7d7775d08898e8320e1ec3ad11e00eda5ecdc474ec"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/src/App.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f73b96fc3ae1a8897255887baa62bf8e3b7c3ac41a95f25d324118aa5a49e4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/comments.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6f86f52ffa5652010f17a4578c414a535ab5e1f5da45e59f3dc2c2bd44954f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/eap/signup-form.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e275e4c988a0b6b3f79aca912edfbb61abe720d99f35aec56599d715c2fb7d0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"795f1b583ea4219acc08c73c9b9036598ebdde7cf2100e88ebe1140a75b2b9bc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/bcs-render.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1e6e5d43b6fd8b32d941a065ae0fd6abfffff34a6010fe28845c901c702aa0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_lib/runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a6cd29a5d2507c0daec35c19454771256a2853f1e8d22a07e53e81c0047867"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-stdlib-matrix/src/components/matrix-symbol.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6547a77fb66d63402574357e425e7e8507c5b46b8468162c07862a8831a48586"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/magicui/deployment-status.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64ccc0ab8338cf56714a48d00c32b046eb3cf8977805118e064af461ab51f05"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/agents.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b34362684e4717ce70e94d9253b3551a13562f622542453626ded4baa22cc12"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/extension.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8199e3dfc349dcdc99cc2fea8fdbb3b8da9d53bd8b39f39f2b042e658870916e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/language.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efd8e2950344714b363fef74a22265706a92f7f34753fa6bee355b52360f548"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/logo-ideas/marks.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35575f03371717fb01b728b46b34c22bf46f76a7dc6745142b2bc7e3ffa68025"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/deploy.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e360d2acdbd61abc42b7c7d7ceb180c5300ce13cceaab141fa7e9d4304e6638"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ai-assistant/ai-assistant-panel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ee71f9c482ee793157652a0b2e1ca51af42f2618a3f692f04d308181100323"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/sheep-council/council-gate.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51c78b3b9582eb4849668a84ccad02715b22a1e6c3bd2e51f91b5bf4065a383"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/beps/[number]/comments/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b0f77a36815e01a6266515aec2933d05d94bd804a34216cf7edf8af1dde6c2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-stdlib-matrix/src/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb39d1abfd227f972e95b381db058633f02bfe053a413fe537adc2783174835"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/podcast/podcast-data.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06a7ac055d188c3a39aba887a0025c235adcb1f1245d62bfeb68e72cafbaefa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-known-value-widening.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa70b82e12148e00988d42d33be0108167db9cc2656baa7a55ca599daf85801"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-stdlib-matrix/src/components/matrix-app.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2069b8f2863dca9bbf9968411f2ee85ba20adbaa952b9ef52c66fac2334f3019"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-stdlib-matrix/src/signature.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"287302c9488098a46ed3360dc9e3ae34f2610bc9d6b58fad5993436e32a48a61"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/profile/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a670fce68c7eb1a483f1c8a0d5a1b700729d20015daa7a14b3a42a4a834c030"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/lib/mock-data.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0efdaf6e021f15f6ae91be24d55532cf6b4fb8533f821882d41e3ce1e00555"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/playground/vfs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeefeee6d75ea73338ab71b8dbd0ce2a67608aed386bc1b4a89b0f6dfb18512d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/errors.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded90ff2697a051f0c67eabde41f950e79bc7e827665faf5f8c18f0e37bc714d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/blog/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e84ba65f03a63444576cac461ead515ffba07a3f4a638d8e2b60643797eec0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsSlack.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8103b361df8557411d329d9074027b190de3dd25d25f19ed7a8f39dda8404dd9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/podcast/[slug]/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfb7ed4545210f3fb276bcc80b027bb62f8a22ea6f4e4b8886e5cbcfb59246f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/fight-slop-with-slop/_components/war-scene.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf120daa53c675ad30fb84c4fd2ab42424943a513f60979b1ebbfe146874831"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/vfs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78113e7affe2d49f00d351b607852485b4320d9ca0258932c0477692a3f1dbd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsComments.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"705127f7fffa378c5410c6a35b9621b78b55b11a1427111483fe863735597108"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/issues/issue-card.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46292921f630ed24a80ff50f62d3d65eb70ad07870f3c4f3ae389035d9aa4224"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/users.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbeb3bcbc7c14eca32e017cea8393c0b933d50c08b32c9302fab8163f6751fe"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/adopt/guide.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2cf13858c123313daf2386b4c6e7a4aa31d698d8f17c2cb0121da38b9c8548"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-widen-then-assert.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06faa1be362effae71ff82df55a7a9982b26abaf466f5b257321818480e0da23"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/users/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb9d3c367afb866d94b5f2555258f51a9df6ebf906c9cfdfd85dd55d7f31d78"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/pricing/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c058a79a5f6538a315a558d43791307ff0dbe9f36d733ae4ccace7b219bcea6b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-user-stance.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbac3e2ac401c58320a73c8d86011fad4f45f6f3e432f4bafac15ea299ef3ae"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/side-bar/index.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cba09d216740d5d44dd6ce625bb2fba6360493e80e104239d2171f776e34332"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/scripts/fetch-zoom-six-weeks.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42bb0b2f16945ad2aae77141ebe33fad6b7e22f1831256ead5d96a7bcb9e49a2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/fight-slop-with-slop/_components/pledge-form.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c483031c4f5a8094990ecdc8713f6bfbcb5e2a2eaffcf4722b65d9fda05d700"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/report.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58676d7331cd1493e4f236f5175118f1481fe7ecf6b694b535ef48cdbf5651d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/server.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eefa48b5faf03ba65d743c401ee6a021ef3d07d16a61d03b4456c3d0706d759"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-stdlib-matrix/src/navigation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8781f16f16cb8c33f8b748ffd846e542aaf7baa8994b21f8181fec8a397b8ca"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/worker-backend.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68999a3c0c2c5e1978e5cbf2555c0075f5c8921e5f06ba25b0d460a4be7d11f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/codemirror-panel/code-mirror-viewer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34f70c432f49249bee1199531236115569b3a229edf0b3e0a76fd93d507e984"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/pinned.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddad3df713e991e0ed552911e2adf802e0c727ba874114162bf0c811da1518e2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/quickstart/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e56ed61269f85bfafc3defe528b62d9f5ba45d33d10f8af637c3c1d2990637"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/sap/intro.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e369fe024b16912108735ca6cc09834bb4c27f4cd53055b062e598619f2ecc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/components/issues/issue-list.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a56afeb4428a78f22af5f84e3594a0f64783aead44dec8473cbabd54e46d73f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_components/Tree/FileViewer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fdefb92c2af0f29574ee25bfe6f5794b38ae49933cc0c9465bc0f60f6ee647"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/forms.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66557f042975c8a8e980318982dc761094ef4494cdd12af2f17e786626a7878"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38b8147540020ae5e8176f9f0a46fa9aaa0d98fa70822cf081b8b196320a611"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ai-assistant/version-analysis-status.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a98822a251e8c52c1b591cdd49a387300a2e710878c8e00c1b10a79d4d6c11"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-nav.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afb6a0485f999269bf2463a09b17442ae50aeef9c49f114c72cf6e308721112"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/control_flow/mermaid-sandbox/app/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebe905a30963de9082eb95d2757597ae90330bd765c5839eef0db4ef9b5635b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/type_builder.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11868bcb74fab00a2a57554c430fb88a62d45c68ac4ae1c0a7617dc435c53492"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/http.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1052f6dda5a6fca6f67c743f2c18ef57b8d1a41573f6cb6366f3bf67878c7f58"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/luma.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d70a999b4be46a5298c6f3c157d95bf9d7e896548d5c99d2fd78177051a06aa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/actions/signup.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fe47900bddc929d6d0fc66fe66acd62bb4e1067a8807ade29216e2098e4e1c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-export-all-dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e4545892da3e942dc2b057e0b79eb77aa8301d098797b3c7ca76d86abb1854"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_components/ProjectView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00fcbdddfb6188eac6f78eaa21b9ff6bcbc16b4161d7e6230354a19ca16503b3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/newsletter-form.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb81b50ee130d22bba99d57973e3940fdffb7884dcbf55f6d9afa83baa8e836"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_components/EmbedDialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5f5a640b1b3df6a63553a6ea955980c77f551f5664dcdf5f6bfd4ac19bdb93"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/beps/[number]/comments/reply/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cf709ffeec886587bcf3acb3c0c4d9ad5c26b423f6b96eeedc6d1971bd2504"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/board.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"358ccf6712470e80a18b73d9a5f45d0f4dbcba1771b242369048f040be433abf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/side-bar/env-vars.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8fe169d5fd075f6db76c1e6c5bfc49e450e4a36eca25862a513f63fb7be04a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/migrations.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eeae9cf5f8a5eabbbf0f0b3686c4cc093116c0e7fee4fff28ccb916eaad5f9a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/logo-ideas/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c47ae68b59430fc9d77a81876ab158dfb2db2f1a78b892fa53d20ab379b6864"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/edge_cases/typescript/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccbcc414ad02ad6a298e74cb32ec6a01b6b0c02aa563e35eab30565897b50fc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/mixed_complex_types/typescript/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a2d246f59847409b3bb98a4f71729bf5c4ceed0c2ec046a77edbda101b0af7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/decisions/decision-card.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53209e4394ac828450513ae4033a6f39bd4efa3357161ae79beed19f1c1436f8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/nested_structures/typescript/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afbc79dbe21a1a6c54b4ef21dc79edb8af98c2b88fd1ba5d45d0598181802be"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/components/issues/issue-detail.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ff75adfee329d23dd38cb244bf18ea1910d00d6685086da48022626dda9c72"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/fourth-bento-animation.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa21e069537f763b2eb5b44d951257c1d0f6d4cfa8dfd356c9736878b0c2f836"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-table-of-contents.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7441f73c3289f1bc98cb349b104c9aa1c0cdb41fc10624883247b8b1e3b77bd0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_components/Workbench.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cacbfc2faf24d7922a17d657a0e1c01ebc8b0c1db64c50e64bd12f9786a1db0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/who-are-we/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff5213c18ebdb25385182304255af875d4e2f9c5f5b60a380274610ce68accb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/vscode.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d468023c6bce48d1f6546a54bcd973b7925f5a3ff3cd122c85bc081ca2ef1b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/issues.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa951b5f2e5ebca168dd354ae9f2d4a6ece3e5324b23355ec0abe0a277d0b8ea"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/kit.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d3133d9fed1ac6a996faf02e6dd7037c5fd0584396472367db912f132b03b7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/ui/dropdown-menu.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a817ff4a7ead37e0f07f52fe3c3d7c6be138c1796917baa102b526f22902507"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/export.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3e2d7981b2777e1e4218cf84966ccccd1399a56f32152fa24292529c7a2580"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_components/baml-reference.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddb4b42a8ce8c26f62fd44ad199f2345a9975f659c3a28d7722c84c82d3a75c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_components/TopNavbar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3084999d73e38caaf6023dd15561d7b686c3773fdb57842a4b5da781322f2dec"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/type-alias-resolution.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4007ab7479b7c53a03aab1c1b32031f7a2e71c6dd3395cab57115d13b76bf04c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/analysisJobs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2875a8fd2f3dfbfc7b7c9d4b9ec8b7caf09f4df51fe389d23a897289d87f1c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/node/algorithms/elk-geometry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e518ad5cb1d741827c7b5f8459518ed1e9f7eef9f28351b1cc473b8f256e132"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsTracking.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb11524a423ae711160f80dda9665bc9e9da5a2affc55cb3f05da9784da158e0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/decisions/decision-form.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24cb3aaaaffa40050c6020185ae0ae2d8fa0dcb99517ad054eebcce6e64db572"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/ui/carousel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5756d5fd2d09569bc239bef798f7ae7b1153221103b60dbaa862da258f951912"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/map_types/typescript/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dead5f0bb3180d7c9667b818b39ad72f30c988cca22fa523bc0615d8d024b30"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/array_types/typescript/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffe703663a6b0995112d13ea40eec2a553003c59fe5b21cd9385345dc9e1322"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/observe.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca3f74fd701c37d1e28dd382a98882ca7318dbd992cb5cbfada93a67cbf985d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/login/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9512ff8b655e6f0916e6c36bbd92202a80d8dc002e61e564c476eecfb4fa94b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/tracking-forms.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38060da4d21d292d24f63cdad3f87e40da37f2d6162fb090ded3255222619e2e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-content.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20fd81ab97e90927edef5f4dafa3856ad77f71230e60bbcaefa83a9618f0d22"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/embed/clientwrapper.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba86550c836d7c58903a2b033530086d8d5f404bc2c4b56e3a7ccec8d4f430c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/issues/issue-form.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e185699e148445cd0d5a4fe3d19db952700786fb7170adfde4efefae2c1f88a8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-submit-modal.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ab2eedabbbfc403a2aad91056f098b8a14777e8b8fd61aaa9213852651b5b7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_components/Tree/Node.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e884bb8cd2839b586dbf3bb67482d72c4b0d9d3ff9eff94e1f5ab4b6963e6bb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/shiki-code-block.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75503853834a6ccca635db7ea8d12e820f2c47e74e6629b3cf9748b99b532afc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/userStances.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83aa458c8f56625196ded69683b73f50e3a4ec3e49ddb755ec77978a0c40a26"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/auth/github/callback/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"595d218eba0c22360f943f3d4ba6944b228f9e4690bb6e3cdaa0e59cb90079d1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/decisions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3018eaf20a255f81ed93c04258f185c714f45d173c1ebd62a1ceea39942b42d0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/lib/prompts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2afdb73a97dcd885a8657b4481ed192e2ce4e2fd95eb559ee02a979cb82eca93"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-export-dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a79be874a8cced7f817ebb9e3d745d6a6a536a728f5df2bf4065606c50768c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-status-select.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f71e6ee8d121e83345e080f9e4e4aab0c696cc6ecb58bb8783dc693e7926a3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/skill-results-chart.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed05cf81af66811c4d3b6a4ac202657555fe7c4372619e28f736ea97bca99d39"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_playground_controller/TestState.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1b8516924ddc4eeaff5e14dd33d0229c8911b36aece4c46b2162eec6282e39"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-list.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"763b62e71b415ef9b588aa83ca8c0ea091a4a497a726c33eab3b6491fc19a6b4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/BamlBlock2.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"754b98503124fed84a09e278a61fd8131159be66d5c5b627a50972dd3b566e68"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/first-bento-animation.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"819b007c64887cdc4efb7ec0c3b10b0f758625dc98c622011460187ed482d47c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/baml-vfs-adapter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"113d88c6052af18636c15eecf30c6250c0bad7fbd80b8f417a1c314b37c8c684"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/dropdown-menu.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0d61a192c5e9d6cc06377fe98d95d873b8fd621d3012562c3e5f1cb6927d8a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/src/components/ui/select.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edcfeac10cd8d3041bed11aec4ac31de340e6f7082267fc7ac58e6bc9579c95a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/bep-routes.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0992287bb0b1553edbb2372bf55ab1f2ccb6d8450ff6f325ce6c2b598480b61f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/blueprints.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7d8ec0302f0bfae886d0d4732c5c77f93af28fe72392743c4a88c645d09c42"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/tos/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"453ee825d0089379ed05f8b1680a4a8799222635656e9e262db5134e5b42b430"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/blog/[slug]/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfcca5329590b68c7ae87b414570fee75c24320ba75c2cf94e10f68935738b6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/chart-svg.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8836bace2a52892238f290e86ccaa5129f4b26bffcf4ff50a1d016e6f8180cb9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_components/ProblemsBoard.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa25a13b6af1cea0e382b896f3e870d8b9d748ba9f6d8d4a5752cf834d79e03"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/hooks/use-toast.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9f299e4ce9238df295f69d5c64129c4983897e20a2b9525d522c506bbbf543"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/hero-languages-styled.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de051dc0a4db1f05f6dc9ca79ebdb53207f5660b10b9974e84439756720d5e9b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/optional_nullable/typescript/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c41c122f3fffe3ca240f057450d811bc8c6459cf83aa199c244babf65b51cf3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/stream.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6dc061d52a03dbdf32b4dcfc1032af43a18794a27aa0a0e634f76f385898bb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/ui/select.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91584aa18a1b15070d69e6daa63ad1afc038723987b12675f135d7220528fc0f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/adopt.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64d9b465df46389f9a771fcee95bf42f8a339794796e574d29a381a518b4353"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/dynamic_types/typescript/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8a794f4a02fdd49978f201349746ffca84c13ca3f9657a1177bd274a2b94f8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_components/Tour.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"456dabbc4bd1e19fc08f5728c048337df41b930af7f9e96ed6faeede1a01eda2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/webview-to-vscode-rpc.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4746c06db2ac2ca5573081168e8b1150bc7154e432d7593c449a160465a18cb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-version-history.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88597daf80b33426ea237a4a8cf6ed3729b40962741d7b3cdb2cb90139b14880"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/bfcl/_loader/utils.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c95d5787b7eeb07157f0ca50c982522d43e5c72b8be7f829508f9e8dfcfd43"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/lib/loadProject.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1b329c702d41a253051d649a897ee772cb5d2182d8341a45c117d934aa7e3a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/import-utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8be81c2a29a590c3fb976bfa1dfae09e16dc1f0a8fb5629e50c17ef1d38bbed"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/scene-player.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1eff6177117cb5bf407f66df94672ead6ff27a271131b7d204a5450e5187bab"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/privacy-policy/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ea1533ed7997e7be1bec4bfdaf04b5a28a2fec55e1fe75dcb47f3cb21c690a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/lib/pipeline.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"352b7b2000cf9130eaa38d13c785b03690d328a6167d539265542300c5bbce99"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/second-bento-animation.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b406e6e5afa5bd69e489ded07d237bc58f5293e924d9a17074d9951d056766"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/union_types_extended/typescript/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe6469d4305267b960c45ffaaac0fec43c51cb1e4c33306136c0c02a7160a84"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/baml-monarch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"897a4c7f699cbf220120fc9f23cdc2d8fe2cd2bccc1e6d8745b65a53dc06b95b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/primitive_types/typescript/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0f3f6b78c1d7d1a809b63c50a9268c6f760684c1cacb52c787ba3132e9fe7a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/dev-spotlight.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e748cae5f25056006acf0110f3be8e1a6764d42c588ae9aeb33f13243c0fb55"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/bcs-auth.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c34ef9c7e96c97f2849da359a61a2d4c58db01ba15788abc7d25d43592d902"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/discord.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1192b3e41736fbafb767d06ba8ca03c0ae71052c09ed35ec2f48bf5e1f2f62"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/structured-data.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7cc700c315d8f416a1eed77530097c1615422b1161a11868b2934e68758969"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/select.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"774d1a160b3597f18a9b12914b76df7cdcfae7f0594578f7d79388ffbc90827c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/components/ui/select.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6996c86edb5ac5ca0a4d64f0853dc50caee43b8721c3c97abc176502a9c795"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/skill-results-data.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21eab818d645a44b5c994f86e3710d262e6fa729718cdbb12f25f87dc0236bc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/scripts/backfill-document-store.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e26fe772e87c7afc0f4583c1c950ccc697eb650df4e2298ca4b947bd314b8bc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/providers/user-provider.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f19716ba1844342d66d77b283c4c7fba58aa6384c2c3276e35dfb1bca48191"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-unsafe-dictionary-type.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"361641927506b9fe94c6d5ee4addb003dd5bcc37a1dfe5ab3038d91d141934f2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/util.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03411bdd5d80c4e5ffd204a09e298d3871850123bcfab42995b5c1c3ba9d3a1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/loops.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0e18f585a5b1c71f9cd2963d8a4f7f9a2cc53fc54b4938850808a061e8ebe1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/webview-media.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb2a3ccbc1f1a1a3bd7ad5307d2ec15ea3405c51dc98c756c98d6ba5a3458c3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/code.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d164352de72ea17c99d4cdfc9545fbc10fb1f46691ef55feb87327ac5adcade6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/programs/json-parser-15/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3cd474b023b09e68c6d4c18018c84df7b078f5f5fd5e6b93dad2bedb85211d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-create-modal.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0517403b9482c7fe186389e4e19b6ac70d6376ed5fb8e0ef697b4e0c383b8399"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/analysisJobsNode.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e87f47713867ee86a88f6ee5a5efcc99b5e522def50e1eea7519bcb93971db9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/editor/mdx/initialized-mdx-editor.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"829c0c3c01f74883529b07c68b189f0acf2b5e38432e7f7f7ef0641b0d5eb859"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/blog/_lib/get-posts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca58ebf8351d45d66cd5367b119c1e8a8b12660e032b05b7ce4a78d861d0820"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/useEdgeDraggable.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03845c3fc732e4211696dcee5c9daf422cf13c60c8f36a3f803c11cdda4e2b2c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/lib/db.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45eeee1d913b699f161d48fe99c20f2240af0b892e67d73a3a201cbd875ecd20"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-stdlib-matrix/src/composition.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23271000418ba7314b50453c937ad6eb62e50d68edb105294d3fbe56244117a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/programs/richards-50/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3f4e84937980aea62e76fe12b7274f7d0a9f07395949ca287e177d9836312b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/scripts/backfill-six-weeks.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5ddbc38388521f0c9dabdbae48884e32874675f5a788d0945890c0ebe8bfe4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_components/FeedbackWidget.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c40b8744835e686252540c780f311561f4f419c06a857fbdea93942388485c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/ui/dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0226770f79dc27b4eebbaa0e8eb82c5f0c9a1b2188833fed54b3d7b0ca12d4d2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/lang-pick.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5f1b52559a633fe3a6d349417c6cfdef73a60aa8e70920d8daf5b801b57a85"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/og/og-card.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83b02c83e6b3ef020f6ea38b676843e6c10b361ac66703b2c9de5c7e46e3b41"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/magicui/terminal.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58347765ff60a35e70375f6587d202143399b6553bcee80f4a862ac3e26d2d65"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/sheet.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8b13f23292a1591ea1f86eff26ba36e89193c781363d24ff2f5883be23b8bf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/eap/teammate-emails.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd653ea4e2ea0154829602f678588b42ccd36bfd0599d76867dcc5e373ea86f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/podcast/_components/next-live.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f644cccc8e451439502ae33c9672c8fbe286326513aeda87fb6dbcd83f514982"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/scroll.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73cb08570cb6d8b255e5d42ee5415ef6f0813dbd887f2d564c865e2386f7d336"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/scripts/refresh-podcast-views.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"187700d342b1d9202d9ae0cd41b02aa0a94186bf7b3c8b984905372950b0e75d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/comments/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc886d2a9946d0e637383b7321fed7d244140f3edf8741f5aa0e72e860e4aeec"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/PlaygroundProvider.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"922c4af7fda80adfeaba49b2e3807576ef65935e9c6f68baf0940341358c5421"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_components/ProblemEditor.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1719148478638a02fe2a2a6f62bf04ab16a3f399119008f6a8d149d218bebb76"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/marks.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb332c5e77d013cbaad3ea651235f1eb1515f6914c7b8729c9394c2da6b97017"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/magicui/code-block.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9689e32bab12a793428a56decee8c7f041495a17ff26510ad68b296e9435be58"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/lib/atomWithHashBase64.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8e44ca976de0cee178653cf49ddcc3e12939ccb88481c2596d202f96244852"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/stances.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de9cd0beff34910099cdebea8442d84a45be7819c8b898ced9aa746f0085e30"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-edit-context.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf0a11cdc1b385887999f62629ffc59730c0c2e6c32761d703a086205e3a540"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/bep-link-resolver.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3dcd0e5c5024bc4c67952291a2e9d9aaa8ebc3d617d21d7d8aca5243db4c927"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/scripts/populate-generated-content.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"167443b2cc70e85e1d25e5aea4ea3572042ae3cb29cf3b76491698a6d186364d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/require-safety-comment-for-type-assertion.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfa9a16871ccb950572da11177d18c983bcebeaedf29fa185b57ea937d62bcf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/code-blocks.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5eb837071e134cb8b5cfc9c7f5c1cba85931c7fb344b70710309cf6035d7e5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/media_types/typescript/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb1134091a2f51c37254994e1c083377010a43ff428545cd9d1b9c578f506b8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/_lib/metadata.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa22b573e4071b5366a7077c31438e8f44399fdb2d461dcc88511561039bfb6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/ui/toast.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9678942c5c2ac6901562d0f25783da6a2b92033fc90cc8b8856d6e766addae"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/media.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf4d5a0e9880756d3cfd22c0c4a644965bca350be2809cb6c0bdea74803abb3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/async_context_vars.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab9bbca769a3d1f4c217571c4ae95e67b10270587d5453c1b06edfbb61c3f3d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/workflow/components/WorkflowToolbar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cff3f99944cc6d320b4d354a367f7593fd6b7a60b700c904640faa120068212"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/actions/baml-sandbox.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8c8f1ee75db0ac0d89b796cc9da2e13d79e746e595aca51206081ae0488fe1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a5ab5822738f4bae539c9349a236e4d9e719bf91b8bdf2ce0049f49a48aff7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/nav-menu.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f245f53af918bd09ff446677d63bd84f531df08ecf52954ba2c91f09c337b082"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/atoms.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3091e17edfe132ca8ae66b37c5908d89329c65a4ab98becb22b725b0edb7f1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/frame.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62df5c1457095b6f26a2641d16dd30862c9638bfdcee5874d12d23f40202b9c5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/index.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c4b299b69303bae60e834fbda3e2f746e9d2c1f2ffd49ace47b5b3ab455489"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/dialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6e26923df01eade394bbde6ee411add006a839c48152fa0f3d46a47aaa73da"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-stdlib-matrix/src/components/matrix-group.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"256db73955bede1a75cc62447810fd66c8aa7842323763daac85649bc5df1455"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/telemetryReporter.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"936b65c5afb6c7aa8d6e71a94c4b649c431982fb45bf9d14c2df0da6b1ff330a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/src/components/TimingChart.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd7110299689cdd6eae0811658c69894c2566d43667eb43ab884a2e0c738762"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/literal_types/typescript/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eeba46e85d1de4a27be52bc38d57a080bcb09e33e857ee1a4c30d37010238a8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/workflow/components/WorkflowIndicator.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"330e361c4895dfcbb099d62e03e863ce306a96e677886d26828bf34942e2db5f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/podcast/_components/podcast-episodes-grid.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6b6523c610b4739b4c0e9e3aa14732b3b39f20ec05827bf20e6693eedfac27"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/components/ui/theme-toggle.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3724025a39ebd1e79f7191c076d5c34a5d19c8f43d540681a4c8e61e9970381e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/json-tree-path/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82b02d2eb81d79a499f1417d84eb4127cda75607846fdfc57a974b17cc7c7b4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/scripts/generate-lessons.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cecbe9ce41918be5cedfe67df8295581107d031be4a8dc625163440217f9d68f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/theme-toggle.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9586f1fe4fe57b3af6eb03353705e5cd44e6e6c2aab5375cb7277de67c3d35f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/prompt-preview-content.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eabdc23c0328e48a7fb431611d2ad1d86ff41feebd5f0058a85969913fcf66c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/scripts/prep-wasm-publish.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62cdf78831498fc80ada2d7deed3ccfcb0b21b8079a5ac4bdd0c9f130fcb4168"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/src/components/ui/table.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92be3db9a77c286b0e875b8d3feb80b66a3a0e943b02a8c664f8cc75d361c671"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/phase.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f91b076d09be883e91d576d7240c7749b4d9874d21b568220ce190ff10ee050"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/podcast/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7150b033a4795110108c8569946514d92715015e4cfaa87b180aef3581c47808"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar/scripts/assemble-mirror.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5177d6506b86a536a2b6fb749349499bb034e4e4c6573281197e9bdbd6dba55a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-add-page-modal.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd7a0b725d7f028023ab330d2b3135cc29476b21ebed59d5918b3eeb5738559"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/generated-content/release-generator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f6346781e383ff3310a0cca2435239adec324b13a50878452388e69051e809"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/api-server.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d969dd81c2770926d4776c8699369065ed503cccae1e3ed0efe0fce2ebe52c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/index.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d732d43cf2ada47bac8fd377e61667c47575648ae0fd774e13ecf55be7949e6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/code-sandbox/SandboxPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fce1739a2be533f1c265d2b7728883ab812d0765c0ff1e2630901c889830a7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/scripts/migrate-generated-content.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c95a69ccc59735d43c762f5d018bd4be9ed3fbe0efbfea70516a1827f9946d1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/magicui/markdown.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a664f1c41bc92316da022e1688846d152193c793b7e2aee3ac849f8adcbfc1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar-hljs/scripts/assemble-mirror.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e98c260ed647e71984b5893dc3ce56b34d7c0f37fef58f778755e897aae42b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar-treesitter/scripts/assemble-mirror.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47f0e35110afd75d52bcb72fa0ee0ba62a079eeff8baa8abccb9ed206c9941d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/issues/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22231f7767d1412f4c2f1965ca3fcef24ab925a352aeba513a25bd79ea66a2a9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-presence.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f9540f4ed007cbc78fd575243ddb0a05360d8e5ebf98a59fc49103b78c2883"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/scripts/generate-contract-samples.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f10dcc9495dbc3d9b65439e4b411aa9e5a46234e1d2026e0a1c70f7e0da912"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/boundary-logo.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5862981f8a919dcb67ec759e4776ece435cd71418539fdca15cd336af269e2a4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/baml-docs/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9d0a9ba35190809557cec850906440b0cc03072f1b7856faea48bcf1fc98d9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/call-chain-100x10k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f9dfcbdbeab352918a052ad5d07931c81a22d4093e1126ce58ac6eaa411622"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/lib/searchbar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4aa1564e77499f8112d71c5e20a2212eddc90bab0ce833c47e22a73ff1df87"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_components/Console.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3d8cf0cda0b38686a2475ae8b73374c84909d431126c76a29324f8cacba6fe"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/programs/agent-loop-300/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d321521491ab41027737ed8ffd776b6a849e56580497cddd2971ff1bf1be6c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/src/components/ui/card.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"125c5cca8187b48d89bd0b3cf7bd50794596a86ccd7cbb7f7baa8f678157bf00"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/nav-socials.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed12e141d2adaf609e75d90375bd4e7cdaebaefa72f5407f7c17c67217f7215"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/common/src/schemav2.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a415619013079ce715abc11a40661e1ad8fbe8f4577e154ece60faf8a2b0a7d6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/podcast/_components/hero-section.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4e2347eb0b165d4df74e0157b48e8f206319cea85390f6fc5e0b4b25374633"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/magicui/syntax-typing-animation.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"955cab67c647b3a50f61590d9a82ed186386210f94c00be0ddf1cd57fa5ea4c1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsStances.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d87dde9ef3c4e8728cdaabfada34e70dfdcb0332e776d0879ee7396ac3a4fda"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/preview-toolbar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a6b2ea1186537d443e50a6d226a3a9a2d3426541c1870fdcabc980eb0ff7d8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/json-request-body/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a22799071845632b6681703abc9e0fe4d7e123fe098f644252748a67840facc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-version-select.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72af27f700e62505fbb5e6adaeee626b19d29c8d4634425146d259fb6f0e6fa1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/issues/issue-list.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52ad4e74ba3308150007d97e11fc5753383697b1f6c7d2203bcf1622320d030"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/community-cards.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1706947d53ba1411bb227b0599cf0d2b8073e0e02877ccb6805a46629ab5ff93"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/beps/pull/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e11d295f1d75920288a7ccbd62ae1fb424aeef9221252a47d9d19dd475fd5b9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/eap/local-session-preview/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e44cdafa5b9d7ed7578ce111bd59dd8001e542595c015c696a7379832d0b926"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/slopPledges.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4fa0c9b25e9bc080faeb36677782e4e57be2443057f18e582456461f3b08e3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/audio.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"592f48ac818015a6b15b554cf25659fb367af537452756a950268b950f7694e5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/image.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b7410b1d340d5f3570c8eb1a5e85b78d550ca13c18e619b332e3dea8255b60"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/pdf.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"777c6cad160d294c04620316ddcf0504fabc9013f37ea2f9a3db4c5a9a39ccea"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/video.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a06be649645bc1c3e7cca77b606045ee488dc1b18a5f9b49126fa90067daaa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/fight-slop-with-slop/_components/pledge-wall.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"526e5e72e2a247c9414fa32aef12ad6c9dbebde782d87dbc9a79f86b57fb9aa5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/adopt/start.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3b8443103a6d2c653f48ce54bc13d39fa9ee20d5386c727590b8b62ef92576"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-card.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63de60651e573002b56ac3299a067df59893f5a1025e28f6286e9d730c07003"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/LanguageToBamlCodeLensProvider.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9a2d495bb26cce09597c01304e79aeb18e52ec46f93ba16b139647ce17c250"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_lib/harness.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b281a4fe5093adb5099aa0a75835b207f44a63ecb0f9196efe98c153a8fa04"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/footer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b256874fe3b0bda2555b5629aa904551dabc833889092c648a228a9bad9f8bde"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/_generated/server.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"348e85c4b03cfc29efb7165c76725f7695d73c260d813712e9506c75546f4d26"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/_generated/server.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9b065faf58e2e3fc0abb8af0fd36e82fd9f001766d1c8cfd4c8c44c0c51b23"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-kanban-card.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a5c874145a7a19836c2028b2ed51f9673755dca3618145655b7f5e9394499f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/ui/card.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d0909005e50e04830b50096c9ba7ae1ef1ffb3c235e39cc5deb0b5831057c6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/playground/spawnBamlWorker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0145a97674b507de71a99927dee3a90c553457cd32009fd9d0d7038937b45d19"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-module-mocking.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0471823a2b81c8388dc6b5e17d6d5d19892b47ad3dcd334375111e23975de8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/utils/async-queue.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a681f941aaf17ea1e01b5ebcebfdec950255e916c5eeb2e417796c554279084"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/ui.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9749dc81c519f653137ca90f4b2283a9ab17651a6448bac40d2345d19060a6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/embed/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6993a09846654fb4b579d6675764c874c31552097817b3425467b27535f00cfa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/blog/[slug]/content.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a4a5aeb65fceb1ccfa09db7f998a16eb3a2e2d060bd88e945474d0294beca7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/render-text.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2640699ece5e2cbeb00e88be1f979685a14b84151126d92450fec0fdbc7092"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/presence.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb61a368a1b7b3077414b6891fa12be4950a955e9106f711376065f0132d0a8c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/bcs-outline.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"988ccfa80991e4a42348f14ce5140c4f80a5707e23881bf7f23edf2374d99af3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/app/layout.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e739fdf0d0f243d44d42cabb20aca5edc7b3ce4cd7f66835341c0b2d6ffc264"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/[slug]/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64bf9bda095074536c1442e01a1c869e5275e4fa17b9b3b5264c57d2b884a0d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/playground/src/App.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f24285439001ba42a164cc139e9554b65b5a2fd418e8c5da09a6280a18fa152"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/static/bep-skill.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8b71a417e7444a79c64cc12f96c59c5b7b749b3daa87582973cfde24203b5a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/track.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd02d02130d388f98635f059c3919162053b97e758b7949fe2dbe68ca926a1e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/og/og-assets.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0fe7a1f4c45071168eb681a39da663a4f6b6d4254486eb1fb6c232e94af80f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/decisions/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a834c3f8f373173c6e6f73659bb91ddbf38b9021c0db2ba34016c1853b71e9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/memory/splay-2k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d8aba7c00f6fa762c87a94e626f86851a62809f8300a5c79af07e60f5509ef"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_atoms/atoms.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2546a14a5091dad8a113c7725eff19bb3a12bc74711f9e36f80a7246eb1acbd8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/editor/mdx/mdx-editor.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e932b6ae3d24676e5f0938fb08ee09cba577a0baaa36b2dc740f4071fdb0e73a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-object-parameters.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44d551bb25a7ae3b2890385e2d2c2ca6fcccb0bb352632b5586e9116c8de1a2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/bamlcodeFeedback.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc460be97c662b200e3ee5408049fe438e93cf7d5d33ddab69a33dccd6c0957d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/KeywordCompletionProvider.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e84d2a5dfd185154cba4046e684fcac5f0c42adac1cf2491d24aacc1fc172d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-unknown-returns.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3230a1ea54c4f4f7556824a39a6c4a762f00eaf2d5810c7471cc8d8bff161b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/mermaid-diagram.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9549773b34142499dc87909af00b1bc8869c83435c27ba9c51b59ad139f8d9c7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/eap/session-questions.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef69fb9ecbc5d19ab3f9b68d616dc421e46b26cf76763e148b46b992a24fe26"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/execution/hooks/useExecutionSync.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b694c007ab0aed5cab51e2d8e643d534e3c9ba66d3b45063b82fe488883dc079"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/beps-user.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e4cd83f89de74642f20a11d45304e33c62359efe9d8412584f32cf3b0b5657"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/control_flow/mermaid-sandbox/app/components/MermaidDiagram.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0b4e70c00938c9e710f9b095e0846ca4e24aca17502f87c84f5c5f666a8336"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/index.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e12cf33d922fb9c83e9cd1bfeccd1be230261a11831b237ebc32343453487b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/render-part.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2b9e8479f40deb8997fc4b5da45f9cad6d9b79f75de664c97d55f9206a3e95"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/Tree/FileViewer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88c155896e95d1029dfa5f6b637ba3792d0f1218cc6645214e359b39ecde919"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-chained-type-assertions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b40f685b89fb4e06b809248083812ead03a0462c037dc205aa4d807fc015b3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-runtime-typeof.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1213904f344ea047655fcdec69fcd7ef3bc924e07ba785acf4f90f8695d6037e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/browser.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f52cb91b176bd0544bb89beddc185dcf3d9c3b79a466a859314baf9b6ec286"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/card.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21ab9a45940aa41b6ed908eee841c130f5dc08bf3180ad9e97c302f33af7a90"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/heading-utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bd77f53e429954eab16acd41b38b9ead50f76e092b0c558d723488ac7edae0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/components/ui/card.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3ce97ff4d5834390659d725d6383eaf1db48e33b37a5317b035fddb2e051c8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pkg_boundaryml_com/lib/pkg-boundaryml-com-stack.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed971492031eb98c6b8ba655659e6e1f739b487c34e6a54eacb7bf010d8c5fe4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/logos.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b85dc4f9669ff14d38c98859547678e6151bb9cbc6f4215c90ab20db8ae895"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/rehype-highlight-code.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94591df6438283bf9a57cae2489bd1f69d5d1844469a946fa24c9fb5bfbf11ac"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/_components/ExampleProjectCard.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cb8982c2a171ed617c9c47a75ec803934965b5591276ff3e99613dc0ef69d3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/layout.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc8298610834eebd1bd9730126044c08c2a6554be46aff1f107c8b75285a3f1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/bcs-convex.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fbffea134991c9dab621a49cd2dab9a30a8c35a2a9d8e931874f6aabdfde78"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/podcast/_components/episode-art.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b383262154e8b5cd6174a2828fba2f79d93bb07d2996fef212f9307476ef44"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/Tree/Node.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3299507065596f82f11df63cb4bb8ce425e5da2003d23a0af7f4504ba8bd6c8c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/bcs/shared.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0b4bbb5609a8302465bc40ec39fe383d21f01f68866a50466b0ce09bfeeab3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/LongText.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b42d9e2619dcd1ec32864a429348e51383c7c6c838082d8879e355986ac0048"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1038517e8369db6d7c8e118513e9e8bb70796d2acc8c7add406b5a3b6d5faeff"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/podcast/_components/episodes-carousel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6a6412eec5ee88ad8783c7c28643c16540804b0e2a8c8ad27fabdef3f0da1a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/hero.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f5b6c76694aebc4de73ec13bffb6cc1c7b820d7f89f3c571294dd180af75ab"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-unknown-parameters.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf0b4a4b898ae6c1d1e1d7df742951bdcb0726114e38ab0d9c26e62e8bbbc61"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/nav.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f539d1861b5658b2a5f323d30ef1e66c83862e3ea15432a897f2af79a6bb62b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/layout.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c73fb2dac938ddd39d52340bec90f456f556fa2d6302f3a78b6bf084b850c8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/bcs/[number]/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e9207eedffbf24a89c19a52649d88e54c4d738b4a960208013a145d72ea43e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/layout.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c140cf296e12efb2baeb1466857b4ce49a4019ead6d17d61230e760e98364a11"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/api/og/route.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d857a2bf02c4d96f33e1692a15a458a04551ed0fec327a75565fd519fec9509b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/statement.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9776335a8c512d4a39d1d0951633da04918dc65c98e187dfcebda2a2aa6f49"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/_components/EditableText.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"742bd9193787c6c912d6a113fdc9515c72201c420c1fbfe53c04ac8f6e9587b4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/components/api-keys-dialog/api-key-status.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac50e0d3240f72f8c1d822c211c5c472c32382bd0a60adf75379f96a264590fe"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/atomWithDebounce.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65fd72cce019cc31b28e9947f13cfae3119125ac0ce550738a24d00f3906cc7a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/tabs.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8af71abe3c85f2feb132bd7bfc7cea77576463a1ae68ad53cf6f13e7db3d1bd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/podcast/youtube-views.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb56d61c0c5b2770dcb6f82c76a0311707092f0a37e49ba852ab8891f290e12d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/ui/tabs.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98fc1ee56be0f7894de4d9fd9d81634b4ac31d10058bebc032e1c3e432afc604"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/rehype-preserve-code-props.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a837a7b77ab7fa0490ab7a6954de4ebaeb84853581e8843b909e2dbdc62b17a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91a96fa30e9eb48b492d4f44116527a12c60a37cad8c44e2f6b47bbbfa975d5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/scripts/promote-document-alias.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0daec877455c369a2e0ed10183ec34c9d4941e10edab946c5dd48ec815919c99"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/blog/_lib/topics.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"463af5919dbafc533fedb215af2a21aabf50f2e25ec59af007a993e0247dcafc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/blog/rss.xml/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc263fb12748f35966d3180114c72b3d08c91988474203cd118cab9198538cf3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/SplitPreview.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"972d8fdbfac8f4a042c44ac1e81a62daf90ff5561e669e4bc51ee553a650bcc1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/magicui/utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cf93e5abc5264f2169d0d64399beee40b1a5381b10288925ab404c1d3a63e6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/bcs/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14899daa7a3e54e01a1e019de6bfd1965fc5f2776ad3366f7efe8ddb8ca97694"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/api/completion/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1a2f2de0ca530e9006d650ecbe6297091141de43a046820325aa43fa961529"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/decisions/decision-list.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8d6db7c48e137efcecc2b2a4d37b2969ab8c3c5a11cc3438410177ab15c4b3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/prompt-preview-curl.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"022a852c4ae57fc9fe2638f356472052f8fc15b231ba28c1e3567eecba4b0980"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/middleware.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e61afd458628cca3db7bfb5bfa6bce29a34e08044de0596600c8c3d80ad0e8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/_components/PosthogProvider.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"317b7a01f5f359cd8ab9e3d9f8092bf883eadc83d8183957d40a70b42468f634"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/wasm/internals.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b33f0b7ca52be5a733957659294f88e4f17d72484b8ef852d7f7a592ea7ad5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/contents.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c0d484394e5720034c448476a494ff80b7360dfaefabaa06b0fcb0822a17aa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/edit/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a55c4c88a7fe4410577246744ff10d364fdf420ea76181c7146e4d51b28b17"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/lexical-type-parameters.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"605690946b38cf6704ce6f090676ef0cface0279bbeebc25dc4919423d949034"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/app/layout.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98135ca06abd7fa5e4e726a306968c52c42e1b330b06c2690abed63b08b34f72"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/database-url.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aad3a89fd2ac37b445c5621fc0f68e151c63d12809327889916bf9bbfe3a59a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/seen-enough.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2901b5059851536e856386c068371572945d64ee03257a27e5aac52fcb4b82"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-linked-badges.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab62748b5667e5cbcd9b0b0f0949c368c91008297bd34ca2aabfef6b739e3ff"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/luma-answers.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a162ef2f461367a1bd2e931cb51fccd4510468da62c9bd1eee12b60095ad9ef"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/common/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffcc640524e4cf658e2765ee7347369ef1e57ae50d50f21f6eb662d9dca6cf7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/alert.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f71f626abf08bb3ccb505c2030ffb74d9ed4a153f52b9366ef9b1f222122a3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/term.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6dd2e80187ca8b28a9d27bd5c1fada3c1fa3ed57ec170c25947acbd2e64781d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/src/components/ui/button.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"801fbcc2a524576332ebeb1b61bacd23a260af943180f81fef0cdd642a27fcfd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/eap/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea2bd5f2ae0abe40e8ef460f38278511846d9eb5dd4e3a559bd117b28490730"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/early-access-banner.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00db847fd3f59b79d60eb7c55822695a25eb2fc4ed69e0d4600fb3be3686018"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar/scripts/sync.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"972c35037ba56d6f770cdac074ed98594a1e4e21394f4e776b12aaa13b78c6c9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/typescript/bridge_typescript_web/typescript_src/platform.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2c99f986e3a31f6030a8187ed987eb256c0d446e16d6e7d68aea09c1c754a8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/badge.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99251ef6913bb3652a0d952e8f696b4c28591c0ea290336dfb6582f1b7dd4d8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/button.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"541203cc136f4e19c84c8d37447292cf068b1e27b190f13639327dbf22dca216"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/components/ui/button.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fe492156a2a466d4da0de1b43ee2b360c09807190313b4ac243f2a54a6efbf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/api/markdown-page/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ca53c69504f5e4842559f749057b633d948bcaac798a8ead9af3f2113ca3bb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/typescript/bridge_typescript_web/scripts/sync-wasm-declarations.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"148d5e4493a5290cdc18bda130898ba22bf9022267dd17baaa5f8d6c20dcfef5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/nbody-20k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea016020e70870e68638204ae41d60ded5e18438f93750cb862ae45fc521770b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/avatar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc16615485001ea3fa47debe9f72f9a1f0ad3d6abb364ca83d68968f424fe08e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/proposal-fields.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9870bb9af43031aeb341a7bcdce7c09940ab310837180a6a938b471976f9d40a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/quickstart/_components/commands.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dbe538fb1733a2c333b08b1d6662a2a7cd092d806c6f0bf836ac1dd86a6fa1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/ui/resizable.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0d9866d141907eb34bd0036dd2598efb1dd2f1167f537ed5f52ca3d9e7f492"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/typescript/bridge_typescript_web/scripts/sync-node-runtime.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97ba22b36b777d7cd8d264d50eb7db7f4d5fb15be789f88f44aea1b15352cf7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/control_flow/mermaid-sandbox/app/components/HeaderFileWatcher.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fef74eebcc30bb4ce44b1648ea534c66279628e94725d0d3daf69ca2d4968e8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/actions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb46194e5ac4f2b9610bd226d7eed769db0f444b7beb1505f3576d6b16caf44d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/token/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e83329f442c74cea9757a7577fa0f8abc7392784d196ce67ce9c4dddf85854"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ae56eba93d9d97c760a5d37dc70b20935feea258f14a4f438aa5695b49b408"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/founder-note.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"102e92345307a6bf65259a4a6a29c67e39a464eca1abcce6e5bbd6d2cf8f62f1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/mark.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e76f4ea6b11813bf06166156542a05c9629d3e518efe7f569c1a28a273e4f9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/schema.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee3242f8e98f9099aa1d97a7ed7b35c5be936e6a1384568638c229f8484c79d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/add/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ada9347f75d22877e132d373ffc5cf11b8b540a81a721dfc0c71cc82520b81"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-unknown-type-aliases.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20808c01053efc4fef526dcda956c589427f03ee99932ee575e51e88a7f76d68"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/control_flow/mermaid-sandbox/app/api/watch/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88811dff1954ade13d4f7e157d9c636fd57a6725aad5b294da31ba4bc604b8ed"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/panels/StatusBarPanel.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0b4d4c2160e5d8edcd3cb0bb49c8728c591e05124e4a4c7112345388f027df"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/scripts/inspect-generated-content.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8983fe4648ed89890356d5dd38aec7b9e4f0115db97bdd1e058a90e04e0d959b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lessons/watcher.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fefec0e161eb1ba205b2b6c9eaad23b3a2d28b912aa44b9cec56568f815e1d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/bfcl/_loader/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9404084ee46d88dc013c8569582c528cab523d87d3fb04fd0e47005dfbdc4c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/signup.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d693d56abc0c28025173bbcb138cecebbf7d2bd443a8abc89eefc0b4083649e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/effect/rules/no-service-constructor-imports.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d271148d918b51885aa427178bc79d6fac1983074c349e09a20fa20df6113633"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/src/components/ui/badge.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f35ac762c42e2be841c625ec6634ecd450e62945f9f7d49caa2ea5da87dcd0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_lib/progress.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53371e70ee5301100d70dbdd64865afd8e3437883bda7674f02dc14cd386c71c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceebc808cdfdb4120ed331812ee8f2e9cdacd9288b6d7548ae68405e30b75620"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-good-reference-toggle.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86d332d78858afcae6fef6da04129ef6bfba8a58afd74206053b5a304eb5a75"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/json-ndjson-events/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6cccf2053c0a64f4be7dfaf18adf3a3a391d8306cfd4022585c6497d59ad06"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/_components/BrandedLoading.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"838906f735ab6e72afca26c27212779173881f686d8051ddd8ac95fb6d13e39a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/raw/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6bc4ae2ced0ee75c4efb11642a53f5eaeab4303c35f4ffce1ef503adcd869a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/fight-slop-with-slop/_components/war-epilogue.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fcfdda23255c1b9524941228ddcfb487628dddf2d676d713c5cc7e34f460b09"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/magicui/word-rotate.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ece667a11eb5d49125231eee43638d89637ca8225aabb7f89198b3223e7480"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-conditional-empty-object-spread.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"172a0a5c594d4b9ed93992c10bcb542359ceae411b4947b85868af4402b4ed7d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/function-parameters.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b96279c3abcecfe8757d0776f1e456f93a47fefb1a7de163c1a83d8dcd8f02f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/fight-slop-with-slop/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"156bb95fdae81fb22d67025cc18e3f29ace152e75ef2518c52653ea901944890"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07511d5db73ad31dc73ba8e202523ae47969921f9e902c955e2145d340db9b95"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/auth/github/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"090cad2b0cbff5970323945a45b1c8afe986dde860c4e86c63f0a841efa79545"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/scroll-area.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"552f85740135eb82ee921a26536ffa22136ebda884fc46bfc9337dc1eb48bda3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/book.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f34bbb911d2830f372a0ef02590a651895f60ce33c499fa387e12d9c1378095"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/ui/popover.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb398753cb39234b43647992d296b08a2d1e90c98454ca912bc1e1fb420de764"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/json-typed-orders/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be63e570f1956b79dbaf3403d9457e5c1acf99cb86b5e4e46c6be0f18e0331c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/Tree/Node.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6ef12a57293d2d3f50b6f580781a299c8a290159aca5f84906fddb0010318b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/app/opengraph-image.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f89277104c35c1bc77d9bcfa0018db6114b871264f073191359c882c5c6e5b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/components/ui/badge.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93160da177e60d8b82e63dc9f3bf2cd7794164389a56dfa6574a1e5d87c0886"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/global-not-found.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ed3cc1f9e192d26eb295a59d5e36493a46ac364c6e7e94d84078c9de01cd0a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-shape-in-symbol-names.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08610ae8ed35417610ef0846ed29d60d6877476a08c3b6251d1f213afc66812a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/fight-slop-with-slop/_components/pledge-section.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4157b4cf3866a7098623d7adff042bd1fbb3b617fb34e42478cc8e33e23382"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/ui/radio-group.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7afc16f534556cc94e8b9ba8f3524dc39a4db1f8725bbeeb9f7ce80776822da"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/hashes.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ca6592407b369c9090dc8285fdd2bb2a1784a18d20feab5418f18aafbe9203"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/token/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65adccacbedd15be2dda5307c32b9da670f313719e7373dfadfac4bd9eb9121d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/components/issues/pipeline-strip.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a8921b94915e0ac2e95c3894767d685d1ba34981672a676ca2464d52b767dd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/council.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3c4fccd4047e577b08a66fcc012797a6992e00ff26b52bab227dfcd9a70394"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/triggers.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d81384196716823153c0f93e9378257486446895e20c2bcfebfa8799e052f4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/request/sse-server.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27c425087f037c42cd86cf456576f25ec189e4b2058000f57735080cab144ba"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/third-bento-animation.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d410bd300b0061cdb3da297de7f11626e3777b2202478cb88016c1c90c716a1b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/env.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa7e12314a36a7300a5d706b1a4a989ca9f83f218a208ac3f2d5c3da8b3ed76"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/merge-sort-20k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c01732d92c967950c7666c2c3dacbc9544904df496b2a0eeb4adf5e70a0458"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_components/GithubStars.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7bd93871e5a7960f70dfa8c90a2cdb2777ead78f0ff023d7735e8599df177d3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/Tree/FileViewer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b9d0678a688d702ef7c096efbcdb095af92c7cb401830837813ec5b2ac9602"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/components/issues/issue-status.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da76f1fbad8952bad4c686515c676bf6099366ba7cca30d515e1a401e706f4f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/code-sandbox/useCodeSandbox.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4bf5000d3bae074f33468e256b0a649aea7ecd0a6d3e29e1b3853665658581"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/quick-sort-3way-1k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"669a7eb272bd5eccaff668a9099a9d83c31e1efd27c7f8c9df3659c1e7b70718"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4827de7925eb3d770cb72c9d8ed299d18221dae950ff61edbc903ee0a4a7235d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_lib/code-palette.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"927cd74d412bbd5def5ded3879aaa51f07700f05a1e49e16765601e29f3aba9b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/instrumentation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c9e2e720d9b15de9bb0a5870938536366989632f4de5efdcb4d87cd28447af"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/version-badge.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"697e0d6e89830a26ac1d572972aff4edcae1bf274866e6bf30276f8b2423d03e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/eap/local-session-preview/action.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d438838cf7502217b51b940d0a96ebda93c67b68f2190b31b21e70dd0490890"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/story.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"635ec8206e8ca4a60c759063b0a64e70aa3ce764f012c22deab3af8527c884d8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/render-prompt.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8f3ba99802a2c46c6f4cefd6d62f135b29c237414535d4ac5295198ca5155c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_components/solve-layout.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23778ff25faf69c8b999c26518d374719036b8755a7d0f89ce81a97c0e8a602c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/json-aggregate-2k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"562377eddcdcce0e1900a0e9034e5a71d0e22f5b0dc8ddc735f02654e9ed3b56"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/team-only.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb1df8f0fda8471cb82cfcdc6c916735751c3d0bc5e0c1a041d3f2edbd091a3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/code-sandbox/AnsiText.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba27f9e3fd7f6b6c40828b8e2d9a973be4c6845a53f10fd3abe6e509e5591b59"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/PostHogPageView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aaee365e20f236ca14da97c353033e18163c96b8fc092fc47cbe33c77825dea"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/sheep-council/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c00ac5ad79d84602ce08ec9c8b200fdf860a498aad958557032f711f43c02b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/utils/AnsiText.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fa581941b3bd2b44dc9f55770fbb8d7dacca4a7ce8c4fe14b0177e1a1ed6d7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/wasm/error/panic.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94afcb26ca9a310754ff98d145e941c18ca402d69a395f71248589a87e38337f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/reflect-method.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3205979a3e8daad2d7966d3eac5accbee0b4245bb5b051cb791b36660bf1cc79"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/interfaces/mint-classes-with-impls-200/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba688ce8d79568dd0e3f0e81361200b28341bba30093cd1ebf4af834a966d9a0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/safe_imports.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a76a5aa33c4af6d44da34e70b5aabec48256c90c8500e88d5d199e4ee29c4d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/app/apple-icon.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c8fe7f857b44145d7ec66c8d935808f988b55b4d6e94c8b6922dcbe6625990"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/techdocs/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46366921100c4825c09531d5fc040c8b9532c6ed853c4a1b7ed3d0b1518746fe"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/adopt/highlight.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72d052aa611dae181dfe358ee235ea894e975324abf46c555088fdc3191481f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/bfcl/_components/LoadingBar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1af38d02fd8e2d39fc2efdf529dad3d77cd526e7f91bfb2c619038edd4fe748"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/control_flow/mermaid-sandbox/app/layout.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2074630f37ffb75de2e64f0193479229976aa5c17048eccd0c4bacc414fd302"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/playground/src/main.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfac402197ea21d1ec1d83daf4551f0bbce3f8bb07c02708e38ac9dbe4ded9c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/token/copy-token.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab65b53eb26c3c1c555bb72d3f8073cc7bae3e042e376fef788619cf6a8bb7c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/scripts/generate-code-annotations.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00135c0ea657ba1aad6a18420e476e09182da0f03756e7e4753be85ab75b97e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/components/issues/stat-tiles.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85bc24ab16bec07b37c78d4075b9a58a66f5b5ee3a674444e89586128ac03561"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/src/speedtest/drivers/driver.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb8f6f7f1c4f67a42a31cfd863459fe2469b7a9437a014cb508376d672cfd7c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/_components/BrowseSheet.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c321a39edf417ae0aba7b5339d53fa2b2828f37d6ded39faea71d007c7e50d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-status.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e9020a120fb1dd74ab10af1071b27f458c03ebf6929966aa7e6dfce3ce9474"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/fonts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f34a3b0463de150a096b0f0ab17fa05da3ab346aeccaea4c0e61702251329d9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/k-nucleotide-25k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5183d20d37e9c2de6fec582fc360ed59bbe2ed6809cf550867fef4c10806e9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/popover.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43b275c6770c32e6e4327684abc3243b36adeb0fdce6bf309ef9cb5fc1aafe0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/session-time.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e51bcb4b2fb542dc475b3c793a9ac3c54b873e44800eafe66f138c8e397a3d6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2af04900bfe96d42c711132c356efed20688bbfb1832292c76e9b149dc9b57"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/hooks/command-s.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd1e3648daa2871c5aee0d7db32008c987fb5ccab35a727f03dcca1e38879c8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/checkbox.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f159c14b6b796824d1d1bc4f7e870f3e25d1a1bd90958792206aaec1b47d8d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/hooks/use-theme.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fdf33f0127c85e6cb7e9122bcfa9502fa5266c1a08f3d8fccf693d6fe07e8d7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/app/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2287834c2e8eab9a4871f4a6ace16d2cc76b854e6549c006874c22922ab4fdf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/video.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3671da2284ead762e3a98a97802f4a03ab9b53227aaad826402994151ff237b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/memory/live-heap/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0774e4fe2eb7cf6b64b1a453510a203855ea7755a55e032bbb8968e605cdf4b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/[number]/tracking.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1902bfca64beaee0c2949b37e81dd006596d2799f055701c3cea50230c2f18"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/app/manifest.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20054975ef149a06c7cbd06cf3d2a4960fed9b2fe8aa314ee9491592d00da78b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/components/site-footer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d1d51e06826a7c7b97daa717997002f1329829042ac1f568af0563388898e8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/boundary-alt.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc2bd4d7addacd9553e79d31b2e1ed9dbb7d4addfd483179d950ed356bcb4f7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/interfaces/to-string-interpolation-10k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf139730f502dd7e6b1e805aa181906dce7d49a373ecc435b1cef1fa7ccdc1c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/generated-content/allowlist.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"015aac8dc4cedeb4a5985517138b7d1e32ce58110d06e004456d9c869288d90b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-reflect-apply.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7ff18a5bcbf23e5232e2153e5aa4e212979fd2477ea88d96a39ca9ff2ef45f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-reflect-get.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"741f708b109ad41aef7c8ee2b64ed5cf99eac7c7ee0a02b9c39f0bd74b671672"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_components/WorkbenchLazy.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df299e77b3b780188efb1852f4556027130d9b1e051fb2078d2da48b6cd68f0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/blog/_lib/shell.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab903185759e01708d2f75256c9dac7169a9ed3f3a90e7b25a6b7b23c246ea7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/ui/separator.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1085553a2a4a6b021b98cb2e28d13eb20d61b64ac6311720c7dc29c5750f11"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/signup-email.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0971e36e225775d830714fc79ca6b4c72a7cda4fc06ad28808344ddfd8e34f4a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/serverSecret.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fde5f7020865044f753028a23d2a572b4dd982c7da8e015be247e4081fc82ea"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bcs-link.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"204293567e7028b69ebb601377fb9f3a5c761a624558eb8dd7e87586d6b19533"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/context/analytics.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8a196e573838e3f2711fdabf3d49cad8d95d0612a65c88f8505a4f254a0ed7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/web-vitals.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ad57ca2b8e3be26ac92a4e8821d43b98705f0f90da47df6475d88d845864fd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/new/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b491726053d327eb577434eb100d7d7dab127d40fcfd273f63a9d6eb6330ab"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/label.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbc907338d2fb47a455e33a79e2fde304e2469ba6b0975805b812106103cbb2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/app/robots.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0e34ff406d8a151078b9017b44ca4b1815763dafa926c467293efda2e390b9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/ui/label.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b882adc2ac1a4f277fc19e596be802ec21ebe60a27ccc79dd2ad8cfbf915698"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/remark-code-metadata.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0be2bda4cebaa3e1eca45cbdc7e2979032ed1cf20866562ee3a2349f1661d4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/typescript/src/_templates/globals.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde21eb78b731ad881cd6ac597a56a44dfd55852a8921633883ea26662b2f8d2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/adopt/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7439097b58c5540f891c05eafdb627b89424810b92fb62c01835a298826243bc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/how-baml-works/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1b7c956b4255e0a249c64ccc568fdc19fa8142e643fb5ded982c6cb76706db"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/page-shell.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21399c80e6ad055abf53d956a456598dac32ae0d7d5a30766ef30a2fa920b941"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/ui/input.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ead40320d35a7d0301eb5a42cea33745108a1afed1b94315b6f040807389d7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_components/ExploreProjects.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"338ea4cd47bbf30b556388e3e01c5df71d5306cdabcae32a1dfa4de212dd04ad"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/bcs/unavailable.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f60b99b1739994f047bbdc1edda4c26a08b48828fc5ed345759d114f5fb3ca"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/app/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4684a9b2e1eba30cbb4138e7deced6369b464e2aba71e102377e91ea5e0c701"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_components/difficulty.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b74c16767af097f39033578290e4a24be7fd7954b6b3fdf51a9b39a7761f0c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/Jotai.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b563170caea474ed88bc38cf1f2950c7d6e6b6264a5ad909b93ac7ef5686a92c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/_generated/api.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fff448592f43bb484d1a58c71812d62f170d3454619fe516d9f281afae1c74"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/_generated/api.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b5d9ffeb9070f66d7ec68f4df8e9669daec8e7591b5a753382d616acc308e6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/posthog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9857bb44809e578a0177dc82aec3ef343cb0a0dd59b7c429d593f883860326"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/interfaces/iterator-pipeline-30k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5d84eabe76172c67a8c0c6d1144322b1067d2e5ea4c215402b61fdca1915d0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/memory/cycles-into-live/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30a8339b3803f3bbd9029e2a30fff2546c02b2f3d18607e087389e78248ac72"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/memory/cyclic-churn/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"322186bc7de0b50dc8f2fde27acb0a991c2f16fa688f5a8049190eeee0e5a117"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/input.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f70960698b41fb47b686066ac65d46fb721c40d5dc3ebbd091f6f364609103"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/textarea.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"063b685840baabf8e07c24875ef8e7b138c087349a82782988f7b50069e58e96"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/app/baml/book/layout.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ca17feb615301a01706b0498f2aa7ae6fbf4b12bd0f1a6f639b1ea068bbf55"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/components/ui/input.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d206391666293d29a5cfc74a8edf9ed8c611dfe327813d146f1526887ba48024"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/blog/_lib/format.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36fe06f30b020c63b3f1b3ce8ab1758b2c3044598a8b23467362ab1865d05056"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/shared/log-decorations.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ba616a99cb530adf127cf7c3ba9876eece3f6168fdb668531ad1067eb67a36"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/memory/allocation-high-retention/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc07be37edfe0a62fc017f50bbe1196de1f4e80a033c7607f46bfb7d121e66f4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/memory/allocation-low-retention/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c0d3d360403b51d7296793d4e34243d730c4527d53042cff94c7e410933956"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/lib/base64.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce712b489225ccf20c53157583f88179d8a29e4c8ed875fd9d510a1ccfc5b2e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/database.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d37839d2af26571db3fa71f4ff1001b6d75d249b6de9b9b910e93624ca3908"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/interfaces/enum-equals-100k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2c09000447819f9064387abb90bc6de96d701f39f630d3debf338ed7d5d046"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/interfaces/generic-from-json-20k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8247df978806220092beb9eeaa72a65c59f3aba4ce20b8ad02970ea03bd7f8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/string/join-request-line-10k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e8c09289c868e545a2829a39fe3435883fb9382a92e9486e82d959272c5aef"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/string/plus-request-line-10k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a5d04fc2efe27c9051db1e346ee5df7455fb4b7e7c517c7bb7ad77af7658dd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/string/template-request-line-10k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c39594328ab745ea9df00f1c5869592ce51d1468a32d41a01bb0e7fec74c898"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/utils/getUri.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a4f20c5b6ac6c554c0362cc34767b4b99cda160a76efdc8d59049e58c20952"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/bfcl/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2ac0f38def2e043267948259a90b8396f7d8cf782197fbcfa4490afc3bffa5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/EventValueDisplay.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb3c50f1554e892f5e61fe6fa2f95f65ab7e7ef7dcb1d404191bf73b02a86ff"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/typescript/bridge_typescript_web/scripts/build-wasm-release.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ee0889043ddd0df0e01b0582bfb1bbc5420fa6feb7c22d9f332322d38da2d0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/helpers/get-open-file.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c7f0b0af8ea2a39afe3dbb57e6aad8110d15c49937ac87234f57df15cb548c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/theme/ThemeProvider.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc654634e3b19b56c7b9042bebcecabd1cad7b6424e944feb3b2d07de01dda7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/pricing/layout.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e009abe8604ec5bc57583c10d449af771dee526d902128a75f4e4c14f7675505"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/jsonl-loader.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46575e5a0240a2b9c98654c6caf7eb0112b193eaa483a1f5d90e9ead90d5df1f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/markdown-pages.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d973c350bec1fca358a54acb5557fb329708dbba735c3f7ce1d2a4c23ac2eec"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/lib/format-number.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf7239fd36d6639f23d2aa05ea95d7a570f3045617acedd3b09d0481568811d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/beps/[number]/layout.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a79d24ade96754b76a9cf299863c22ee92b19578d9369c8298065b16c973aa8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/concurrency/shared-array-1w-4r/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f899f8fb464c0dc018da329e36d30e900fdb54e7d9f1144f73b7a36dfc539f7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/memory/heap-calls/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a45033771c2a83f7e96e1e667625549caf710637b58b3aee7cd9ed96ed9b6f5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/utils/getNonce.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab86a2a7d6974d17fc519e6cb1b2040be0c92fd66ef319d0b7b2c9c5cbfb477"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/string/template-two-strings-10k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0464e6ff01e34ba7970d97ca5443020bf683a9618b2abeac35a63133be5a88f2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/components/brand-mark.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f67081aef68cce4c33ddac0e18bbda163ba487bdaa47d4362cc0a3879b8d05"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/components/theme-provider.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79043367457b59346f9e5c9b68cd4aa7f4fca559d57a2c97e7551cf072e5d3f3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/app/layout.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d8a99e70cb2b3b04bb8f13a04813b65370c038384c66a1968967b497d5b35e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/force-dark.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7643afd55918c5fced432e9002e98ae8ace244eb13f1259d7e48031a8234224"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/mixed-ops-5k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"172f5e8c51ddf7f6c666d05099c5b83f96f57b2e93997144f4cc43c888f12041"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/memory/binary-trees-14/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc81c39763f3b8fcc46160f6f603120eee8c1dd467e0463345392ac48357d14"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/hooks/use-debounce.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93ff1296ab11c0b5fb97e1d81a335f2d177ffa5273ae479faf3e1ab4bb8c865"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/skeleton.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e102633d0a3d56087302c64ba4a74027dfe6e207bb5619ff9511db367cf1c23c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/app/api/generated-versions/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08adc44b47afc83ecfe89882d074f023acab689043fc1eebbc95a33ad300c672"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/app/issues/[id]/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15512455be5c43ec8654f4796c721dce58ba689936d498842bab98a94bea24c0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/scripts/send-slack-report.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"239fa9079bab51bff6e32397d19d3ad8715307c1c121bd800d2931cd7bc0438f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/note.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ebd318f65120881bbcbaaeb53a824416d0685fa44b8c2c5ab8f829f96957a8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/wide-nested-class-create-50k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee7a4f5509a11faccf6d84cbf9e91ad27ee22f7420fd351187d99b3fe1f6246"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/concurrency/parallel-sum-4x250k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82eb18dd8bd97928a65645895c52d6a536e6a2941abfba7cc628f56b18eefbe"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/memory/live-walk/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55146e6bb0af1f4840e4111090586fa13f9feb3aed8382973bf5bee8b10c49b4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a9f46983acb7ac9de2be92bc2cdf8f05b9062fed850dedb6760bba8841c2b0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/global-error.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c10d7fceef66faa878ec1fb909d28d180347e49ff8c12a6002168ccb930196"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/instrumentation-client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aca822bcb53bf6df5d7920bc65bf88fef3e813652143abd7061b3cb2ac4bdfd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/prompt-render-wrapper.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a76e6b8c23d8bc5e45f10ccbe23a01e9292a77712ea81fdc3ff67937ca6139b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/tip.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b066c9923fcb077367b3f912bcd874ca14bf0eed8ae528f74919986fbcfd27c9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/pkg_boundaryml_com/bin/pkg_boundaryml_com.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"590e004d37665b9996ef04876370dacdff26b5deef68b977323ada2baf7c7c60"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/public/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f145cec3e2b4695976c0966e92905ed095010d3e0bd5192a502456f22dfffb2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/bcs/session/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d98d801987c0b8de95712c18fb2854fdc0459ca3d8371fbfb7670f29e1ade76"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/effect/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2e35c9c08fb1f6aea6d8d2ce446786893c2bda491338d7a9f2a5be8c7b2edf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/chart-image.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6262c87075d7daf2b4c5d83368dfafffecfdd7e6c9135be53326b14ebedcf2e3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/pages/_document.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa595686aa4a0fece3141fd64795ac0bb66224b09b3456d389625ee570d559e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/bamlcode/_components/Statement.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b670db40a8f3b297bf93581343a3c21abdd6694f3d6d376452b43d168c7b7b74"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/interfaces/field-access-100k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"422c0315cd6535f37803286ed65a34033b270cfa4fd44f4955dfc608bff7d579"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/wasm/error/WasmPanicRegistry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bf881febfba40b77d22e3558c20b9df7c4f80a94bf57bede4f8fe0bc4b996a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/src/main.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf926d577aaf29fd6c94c32956902b9d284fc4558be87da57f9af787a83f521"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-vscode-ext/src/utils/getNonce.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b589720ddc72dff163a3d77fbdd6c94e32b2a3f5f09e90424abdffff2e8b029"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-vscode-ext/src/utils/getUri.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6f3a745cf9bae881414eff944c506870691410aedb69cbf9ba71c96450e8b9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-vscode-webview/src/main.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9a8fb92d1c7c0ae7263c3541826f2e353f541b75fb2fc68b7296f6419e84b0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/analytics.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f338981905fc8e1ed613d19a10c418deab9ae047cc1ab28216493f241ed0560"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/array-traversal-8k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1f6919da38b01a3f02f0c8220112143f94bec41c365dbfd4e09a9755c65ea3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/concurrency/shared-array-push-4x25k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"feaffdb16f20740487c9f8299f8b626bad880e0bb95133b4fa12dba072a28c08"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/not-found.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c4592e9215a549a550ea154f11ab96de202177ef0cebf22e9d8665ee6f2270"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/lib/format-date.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c97bcaaf8e50dd7b8b145e2098677114f1c25d52eef91cd6cb7466efa7b4896"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/bcs/logout/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b965551aafb76221fdc9c04dcc1fc6133005d5a48dd18c21a216dce177d003b5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/collapsible.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f60fa6ca0b339df0d2216669d10a4408b5df11846dbdb677854da7748fae36d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/typescript/sdkgen_typescript_shared/src/experimental_facade.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd544079ca039081afada1ec012bce20aec6c949b372828e529d15b9d4d6ae3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/generate-sort-8k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fff1fddca6a6db6c680238358fd322feced742c9624ac4fa0a594f5d8c1aea5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/_components/ClientProjectView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38207be8b7cf68bf7953b6e0382cc5fbf324f30e298562d3aa0d96bee0ff5656"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/providers/convex-provider.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c70d7d3b39eb9ac8e3136725168ec4a90a0344f69d6a3520ef9bf7b573fb963"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/shiki-themes.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b48af1c4f2d2a167b4638677e99835d5f707f9de6492b6bb2c37531e3a7142b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/BamlBlockClient.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2539c4d962de85c120a2d725c31ca5368730f8bc77e9e7e105fdb5654ea19227"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/concurrency/parallel-sleep-3x200ms/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"364511052c349ae2c757d604d640cff64424643bdd89d7726ac1a17d817d1394"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/concurrency/spawn-fan-out-100/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd55cf0c55629b8574900949e49f37d7396c3b9cc4d5e1847212a1fb62f175f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/interfaces/match-dispatch-100k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"322543952a9f84f96492ca441e523bd8145e3d7f57810667482040496345f5d4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/_components/ThemeProvider.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c005029727167b914d45f502ab5c71396a086c0a26998767f4d22a617e948de"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/typescript/bridge_typescript_web/scripts/prepare-wasm-package.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ed4b38e79329d53a38a22e78158c9dea1fc1d9c3cd969681e4d4f845b8ea17"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/array-build-sum-100k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3878768b375c44d39adc1d99e62db3b7156200613193919541d273f98a386965"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/bubble-sort-5k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb683bea4bfd7a194cf2147904b11f35adf1a3d95d63da3499eef0c0a120eed"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/closure-apply-1m/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbed5350c52db00ef97f195adfbe9d96b7d7898d681a24a5dd84f4c4c8431c9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/generic-apply-inferred-1m/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c47dab0ae3f518901a2fae97a55b0b330e835bcf84aa763a12a705c866678d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/grid-alloc-1000x100/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e927a5aa367850f8873db0d1948c90305087a8fc050d4cda7ab77c32588f7b5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/nested-field-access-500k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b5bfb35376e9d73980f6be206553d59e473170e70003c18c661297d74655c8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/interfaces/default-method-100k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11af854d74db65582d09ca804ecaaa78862ba61d230dafe088650545807e185"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/interfaces/polymorphic-dispatch-100k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc918b6408044d3fa8b2f055d72f450495fd9458b41b635e1385796313130656"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/string/contains-medium-literal-100k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"394d585f3412e28f872d0c90054137c148d4af86f98154e112418e40d641c2ae"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/string/split-long-literal-1k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a0dc6977785f8cb3dd15b7585c1f085476ec0af54612f8a2c4ec6975eb6560"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/string/split-medium-literal-10k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73220496cd8cc3ef3e04e4fa0a6e49d6a3755ce53ba86698d8cb2a30c25665d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/string/split-short-literal-100k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c9eae2c6b264c12dd26100aa458652d18221c7dbf6fefbfd700e1f26476b35"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/lib/format-percent.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65eef9a657e26fc7fd68d5ef75de9f22549c16acd39365202fa695a875086f8e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/app/baml/book/common-programming-concepts/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7edd7fc12ac4d38bb673376af587e3f28d48f6e956f4771bfe8b803cbdab7e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/app/baml/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e41ede4ab45fee2f479a4e4ded3b7c3d4739f63e1b163e68215c04f8896ff4e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/collatz-100k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afff47d11ec3c098f2cfd6324e3baaab444a959351fd3e746401f59710f03e5a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/divide-guard-1m/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30d5ed233f55835053404ba60ddd1c3eae7702951866ecd3ec8b442e48d9cae"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/fib-iterative-100k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"464d23c8305f142b7ad89fd656dd3307e954a1716f4fd3052a49ab114d844531"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/guard-clauses-1m/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b142c3cb3c0dba2bf7120d23fd1cd805a168c88bb33aa1a65c81fb03ad8082"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/if-else-dispatch-1m/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2d1b4b244b6fd5665d07f50b8834b25bbbae717cc631efb4156b9bdbbd3181"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/pure-call-1m/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eda2f5a735a92d70955c86bca686bc332b7971be9ccb764c3e69e06a63c2fcd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/string/substring-slice-long-100k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ce2429794fee2427f151552feb2239a5f81ca5421264bb97a8f8985fdf53b2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/string/trim-padded-literal-100k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9b15bafb9e4b9cc82a94affbe602b07d22a64a66342ca956d87343d52013ed"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/plugins/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18fdb52603c7156bfe398f6d51cb94b9513e82634321beecc741176eb12fd700"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/lib/utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92aaf68a5cd3d1b9cf215d9ccf0428e65d669507aa7e0916fe2b1936f297a85"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bbba72537f908ea0494a5c7b196e9e9d237f1df9c7d161e0a13b159536227b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b006a0e6c36091cbd9658fa55426977299291f2d649bbfe1ff3fdfa0a760d1c4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/lib/utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdccdbcdab38d69f30d757ac2a8dac445a4d5424fea6b5aeeb50e0e686ce480c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/src/lib/utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8efccced6cc20d7f5977918bbcdae902da053be7f9197202a85e45da686736"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/classes/method-call-100k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebcf7bae9bb50b20634ed8b9a4316cb073ec6a49943538809adce3a4e2da1050"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/classes/method-chain-100k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b346ac9e24220dcb68f3ddc4d048e156e607699a8d06504b05db006edaadaf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/class-instances-100k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2744ee6fcbfaaeee9d04ef618f31b7d911b4b845c5bec1a2d20b133ff627d3c2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/nested-loops-500x500/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2789875f936e1a105279d82c5057f1b2bab5cc849d5a43432ee4e41ee57c203f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/concurrency/parallel-sum-sequential-1m/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"177935947027cb1066438f9ceba5b7170b37cd1934d3a62eadbf744e8c568263"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/concurrency/spawn-await-x10k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d815dc20b94f9ef7aa18e9b9c32a67673b06450937274eef18c0b991a25834b8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/string/concat-loop-10k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26415731de953e658ecb48fe14b2f0f17a493e96df097252348366a886d998a3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/loading.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa73ef949cf4002f934fc3e2dac710103cd5aac5d8afbfde5ff119b1446a4a05"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/loading.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"774b3524e4006e65b38ef7e95d85271f677731eb99f802e9a308b8b6b5abd259"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/beps/new/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad45e283b1181ed80a7486080a5f48efc86c4116b94e1215314a431bd3cf88bb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/app/baml/book/concurrency/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe21a80214f41354df626b47ac376cfd8c8b76ccca6a92944605877c95cdcd4d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/app/baml/book/errors/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"630349766e73bc69222e365acdf635accb18e7e8ae21a8aa249e54d16372068f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/app/baml/book/interfaces/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78453bc1d2fc56ee10d680e4ede999422df41718ff4ff4d0066728cb2a6485f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/app/baml/book/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c570647e047fccc71c6dac30efd4bdef2a0897945d8daf914ed7bca73fa49100"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/app/baml/book/patterns/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ae112aeae616be80bb383406069a87b95fbbf1cce8dab07d5396af567396e8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/app/baml/bridges/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"998d9d4a5a971314a1276aa831b77bf27ebd5e241e1028b36f98aac7468892c2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/app/baml/bridges/typescript/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e434c5b21f0577089d76960dc64cb14dd86b1c3bca4eeed1d66dec919eace8f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/app/baml/get-started/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14eacce94d17b93b4ea0b692e4740a0bd0f44904bd14a99fe1eeed1f25fea9a5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/app/baml/language/functions/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f92b260b63d209a9b3f0f36b50d7d323e7b0f417d1a17dc3c78a399fe79b5e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/app/baml/language/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c7e5179401f4faa166e6cfc0f69f2983d850ecc3157738c19ef000781f31290"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/app/bcs/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fab21740a6d68c9a3fd140a9add2c5b878c87c2fd62889a09fe251c5becedb4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/app/tutorials/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"486a852da4c82b97f2d82d559d27368ebba0cd8edc2f76fd85ebf296172976fc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/app/tutorials/structured-extraction/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"948a502bafe59e8970091b41335d78232efbc34c2d11b08e408e8e76d910bbf8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/pages/_app.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6126d11b98c5ffa5db1b18659343966bcbc7e5ed55b002bab30419e1c47837f3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/binary-tree-depth-20/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e7b7acb7cd24fd1d809d38304deeb5b7427cfda9b29c127e437db21b11feb0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/fib32-recursive/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ded53a7dc2fe504032310ae65030030492c326604ec5d56a787646bf0f0d9a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/compute/json-hello/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"012a6c41d127ca122ee8a8e47df0de47842dfb019225e51e067844ffaca6e143"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/string/string-split-100k/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7ed5bc45d4a35d959e2cf3b613cdfc853ee0ab287d4639d0e7a744e8c9c3cd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/lib/animation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8679a9b225a4b861f46ba4f476bea96cc97832b994d3a35fadcd5c924ee3f8aa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/speedtest/workloads/process/startup/main.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14eea5b56fa50768496d34731f47774ccf63aaf7e8a4530ff0d251b1901db3e7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/beps/[number]/ai/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f52e750abd2a060a3b02cc1d8549b3529c1dd871aa1c8acc7eec8309afb742"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/beps/[number]/comments/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"154bacfff285033058ec2af352386e55d1c30ab143b9ad19b90ea501e4dbf463"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/beps/[number]/decisions/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5b39c5a1446ee6415d6e3efc231b0ca1e12d0ec11c58dd1a74f0dd60cfafd4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/beps/[number]/issues/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2b914fb271a86a5fe07747a5741cea53ee85c15b5cbe5b293ebcec836eda65"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/beps/[number]/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d5b9e1916054ea7feb201b6d84fdb40284576ed57945428d3dcaa006cc66a1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/beps/[number]/pages/[slug]/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd49d11b75c64b00b47d8cb7b9e0d2f918106121a40825f09a14cf490d405231"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/beps/[number]/v/[version]/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e539d1818d2a19ca4208ccde1fa618bf9c037e91dac203acd9ea3242c0d37a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/beps/[number]/v/[version]/pages/[slug]/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d18a14f3518c3f131a22982fe7cf741f52bd2db44b05de265939dac6bce8358"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_playground_controller/useTestRunner.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8c1ebbc7dca432bb3cf015939f86e14f81d6ea9c09bc2e058f10f9dcf570d6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/Tree/atoms.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa552e0711cfb529b8427a228b1beb558b223ad8da41dd6aaba49a61776c0d4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/Tree/atoms.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9dbe0abcbc2c0c858ea9117e57fd1a47b245caf4c728c1fa41db766749aee16"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-stdlib-matrix/src/main.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffea7ca7fe5698b469c08e16997575e0c335984981866be6df75cdc9cbc9adfc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/lib/constants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86712b9f57e02a903d4433ae2f9dbd247f0ba5eefdf6a0f99efb5fad3f3c0080"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/wasm/constants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b385965b2a15842d7697c9c29ef1e14df8250c658ca72f1d5d049070171cac"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/theme.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c768461a86f5a47b8dfb134923d18dc46b527ba48e26a25e05adc9e5b5542da"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/lib/theme.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dccbcb2e7b226b1be1431fd5f5b3bf5ed3f41fc47204dc00a0367610e05eefd9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/links.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"418f9ce1b701e869d5090a8c82b82bcdc1fdd5a84576ef3ea0be189a3aa65bbd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/classes/typescript/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db81ab2ffabcd5a9e10de7a840655d48fd2ee00e5f1eac608cea24dfb1f6c6df"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/lib/testfileUtils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc179cdde45f479703546d162896f59385244496fc815254ffce0d67b7961ef0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/wasm/error/wasm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0002911ab6c3847453cfbb85c8b392ab22f390c846eb6ea4bfeb7d572d246040"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/wasm/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92430f4165352509f0d0ad1d65c7058052382f640d0ffa8f5d5a168eda802e49"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1376 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar-treesitter/grammar.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a774d9dc8a28320dd4739c295622521a75b22dcf5f686541942289dc0a3e8aab"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~560 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 2 in-repo import(s) from 2 other file(s) do name it (typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/index.tsx, typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/useEdgeDraggable.tsx) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/smart-edge.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34124186d212624445fa6fa020cd491a8cc760422a6669ae58f34ec90bb2e2c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~515 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 2 in-repo import(s) from 2 other file(s) do name it (typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-known-value-widening.ts, typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-unsafe-dictionary-type.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4880fcd173ce9752b61f9a878427b28d356faf1e5c8355bc9232b9e457f5d42d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~427 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript2/app-developer-docs/tools/oxlint/anti-slop/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-known-value-widening.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41202ff119d85409af22654782952611f359a320e6883d395aaeee1d87c2f701"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~399 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 2 in-repo import(s) from 2 other file(s) do name it (engine/language_client_typescript/typescript_src/index.ts, engine/language_client_typescript/typescript_src/stream.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/errors.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fcc0341e4c62da7a78f054db30c3828b1c6d5992e243a602b03d98c61c96b1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~366 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript2/app-developer-docs/tools/oxlint/anti-slop/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-widen-then-assert.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d53cb41003c8c066088caffe6efd6c6333e58e0b5ade71ba65f751eabc425a0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~250 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 5 in-repo import(s) from 5 other file(s) do name it (typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-object-parameters.ts, typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-unknown-returns.ts, typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-unknown-type-aliases.ts and 2 more) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/type-alias-resolution.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c0ea5b53406439271117cecb040d6f1412fe2db9f94e330506aa1fe92f7868"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~210 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_playground_controller/TestState.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a3d6d952e460c333a8704e37c8081586ec0bb8ac2d72b534c7902ad076ddc6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~201 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/src/components/ui/select.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2215c52b7cf961fd901c963bfb63f1506bb0741f697079c396c5b12bd38b17e8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~185 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (engine/language_client_typescript/typescript_src/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/stream.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a155c4c31cfc29244043db090349df7c3dc6ac81cd98791245271fac5d509b0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~182 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_components/Tour.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1fa6c895389d8afa4b978c307aaa80684bec6e043d72df08ddfb4835917876"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~182 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-version-history.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3e99fc58c4ef9727763f16549e3771d23b980d8d28e6e4d265026527bef7c3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~171 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/baml-monarch.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12dceefe9db366692142c7d24b70d98fa1f90cbb2b5898122dfaa3ed9530533a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~154 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript2/app-developer-docs/tools/oxlint/anti-slop/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-unsafe-dictionary-type.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd077501b21fea40a4b153d57def8c2dd71135616aa060da0cd275356e136ca"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~147 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/index.tsx) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/useEdgeDraggable.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37990e5b696edaf4a91e902c27292358e1a51894549f2db6e6199d72977b3f0e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~132 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/lib/atomWithHashBase64.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06522f58e7b24bfa33f44474390f117557ecc38a8f56ae39602c42cc992abae5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~131 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript2/app-developer-docs/tools/oxlint/anti-slop/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/require-safety-comment-for-type-assertion.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1495521d57b60e9f42b6c7084ccc1deb7408e21e982efbbd773319d0cffb426e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~128 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (engine/language_client_typescript/typescript_src/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/async_context_vars.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47271619a3005ea09e3a0738d1b8085cf4ec8b25513c73ebb158886bf7336ec7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~128 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript/packages/playground-common/src/features/workflow/components/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/workflow/components/WorkflowToolbar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cae372f92489cc914fab517b0aaf38c7faeaca2aab23860eccc4472b2363fca"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~123 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/atoms.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38e60547b666caa7f01e09ad6fd2ad83e341b93d63614ef6f679105ca79026b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~120 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript/packages/playground-common/src/features/workflow/components/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/workflow/components/WorkflowIndicator.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e72273459c10e3ba7e2d3c30768302a37e60e4659ed63e9d712ebf55319eab"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~114 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/src/components/ui/table.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5e5d4bb15e595c2fec2e8e5e9e9697fd61606adf0edfff06524456dc1e9891"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~109 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/smart-edge.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/edges/EdgeController/index.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d686472e329503ae4d7baf48c74a9feab3ea2568167b1e39d2aab2d872c6265c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~105 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/lib/searchbar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebdb641929cbaa696809688bd0b7ca151fbd2e690a8be92994edc3648ac169b6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~103 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/src/components/ui/card.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4122da50eb1d74819c940c652b710f5f99090050b4d7a500c326d3f60a89baa0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~98 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 2 in-repo import(s) from 1 other file(s) do name it (engine/language_client_typescript/typescript_src/browser.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/audio.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaca74a9952ebceffff38c8bff809c72c9d1f34357df2cb04ed178bba68a5368"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~98 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 2 in-repo import(s) from 1 other file(s) do name it (engine/language_client_typescript/typescript_src/browser.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/image.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e052e2d1b47ed0c34abbc6e46b5c848cd3cae214a53055b4f96ee30355b465"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~98 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 2 in-repo import(s) from 1 other file(s) do name it (engine/language_client_typescript/typescript_src/browser.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/pdf.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"351b3f6db0ea6823f502e63b20c7293393311468cf4a04bcce1a016173276a94"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~98 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 2 in-repo import(s) from 1 other file(s) do name it (engine/language_client_typescript/typescript_src/browser.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/video.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"480fd99bb036bbc2d655abe39d150daca3c0ea08a45d103317a1cd7ca6ba5dff"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~91 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript2/app-developer-docs/tools/oxlint/anti-slop/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-module-mocking.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8465c6ac47b6e1483f3e8b2f66a9732208f985f28e7043fd8c52f1c21c7f4850"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~90 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/utils/async-queue.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4568b5151df021fdd02686ea732a0f79c35616047f431da4581df469d524bf4b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~88 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/mock-data/data-roadmap.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da0da72c6cf61212361c303d12036d1a6e78f884e0792b30852fedffe547895"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~86 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/mock-data/data-workflow.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0221026aef3aa3fdba7109946563a4ac23580fce84b2df8b0aa6521d1e2351da"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~83 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript2/app-developer-docs/tools/oxlint/anti-slop/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-object-parameters.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d15d6a1d48308d3eb7671baad43b38622bd77f0dbbea5f4848470114dbb16fb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~82 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/KeywordCompletionProvider.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc642fccd8834b91f2a9c4a7d2fe7ca8a5e54ffaf72fcc3e8b0f7510e944ffb"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~82 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript2/app-developer-docs/tools/oxlint/anti-slop/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-unknown-returns.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5bbbe6a427cd458ceb6b8b7f8dd2abc14ef3b662eaacfda02e72453a2befbaa"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~79 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript/packages/playground-common/src/features/execution/hooks/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/execution/hooks/useExecutionSync.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc9bf1a1004eed3c5a6f92b0e025951f5e997597646229f91dbbd37ce44098f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~77 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/Tree/FileViewer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15b645ea6febadd3a7a87d8132023cb45aefbb9e4226ee7b17bb3e98703ae78"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~77 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript2/app-developer-docs/tools/oxlint/anti-slop/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-chained-type-assertions.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2855b3642aa080e176f41279e04456cb6040c84bf39db80f13530311c4c5aea4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~77 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript2/app-developer-docs/tools/oxlint/anti-slop/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-runtime-typeof.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e9fb3bfe1ed3a18360e9a91fc45645a6b84c047afb1e002cb0808b18721ed7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~76 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/browser.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcf8203f4ca4707d0330aa6c41d13af020a741aae9aeec8e7a725aa210b55bf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~76 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/components/ui/card.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d57d951ba1495d30753b867d31b4896e996f2afeac4046dc7aa1c9ce8d6028"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~72 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript/apps/fiddle-web-app/app/[project_id]/_components/ExploreProjects.tsx) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/_components/ExampleProjectCard.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe407c283d605dfa2d30e927538a3b71892298a391d3cb784795953386cb50e3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~71 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript/packages/playground-common/src/Tree/FileViewer.tsx) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/Tree/Node.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb75051a55b6eb41093ffae86bd6f3f04a7516ec210390e55cc7daf045a9892d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~70 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/LongText.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dddfa22de97f8e21f97bef6d4c86778c912443bec61f99eefbd1ede82e065d5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~69 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript2/app-developer-docs/tools/oxlint/anti-slop/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-unknown-parameters.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad54e343c6f311006b57d11e2cb8678c0fa6ce4e2f567f5c555643b16fd3018"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~66 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/components/api-keys-dialog/api-key-status.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"360c9a6f5062722483fff9e5e3c3be6f3c94897613a209c5c994a60c002835cf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~66 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/atomWithDebounce.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10662adc569a8eb779e74bd669a362d44feed4a4bf9afa247c1af901201d4d81"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~65 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb8ba26d962ed1755e7845e67cd7e470fc2a90e367424f9d2c234d5497ac656"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~61 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/wasm/internals.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4896e40d15d9b11e3e5f88275125b1427418a34b386c6d0b7c7e37332e17ba0d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~61 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/type-alias-resolution.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/lexical-type-parameters.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7c8f73df6ae02b275b2f8bfd9c898cdcb65a5e2cda65ba7eb765a7cffb66a2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~58 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-speedtest/src/components/ui/button.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9dde9fc9fde332d5f79358b3496c29ff350c01fe62765384abc9d0c76304959"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~54 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript2/app-developer-docs/tools/oxlint/anti-slop/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-unknown-type-aliases.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2773267ec0ea08dd441c6e01ebc1c2a551b36ca3483d90842853b8ce25c905cf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~52 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript2/app-developer-docs/tools/oxlint/anti-slop/effect/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/effect/rules/no-service-constructor-imports.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51738145d90fbb4c91e70f6da506d1054e04201e96f1d995410c72db49e6b4f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~49 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript2/app-developer-docs/tools/oxlint/anti-slop/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-conditional-empty-object-spread.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba54ec0d13290db6bc7f53c68d07ad6b9b86c61059b3a5963e8b76dc21e31b4b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~49 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 3 in-repo import(s) from 3 other file(s) do name it (typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-known-value-widening.ts, typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-object-parameters.ts, typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-unknown-parameters.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/function-parameters.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"848857ac7d97e97b42740375937aedd6e56c45283cbeee09299505f00425f09a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~47 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript/packages/playground-common/src/shared/Tree/FileViewer.tsx) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/Tree/Node.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb2774ed2b47f017029dabfe014683a777603b6af7b1ce4572798e9620617c8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~46 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript2/app-developer-docs/tools/oxlint/anti-slop/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-shape-in-symbol-names.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86dd887752c8b8955362a5fca34b70d960e4b08da874aba78d0297f602b92647"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~42 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/Tree/FileViewer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af1553e320ce71ef13f7dc9eccb33ce1aca04f678ab6017304e13f23df812a9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~41 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3406f19b8cdc42a0f7a1ee6c961c7348fc445ca6426b6dbdab41db59604e364e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~35 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/utils/AnsiText.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"852ffc4f841d90054e590d569cd7ae27a48e9ff98f65944bf90d8a2b719e852b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~35 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript/packages/playground-common/src/wasm/internals.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/wasm/error/panic.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb549dacd34e48763a565172332e5303b6e81c15c0e509b050f45fbf20ee801"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~35 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 2 in-repo import(s) from 2 other file(s) do name it (typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-reflect-apply.ts, typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-reflect-get.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/reflect-method.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a550a345203c826ea915a305096d8c0a2defca5e1e7f0e3ae3ac6724cf6ef3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~34 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (engine/language_client_typescript/typescript_src/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/safe_imports.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3484417feea0a25aa7ad566608e84fce627a5141aa3b597b5b0bda9eb82f20e7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~32 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/_components/BrowseSheet.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81800a1fcf44460cafbbf7d1f75e170c3e975c9a25fd2846550aaef230e0f95"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~32 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/wasm/lint.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2cef8dbd3e7de8d2030057fab03f3f0c8867262b2d17cfc823b3ff1ef92d8e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~28 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript2/app-developer-docs/tools/oxlint/anti-slop/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-reflect-apply.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6590a140274828a66ed316aacc70637c6c7b361d014dc9000a8c14f4560fb3a2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~28 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript2/app-developer-docs/tools/oxlint/anti-slop/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-reflect-get.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c74e98a4733c6e71498761f44ce09814bf317745108b46b91b94204a3fec2d0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~24 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript/apps/fiddle-web-app/app/_components/BrowseSheet.tsx) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_components/ExploreProjects.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a0f43f916ad192fed7c1aa3c3bf7d48180b12da360c0ab8e62980b81a06b7e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~22 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/shared/log-decorations.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48842d52e50c4c1e71796574c72da36fbdffd8c398c49df64742a40eb002061"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~21 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/lib/base64.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35733a67123a6042d857de55648c78e294beb1b0c288d7f1d1a2048f88877092"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/mock-data/data-simple.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4759ed23651139aef1a62f7be6506fdaade30d7085d0f964b9f5db787782e1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/theme/ThemeProvider.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a373b9a811e4270d1b02a31fb8b7ce0f162ab53bcccfd257e121f1d3d16e5e55"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~18 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/lib/format-number.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4385133b35579fa79fa0943a7b599be037fb42f39d9a713b22da80c7e557b195"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~16 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/components/brand-mark.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfd74ebac6ea7db720c7904be9f70ce4557721f96fd78ff54fbeb7798b6900f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~15 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/hooks/use-debounce.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab66e4a7a7a9dc076b848ff3ffe92e7c3b4f5cc2f02610cbaa162f3067e1a75a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~14 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/test.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aca9bbfaca13c4756b0a2cb905fc521e1f536bda7bd67d84f8df13945316ad6"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~13 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/effect/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a97bb28249cece4dab68b817796df53a7e61caa1111c654c014143aac4b685d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript/packages/playground-common/src/wasm/error/panic.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/wasm/error/WasmPanicRegistry.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cebe0726df96766950d928081f6bca744136a03eb3562d1e40391fd7125d147"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-vscode-ext/src/utils/getNonce.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"988e026c036a4b5548afab2ad6a6cf7ff505b7dfccb17a08d83eaf073616b20d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-vscode-ext/src/utils/getUri.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2895439200eb4512a3c707044f2d3342e0d4e76cf1be93c2f65f9f546d2f0df2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~11 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/lib/format-date.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34027eb65ee5abf4b1032205c48aa979c6e5e3626512e1eceadbecebaa3beb9e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~7 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/lib/format-percent.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d6cee107c86539d138f705c73e70416650e99f83dc2ec51bd96dc4cc69abf0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~6 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38edab8a10a00cbfb74ca0d021093681ab7c4ebfe2229f964ecf0e2b8502c6a0"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~6 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/lib/utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89364a275702a5c501d77f0e487adbaf9a5c6a323851ab04a5ba8116be93353a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~6 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab5e35ee6a72ba34a34e6799aee13ae54148b697ccff5fe3983d54878bd3de4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~5 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/custom/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e40b5721593843064574f73195e79a28a9d986d42e1d19492ed3c031787d791"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~4 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/lib/animation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cefce8a0c640948f26f3d8a2e08aa51e1d87ebabb5a743844419b444b2df343"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~2 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_playground_controller/useTestRunner.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7d5d8713766a0b6175b8459e62be9861210d606fad2537c83a79354be46d34"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~2 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript/packages/playground-common/src/Tree/Node.tsx) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/Tree/atoms.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"125862a4a76970cd8221e7b8dd4e56f2416621711c5777ea7621a34219d3bbc9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~2 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/workflow/components/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26f37585e2d7ff86796e4629775375b94eac00f832108364332c3c2760fc6d5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~2 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (typescript/packages/playground-common/src/shared/Tree/Node.tsx) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/Tree/atoms.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c8c96dcff3940d1c57cb0474a631b731092ac553ee5d4358f89d0bc6b3098a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (engine/language_client_typescript/typescript_src/index.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_client_typescript/typescript_src/logging.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31bdeec114019f01cd90ebbc9d86ec041f0f4aa7e9acab08007f30d44891a06"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/lib/constants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78df81cb0352079730e68ae76532a42e2cced8288bc51b1fa67fac1dc6a0a1a7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/execution/hooks/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ec5491ab2f30f786b3049f8f369c72d70cd3368cfe2300cfbc2bf6d54b69ce"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/wasm/constants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda00b775dec3d9c6972006aac415dd684bb1d85139009b23452349ab57a7027"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/lib/testfileUtils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92af4fd8d3938820263c3e273baf76d4772337f93b6d49bca9f8fb5717803d4d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/wasm/error/wasm.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca791fca297ce2923479d6293bc1cc4c40724ef79190cbae3abda5fab4072a4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~0 LoC): no import path from any entry point (382 application, 99 tooling, 230 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/wasm/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20af85d3993b118a448f8b8cef9afcf1d60fc3a895478ea2eb3cdf32ee4875c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PROJECT_ROOT\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_atoms/atoms.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec6748f135d0ce64cbd6b1653db51501cc9295a9045f1df70cc95bd69e04282"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027activeFileContentAtom\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_atoms/atoms.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"313582e42dbcc02dc4b520602c4c2b33619ea9e5cca7a1e5008dc653ee647029"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027libraryOpenAtom\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_atoms/atoms.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94e366214b0e17b6b28c41719c50de449c73e4942d09ee2126a2ee54b648a3b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027data\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_components/Tree/FileViewer.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"911a1bd7f3eb62ce645340f1fd5d67e16cc2631d1b4045a387f5172671b6fe4b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027test\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/actions.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d90c7a7c6bcceaf8fe4d724f14cb90f4fc18afbca082613fdff01b424c915d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027updateUrl\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/actions.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68ea879fb0be2f756eb851e1cae1fbf3a19e781b9d3454b388b61764c5ecece"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027checkForOtherPrismaExtension\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/util.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd5ed29e394261fa51579831c5d72d8675f2aa6019322b9edea1ab50ad29567"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isSnippetEdit\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/util.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25e9e40782bac374e4e5f8402597536681004b1812114229a71e4af6e8d7e16"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027applySnippetWorkspaceEdit\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/util.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb6de350a26bd1cb38f4488a30a51a2b04a599531c7e17cbeff4dccdb3184d4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027bamlPath\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/util.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0ebdeca05cecb0954af5648edaff0039cc1983fb20f331de22e2c0ff4cb0fe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027bamlTestShell\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/util.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73c43b994f4299a5762802d10abe763176bab1a64c65e64fcf827e20826d88a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027decodeBuffer\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/webview-to-vscode-rpc.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b01da5020aa5e04413f9d39b0d27fe674bde313f78d76de46a74cbfc4fa074"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DetailPanel\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in typescript/packages/playground-common/src/features/detail-panel/components/index.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in typescript/packages/playground-common/src/features/detail-panel/components/index.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/detail-panel/components/DetailPanel.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"eddd257a3676e54375d6c5a222ae464063399997204ea9116fdbd5490fdf9dec"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027areLinesParallel\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/edge/edge.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29e7a2037bc0d6d962761c3f57676922d9d27f82f7ca6621321ccbe5b2bb6ff"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getAngleBetweenLines\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/edge/edge.ts"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"1600d1eb6e4087c03bdca01966d1f52db65051f3ca40dba75c4b45f1f8238685"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isRectOverLapping\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/edge/point.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"452428ec45a4abf5683a3f50d022f9a61390b6a976411320da236483a6653dce"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027mergeRects\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/edge/point.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77eef6b0ad906125611aaccb922e63064c73a36742cc3dbe841996c89d9f568"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getRootNode\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/metadata.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ecd599c19d07f9eafd899753d0f8696f2e1861385f42d79696d448b7732073"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027onBorder\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/node/algorithms/elk-geometry.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bba91edf87daa8485656469e798b024760218dbe0d5371d73d4f80c4868238f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027outsideNode\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/node/algorithms/elk-geometry.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1426a7fed3e5372b7434149a2e837702fade4c5166bc6ad3fde10c7223a3d1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027computeNodeIntersection\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/node/algorithms/elk-geometry.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"904114a4489fe6ce19842a9614ae559eff9446885cb1a5b5080cb4590992054b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027replaceEndpoint\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/node/algorithms/elk-geometry.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d99c7f3c15c03351d775108e4cf9742cebb2fce88cc015dce80fe88ad8d3d2c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027kElkMermaidAlgorithms\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/node/algorithms/elk-mermaid.ts"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"31608c993d72c7c0799705bdc38a263bae840f0266863b1ea59b1b9e41d5b29d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027applyExecutionStateToNode\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/adapter.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a48db17c2227e9c2254bf91c5620aa87ee9de0bde794a4b51bcc3d70a96eb6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027createFastMockSDK\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/factory.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"14feb76cd3118d022ddb66d0ad8a6060162aaff067c091030cc8142794fd8299"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027createErrorProneSDK\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/factory.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e1f51f2d8dc5f2df9cfcc981ed3549d8ea5cca2e5e228f94e379eb6e0ee685"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isClientCallGraphEnabledAtom\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/preview-toolbar.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9cccf0e41a25dcc0d594e872ebfa55c601715527c0d397ef4734ebdce5ef11"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027functionsAreStaleAtom\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/atoms.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7e156815ae94a153d87e46ff2a32c4abf4860c12aab0e8fb4640bf5bc15f1f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027shouldShowGraphAtom\u0027: Nothing ultimately consumes this binding: its only referrer is the re-export in typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/atoms.ts, whose re-exported name has no consumer either. Removing it is therefore not a one-file change \u2014 drop the re-export line in typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/atoms.ts in the same commit, or the barrel will import a name that no longer exists."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/unified-atoms.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"86959972c83a63b8587330185f1cabc62572adc6b518c918799388f9f5b3ba31"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027panToNodeCenter\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/utils/cameraPan.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea579886e4afa8e209ae6c3dd2babf6b7b959e02dfa76ce61f6ab0e2ecdf8709"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027components\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/_generated/api.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b9035c55d683938e19d415e70b84970899eba40fd34a2b5cb978a71bd821e0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027action\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/_generated/server.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41e720dd361641b59e1b80fb661882b3cc9506d00bc987ecf17da6e9746e097"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getByVersion\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/analysisJobs.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f131e1307a2ecf090cf08a3e5e5bc78d2084a6f2d1f74c36035e93e8283bff2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getByBep\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/analysisJobs.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"de29f48da2c0f8c727601515cb25ba8d8a32eced3015beae8a23c2e2a89f2908"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getById\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/analysisJobs.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e071fb24ca0c25c96069eb9bd3c98118006e26449fcc7bb996d7778772afa34"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027create\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/analysisJobs.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"303031416ac97cb50103a710d6bc9408ac0b062e9ed895e1a02e2960c5ff6f45"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027updateStatus\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/analysisJobs.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e693d050e00ac5beee52d44e32a97681715d1002bc852be369662eb109e73157"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getAnalysisContext\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/analysisJobs.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c693bacf1015280174a4bc5fc2d418cc2d0a9f0fc2b64fe9bf8ac08dee3baa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027retry\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/analysisJobs.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"8288614def1df213f3d59018bd307af366422e330301b65ec22bfed2a8a6e530"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027runAnalysis\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/analysisJobsNode.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d69b5c940499ed542d03200ee7cf2c3faa5627137402df414b89165f3bb4519"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MAX_VERSION_JSON_BYTES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcs.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c88f0fe109503950edbd9760488e68cfe4b2cd83da92b879f35f1550fbe598"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027list\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcs.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fdd81a50ed1cdb797c4f94345f1e00d2451c8a1f988b9b24dc029f5f7d5f68"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027get\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcs.ts"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f07f892092290f1b18b0b3977922b60c1c97c0ed150b549b4ea72f73252cee"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getAll\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcs.ts"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14aca19e802583698841ced1b4ba048642841c2677ea9a27c4313c48ed9d66c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027create\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcs.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca9a94a6b38a9fb72dfe253e253b9c38121ec378e94821b216e2b1be0c4584f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027save\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcs.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be4de90f7580e54f3875c2e830659b2a427e220daa688caf53cf4833545cbd2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027slackView\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcs.ts"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"67df185194e496930faf98f071eec2671dd9eb6cecb6af4de480d2d1d50331eb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027storeSlackThread\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcs.ts"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"da87ae61dab8136e7074a596941ee00d9cffd421458fb4cd8fa4c07460982f94"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027list\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsComments.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8878d964559eff9fa7001e2224607efc554dec8fe89856316d1a0f251ee5dae0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027locate\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsComments.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"17268ecc1f0ee5539e568c4859d0942d32480d3b95076140af0fdbe0122216ed"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027add\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsComments.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"68290d6ec56ca8e39007173d69247324e95afcefa07fc0e30e223e6299210245"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027reply\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsComments.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdc694098102acee0084d3cd7056dbcbe3e86581aea4fe30440e0be70e360f5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027setResolved\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsComments.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e67ddab116f3fddd10bf8c3697957aa0b73ce80857b37c868325059c63fff92"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027edit\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsComments.ts"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"52be366e0f34d270406bc10e2d35c63a24b6d48adfa7f1d975126f4f34d646bd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027remove\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsComments.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d31222084f088675ec426f693c1573a3209bdd203530579612390053d3661e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027toggleReaction\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsComments.ts"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a1488d06918113485133214500b588cf687edcc3e1ce1c1c49d1ab314984a5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027feed\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsComments.ts"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"50aaf96742d150778317fa5d1dc972032d980a5c2c579ea58e291f7cd3c9d17b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027notify\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsSlack.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5a02ccda0474508d44f2fb676d443418b8a673c1331b41f73b7d50994edbd5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MAX_STANCE_CHARS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsStances.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2d7d487c21a11e2a9a74d5c7507342757fae5fcf0f5385064b14c2624dcee0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027list\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsStances.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba8ea2240f4713b8e4ebdeb8603ba97db9d03f4511965fc9218709e8e100343"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027set\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsStances.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a5111e0c23fc0d987f3a849d788f81bd5a47992fced6942dd148df26bf7795"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027clear\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsStances.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0a8f871e58749539bcbf0ea16e9623c1cb65bb74d12589703b4118aa998f72"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027list\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsTracking.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"795777d18bd20a445c98a02889398d73bb9f37360a2b772a052c4fbdcefadb77"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027decide\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsTracking.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d1289ac4fe0803019da109cf6b0365a0a3942a1046192e28fdb375447e2c85"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027removeDecision\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsTracking.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e71e6c5a0a7bef34ad26d5e0be8ef45ff2b095c5817c9fc464197eb88fc47ca"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027openIssue\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsTracking.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"3126e5ce1e105fa8635bec73d4bc011671875df7ed136fb35a22c6a676a8aa2e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027updateIssue\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsTracking.ts"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae765ef79425275e124fb8cce55a74b92c2d86fa7969748d35b4da2c7ed16f2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027removeIssue\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/bcsTracking.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2ed0a93a7b51f443ef7c7664f46e071c874e1d5a723c4ffade58eddf3a9f9a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027list\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73d13ea99029e7d65324248f1c1f578c0d47b334f94c24d1c04c0038dfde5a1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getByNumber\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b5afff3b3d47249ef3df55e4c7796fe181100301eef79b8010619e0b8e589c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getNextNumber\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"6daf7cb3538e6a887656013eafc0c4c4012a3ca67fee1b62bdaf5a2f271bcaaf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getById\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8cdf936010d267dcb06bc9db39975ad691d88690414bc3a5d6995150d240338"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027storeSlackThreadTs\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"78dc329dd3f021d1b11ea9565cde0a31636f8dc37a3703f1708f9d48ed86c1ca"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getVersionById\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3eee0760896948e57cadc21152920bfb78300c0377b697606333d3d9633ebbe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getVersionsByBep\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff4d705304ce317b6350d3734a74270d9625ac3235d483032decf347e080af7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getBepOverview\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"140362ce88376580561d57d56befb660f28ce57cd789232f2de9df4cec7f21f2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027create\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"797a439515236a9c0c049a553b485ae159b6357fbb7915ca14df44e13765e543"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027update\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d70fdf51a6b18a5558297fb4b2564d7a50c41011d61f96ad450c9cc25e99207"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027updateStatus\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b97a3c9b0770486d37949de1e830007135edb8915a906d211be7805a0b5bcf7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027toggleGoodReference\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"975818095c9f640b1c424c48eef58b8cdd06bdfeadf5159df8d5a3baf5e58431"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027createPage\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a7524d074b69074a42dc3fab69b115d869810e1897ae054b8abea73b1582ab"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027updatePage\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"078ff3301d65a37da108ca79a9aa69089bcb0645f26cf5a65f6e6134eb8ef603"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027deletePage\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f1ea247c5834fa598961790a0d4837444a9e97fa5d23800fd89923476b5b5f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027reorderPages\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ed6c4a0444f6531644e4a77c30ff7a318ca9e29be7e150f17312e98e5263b2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027importVersion\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/beps.ts"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"325fd2b9202d11890e9ca169ee5ecb05a22cf4e8a3824da11054bcd60043337f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027byBep\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/comments.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c128a43432b1b2acc599475737a7043dfc7a448f695c5ef39df5bf6d1b51a3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027allByBepNewestFirst\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/comments.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d672c4015999fb86f2b7f876b29c1afc0ac48c8f24c28b64858a3cc5958240"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027byBepPage\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/comments.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"222b1a78934985f3899561d4f455d1ef8ec0c50a917cf528b1ba685e8e42e2fa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027countsByPage\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/comments.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9a0ff3f87305b45c14d31c291ee984f7716df5d0bf537e6e3ae86e05cdbaf8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getReplies\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/comments.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c1845999e77e90d4055f9e815c326870259f71bff50a150fbf03fe48c81384"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getLinkedItems\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/comments.ts"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae10eaca9b4db2d7272b3171c3719b0c0f7449c78698df99ff41aa03e902619"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getLinkedItemsBatch\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/comments.ts"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79d82e05fa274a7fb52d9e67cc4d5f51232260de9e7251a95b44d5a72097434"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027add\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/comments.ts"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"3165dcf520a4c512192b299d46178b87bfe14fac40721426b69bd6f183547c26"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027update\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/comments.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d337baf3e9ad2c248def869e28375ed8242f8d54c91808aa0de283e1307bc0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027remove\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/comments.ts"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a05864ca2572e92545b6d9f54c3b480cf666aae7901714a2653012b02fea4c6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027toggleReaction\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/comments.ts"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84775ebfc9e1c5c57e1baa3feade7e9d1d00b23dcfdd12b95bbf4263f54b853"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027resolve\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/comments.ts"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f64b45a535404238d9ee0694984086245a3c32fe416ba0512afda09b7e2c233"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027unresolve\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/comments.ts"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"e891a157fd596a4834c05fbaf07511f470fd7001c02b27bf2faf08aeefa93f91"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getById\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/comments.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8736ef7f53c363921f67e502e34ffdc78c6933e0b4ad95ecf2303c363536b3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027byVersion\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/comments.ts"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c26659f0d816b61ad1752838bda5bc9ace7ee301defb0edceb50396b02a8d7f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027byBep\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/decisions.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc0e3ef32f8c604ac05fb710427eb94692734471ae5da83adfad8419b86b623"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027get\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/decisions.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b0a5923caa5a8c4f512bb7e341fede6aa4fe6d91b8b977f6d174b876ee7e11"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027create\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/decisions.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73cdd7188b63166741d32b859e01322f2453da0ec29eae64809503db4d28fe1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027createFromComment\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/decisions.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b70eb48e20eb9d96e36ac9ee791594710af3dcc92addf4ab72bc75f5a1223a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027update\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/decisions.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2239925145770b0f87379650f24e3a5237109f73fd8f370547c7b8c0ee59762"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027remove\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/decisions.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf78bc2f45dc2c52ddb0173b627a0508e68f8d7647fdb2c1f53066b73c3c035"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027attachComment\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/decisions.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3efeded18c9d3fa046bcca8a6e0c5af99747d5fcbb8a020fe69d80abf20871"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027detachComment\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/decisions.ts"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0de440a29040e898ca15f4d4c2c754d74bb0259cc8c1eaaf29a313f1cfdfd62"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027byBepInternal\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/decisions.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfa33f87665c1cb99461a8983083d54d107f3d46d7322c4d98bc1407fe11d13"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getAllBepsForExport\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/export.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8889e9c869e26f8829ee246222de91ca8fd373169f9d59ab0447f4546a687c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getFullBepForExport\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/export.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"65852bf3f9554787be518fbf508a6350698bf434309c0ea3c1f1a1965b0d49a7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/http.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"991eea0a24357ecd9acbc0b71885c2eabb4f74e399073b6b539024b8be03bf78"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027byBep\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/issues.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9cd2b29b80a613fbe61a2962d52fa3ee91c962e9f47b8e14d88bc5066a69a9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027unresolvedByBep\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/issues.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26fda0bce70b8db767796cdbe43a1f089b4865ba7c9835d12c5893577684577"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027get\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/issues.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"060fcfc400a05480be08a04c65aa07c3b081e275e21f5334e2100dc851ca1b96"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027create\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/issues.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88152f170574889805b497d00395473f68d50ade55b9cdb89e287f6d43df004"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027createFromComment\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/issues.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa910a680a7a9310eb0cbe9178bc8edbf90fe22fc9d461e3d2e0c1f9ead529b5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027update\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/issues.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5938bcbb08d6f8fd6394764f983c2fabdea929d6d1ff285cc03b0f95e308f2b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027resolve\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/issues.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8901200c6e32303139fd431715f817fa6bb3914e8fa4343769b3dacdb8516e9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027reopen\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/issues.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ee5ea9e2111167eaf44ed11f1f886a1e9f40c707947a0ed618ac1ad7949c6e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027remove\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/issues.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a19142ab2c7c97c5025caadc91dfad51db3b74bec986700a2b0a667452c6023"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027attachComment\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/issues.ts"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"442a203a708efcd7c89e27a121be6906c0b24388af5cdf66f107d1a08d21c4d9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027detachComment\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/issues.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"854832e2d8925426c3d0be5d6d8a9dc7e33575e06ac21293cabf7398efe5e2bf"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027byBepInternal\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/issues.ts"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9ca6849bb490e6f4e273c2bbeb43ba3780e7af0b3b16540840fc290951352b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027migrateUserRoles\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/migrations.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"43663f27963cc60a88baa5c4e825ca3c8c9d5d607c74ce5cea40340ee41482da"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027migrateToContentModel\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/migrations.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"831a683c3dea8d79ecd516941cea4512f6999294bb62bdd74ffbd421f0473c04"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027migrateCommentsToVersions\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/migrations.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5ea49af1f1714514461443a06e0831f40c436424882fb1077caf001e5f3ee8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getViewers\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/presence.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f650cdbfbe6f34ec294975ffa00564b9b4d0c56252aa74bb44e03315aba4f19"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027heartbeat\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/presence.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d296be8f19c9634adc32c09a83a961e752fe88407d3ffee182be76ad9c6d9bc1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027leave\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/presence.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dad14a9c672a2d4e4ce6b7e26f05ecbd41d641c9efe727e725c67d414dc8e1f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027notifyBepCreated\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/slack.ts"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"072b05ef6504806de4777ee873ee1a6e3bb5bea983f1281e927d25d91c935c7e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027updateBepThreadOverview\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/slack.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da456560fb3aed257a437cdc79a64ff9c282d339be8ea7649730182e2b77c5c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027notifyBepVersionCreated\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/slack.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"c930e452a887263ccfd38101c5bb4d42569c2e8ad3832e67e4f64b5ab13f1519"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027notifyCommentAdded\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/slack.ts"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a94b7ac922e20d8834a7faecfe19365538b25cd82a8233fc9bfcb416798ab49"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027notifyStatusChanged\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/slack.ts"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fb7a5587dc6a47410f653d6bdd16306570175e9ffcd083f112806596615878"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027lookupAndLinkSlackUser\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/slack.ts"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebd90339d50ce6ad263f3cc724c5a5863dc609512133af9ef48aab7c86c6dca"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getByBepVersion\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/userStances.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"71abbc79feed312ce0f8d77e0d7c4442784e3c9fd239cabf32a6d3f67b54786d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getByBep\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/userStances.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d756b4a698ef82ac36a3752a10fb08168d9c30d31f982812a3b3cc330d88999"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getUserStanceForVersion\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/userStances.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"325685bd10578ca6e4b99a98382901e526fd84f96c53ae5ddd510050739f5fa7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getStanceSummary\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/userStances.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4eb82e1c3abc7c4364a5d34f3159a703aa1d92940312a16bd6153e174ee198"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getHistoricalStances\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/userStances.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10c04ec0f86d1d55ad05479d7ed9172f5cd48ca04e4320fc119493ef64096e2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027setStance\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/userStances.ts"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"129c2ffda74b095078cf957a8d8cfd4b3e0528285ebfac1976e7ceaaa4344be5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027removeStance\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/userStances.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbad96eee3044dfe9ab68aba24870d228eb6b5c7031b666a56b39f9cad5d77b0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getByName\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/users.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bcd3926159c98232be5f9104bb5c71846a6ac7725c74af0d8d2446ce30a3b70"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027get\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/users.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c69b470b1e56f602ed0de0d7a5121cd01a879dd42ab1a1e4f8b637a6726e48d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027list\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/users.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"502baf090a764450241418cf6b43c9e41c2f84c00d08cebc4e055355ca0f547a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027listForManagement\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/users.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"649cd34f1e7a3e213e7df2a27c9fdd80e42036c5c32eb286df922b2262de999c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027hasManagementPermissions\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/users.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"9627c8747fd661262c8a36608d4cc34665df5c69ab91559bacac0c3f48b6bf26"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getById\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/users.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac47f2ab40218e0415f388876c024d5081215ff32b901e37c9964f18123c8bae"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getOrCreate\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/users.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8733f1c79e1575c34bc35733cdc5f763f58e3ca09ad6533a8bb09d19adf721"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getOrCreateFromGitHub\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/users.ts"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa9e6b543882f2a2c7542019a2c38b8ffbf62b4e073382dfaf136ccf142211d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027recordGitHubSignIn\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/users.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f01eaf267a07c27fd140d4837bc1e7ffce9a3ff2e82be2ac522a97794761f31"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027updateRoleWithPermissions\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/users.ts"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"96af5230d8ba21a556becc12b3275b290372b27ddb9f8b65f65702ba4c6864f1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027linkSlackUserId\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/users.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8d934a4005b22ae9778943ba57b7cd36a3ce4cfd307afa23baea1aa3fe0ad1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027apiTokenFor\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/users.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"92178340a8818c753da9626a35e290f5f8c7acf8ffc54ab031ebff8accfa9146"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getByApiToken\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/users.ts"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b894e23a1efe392fdbc5c44a38213a4a29f42dc3ed3a845f237ee0f2e7b311"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027authenticateWithToken\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/users.ts"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5ca65fec80f572bfbad002703c8e0a74a0c8f0263995f5ad91048ae1a2c906"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027clearLegacyApiTokens\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/convex/users.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6362a21d89b2283cac2f31512116e69a90bf69e7c75e8f036eca327b7b91ab1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isValidSlug\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/import-utils.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"e628bb1d38da7a4bd7c62f8cd4f601ba7149401b55d59629568a52e3c79b8145"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027verifyRawCliHelp\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/generated-content/cli-source.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b2fa5a56a19b6bdc98b0826644c193359c1eb51e12a643cab844063035cd75"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027listGeneratedVersionOptions\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/generated-content/discovery.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"44cc4ff614d9ef9a870c139c6b5f6711ab7f2ab86222525c4f77dbeb5cdfc6be"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DocumentBlock\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/generated-content/document-ir.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3137d840df980be3e2bf8e0f732e805ee0416c2a9c2c06320556bf7863127d2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027assertSha256\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/generated-content/json.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50df77df30eb4c01e087f4efe8011c36a8ced35367e2700d5e223a481604738"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ReleaseRow\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/generated-content/schemas.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"268dc050a676082f7d24b058176e8e392e310da8805bbeb5c8462ef0eb35436b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ChannelPointerRow\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/generated-content/schemas.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"c601e95708439b2ba913204b8e020ff32705ee3cb3029c1c8937bc79435cfb55"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PackageExportRow\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/generated-content/schemas.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f800fcfbd6b816e2e2c916c3df9a86069e5d12293052b1a5547b0503d275450"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ReferencePageRow\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/generated-content/schemas.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c066a256175702be597f3fa8c57a6e2278b8bedbee1b731faa5986589aef728"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027CliArtifactRow\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/generated-content/schemas.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"529751e161d4b4541bfd45fd2de274c95063b39db60d5af533308ccabbb53709"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SearchVersion\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/search.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b521e16757975a00d3560351e0c1083390090dea64e72fcffdae3e37b804ce8b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SnippetMetadata\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/snippets/schema.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fff9603fda378ac396283b121e15031516fe7214ba32f429f8967fd5322aa4d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027loadIssueEvents\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/lib/db.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee10ff7145f961ba432a8d2633cb5b8b503e5bd3d0f204f3aefb59921d5a4b1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027buildCliFourWeekReport\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/report.ts"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4b2e75b2efa10ba01bf3b9d7c1d76c96ab12056043cc8e32727a98145d9e4e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Exchange\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-type-quiz/src/quiz.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"40df2cad15aebaf670f2f16c976726eea842e69f26adadc047a0fe9183ef9f0f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027hasArt\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/blog/_lib/art.tsx"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f3bd0b4cef83435ff175e7ec8c27c099410b265350dc6e4aa9e7c76b67ad02"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/blog/_lib/get-posts.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34e394875ed54494ba29c52892e9879fe7f17d460ed132b3782f4e5439f140f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027EapCard\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/community-cards.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed97fedebe8d9dc70da06d70e6bd691cdeb90e760346dd7b5fd295aba01af893"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027BoundaryLambMark\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/boundary-logo.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4963274093409a8fa920710fdd0f93934d5d50f0e89c751cd1a6c3fc35b080f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/hero-languages-styled.tsx"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"888c7a9482fb1bdcabb54ad077fa719767751f4eb4e783524e3475b1a04f1b0e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027GREEN\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/kit.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"880d912c18ce13f99c2b892a3be900b703eef6fde813c7b7b4d650844b2e9aac"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027useCycle\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/kit.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfd5e9c5785102cfe0e23fee4e4d3caf8a24790f0f01467dea9b0573a1f53e4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027wire\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/kit.tsx"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4df9c54b3e8cba92c83c786bdf59789d52563680762647b6aeba4108ae7a4c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Check\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/kit.tsx"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99539582e629f4b8c8523b3df7adaa4e71f0824a8fe302da502d2c8962ad1d3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Cross\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/kit.tsx"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"626382df8444ffce1fcd6dddb8e32aea2b3a29f2fd60acb3274ee350b8d3ca8a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Spinner\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/kit.tsx"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32e44b8bb18e8840d57ce789ac00b9056694f9ac7ca26c8c207fcbdc895ede0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Pending\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/kit.tsx"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6f89fadfb45a1044d29e9e310db48e7474e3c8e1842df8c13268ec713bf66d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Chip\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/kit.tsx"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d833249aa4c57a259575d9ae7a478cdd26af8858dc41c8fb0d929db0c8bad9f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Points\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/phase.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"801fcf56bbe3ef2c367f6935f2651d2e6bba35b146e551e4fd17c09064e1ff48"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Cmd\u0027: Nothing imports THIS copy of \u0027Cmd\u0027 \u2014 but typescript2/app-website/components/home/ui.tsx:88 in the same directory exports that same name, and it is the copy every import site resolves to. Grepping the name therefore finds live callers that do not reach this binding: it is the dead half of a duplicated pair, left behind when the API moved. Delete it here and keep typescript2/app-website/components/home/ui.tsx\u0027s, or, if this one is meant to be the survivor, repoint the importers before removing the other."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/phase.tsx"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fd93b8ea2b1faa279330fec2e7ca06b9b5724e916db6b98c55c4e132d2d130"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027FIXES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/story.ts"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19bcbb085b79931fdc1b4a31c1bd8411fe9fc99c43cbd7719d88597254523bd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027classifySource\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/story.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d1a672d062848270509e37fe8196ab5ac8ddcdce53a53a778dc687bf6f1a77"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027PAD_Y\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/ui.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f89c9183c347f90b92c737c85cd72aa5b4a60e0fcb780760bb4b4c0a043247"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Arrow\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/ui.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c747e79859a61a56bbc9eb5f4220e8f9979f97c4723ca98ede5f740413714dd8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027K\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/ui.tsx"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbd96a6c87df3a0c9092b5b39de5e9535b9b1bad002916b73deed1fa1eed43f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027T\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/ui.tsx"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"827807ccb176be8daade026acff2108a3605d21aaa9e8ad0a32c7a905fea2b4d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027S\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/ui.tsx"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e07d165f2baade1b47e7db0c7d35f223d450f1463c9e309c4cdea0ac92d773"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027C\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/home/ui.tsx"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d716319b4a46871f4be2552e9f3e3a4280eec13bfcf9b843cdf37acf4e2149a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027OG_CONTENT_TYPE\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/components/og/og-card.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cade7ba8323f1690a1b81a19ac8537448b3d1c6a959b669f53e60549844d464"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027components\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/_generated/api.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62faef382e1a3603772fe532b097063b06a18e55ddae70977c5c33a12dfc965"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027submit\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/bamlcodeFeedback.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8191838332cbb3af267962faa5421c5240767f75a9948dec58ae7b69e81a70"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027checkPassword\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/council.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb2cec9515e08f8b097b65ef3719914a8cbe592ff6eef67017aa81f62ee59ea"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027submit\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/council.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd88e091e8457d9fbabbf9c5ba067590b38f459d291ca3fedbc73582165a6ee3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getSubmission\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/discord.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef416ff0671db880caee50dcd73d110f4257974313ee64490fcb58d96647e34"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027listPendingRoles\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/discord.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba8c65fa607064507f38230d6f2f69a8bff1990ea5af820a0101ff6de5f58dc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027markRoleSynced\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/discord.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b48136316d622a783bb6ae90918642fbf69ea9af549db57a3c24b47fd68e4ac"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027recordRoleError\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/discord.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e4fb69814773d3664bcb708debadfca8739148d5274b5ebf7f8dbe6b9b345f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027assignRole\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/discord.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0de17970dc1fb7f1c74e55105794c994ac366957e44f107b1f9b2bf6da0b58b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027syncPendingRoles\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/discord.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00cbc9704c63b93af0c8a080687df28a1e5e6987a75401999c44ca7ca72d7e2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getSubmission\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/loops.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"828f95f163f6a00c764b226b6a00799632d736059338db6d0d7b3200e6cda6fa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027markSynced\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/loops.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0140de9b0565e270a8c065a829bc2b2bc63383933921403e56927926c02923"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027recordError\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/loops.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8a1f4aa37fca501c5cca0e296c9c23c40cb8e7328de73cb858f1a6692c2d8f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027onboard\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/loops.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea863ec4c7d409e262f97dafe86d056f2c86410660de5d504541331e3e35343"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027submit\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/slopPledges.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8948e437765c17ff8f813527c8370cfbe1a6d6b2157429f6a9f0b1ddf9a21b9d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027list\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/convex/slopPledges.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3c707d2e1b852da689712f9cdfe0b9efd06437407e735c08f81e3d6ef3882c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getSymbol\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/baml-docs/index.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"676ae25227482375fd40e16e2c829e49adba98d26153f736e1aecac892fb0483"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getNextEvent\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/luma.ts"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ddb76dc1f986fd7e984aaf9d1cfee0250ba2e06c316851201811343bd9ddbc8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027useWaitForWasm\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/atoms.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e53d4d85da2fdcfa72b9aaf0de4e7031489e704a7f95bacb80eb42fcd28b8d8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027isPanelVisibleAtom\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/atoms.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da5b4e20d6b36279702a426216213f8b0c80ef9613c2c117f7fc331007fff99"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027selectedItemsAtom\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/atoms.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36bc2ccb3ce4474cd22952c08edae11085196d97d934c804728364eedb31932"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027parseJSONL\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/bfcl/_loader/utils.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bd8c8c578f1b0b40fc8ff3d4f154ba7157172568e43ab7f0e177e960f342ef"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027createInitializedBamlWorker\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/playground/spawnBamlWorker.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f37c562bf3c9fb32bd9e14ebbbe1f8c57ea7937c74e5ac21bc320d501519c6a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getBamlWorker\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/playground/spawnBamlWorker.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1a8ca9259615a2527d51d7c87833225f9002835be376be6378172d0b80c087"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027default\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/telemetry/TelemetryView.tsx"},"region":{"startLine":3466}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04247fce8d9e06a22edf70d0718186dde1fe31cb5a60e9a738ceeb2e6ab4c28"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027HANDLE_FUNCTION_REF\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/typescript/bridge_typescript_web/typescript_src/native.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9864d41b46b6954c61b793fb7cd1a784775fb84f2867e73e2a443b23267afa"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027generateMemoryPlot\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/typescript/tests/load.test.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"83089a2f98f7b4dfe964f5a612a0b748b7a37d03e83c5767738cb5ebae75a8d1"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027JANE_SMITH_TEXT_RESUME\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/typescript/tests/modular.test.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c45debdb1be2f0115a1c66addabd3d75f8a89b7184226222a45655e6c6ec1f9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027JANE_SMITH_PARSED_RESUME\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/typescript/tests/modular.test.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"9152e4a3eff69d25fd20b61146dbace1cd7c4f5ffd13aff21a42964ee4090459"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027arrayWidth\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/typescript/tests/type-aliases.test.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26c43ea3704b95e5471ebbd8d50cac8b7072c4551a7c7e0b0a0b14ce0689e6b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027declarationHead\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/stdlib-matrix/extractors/ts-surface.mjs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a27ab6b2a4e842006c894256d179fa3f94d7d1fc1d45dc106dadb9bad85c7d0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027getStars\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_components/GithubStars.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"1caeb607307e9cac6eee80e4b228a5f4b08d0da82e7528300b3bff834443bf3c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027Params\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/page.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7fceca0d30345c6ab313cba7eb4c51f3cbebfa4d3c886218ec6146385ba181"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027main\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/public/main.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee149ae9a9f1544ad46ebb1d00d9757eea629a03c38b1bdbdb6c68775c5d987"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027isE2ETestOnPullRequest\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/plugins/language-server-client/index.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa574976cf210d3f33ec9046d65d0d94d59bd91f6cb4a1e4b1ecf9f8898b5e7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027onFileChange\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/plugins/language-server-client/index.ts"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"90de36b0b0da6956aef2ca7cc3d866308dc9c41af3a3d38f5bbe63318414df7d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027TelemetryLevel\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/telemetryReporter.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dccd2ea018559f43e43266576dc548a9a91693a1d5fbfba696056d52576426f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027showToastToSwitchColorTheme\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/util.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b7577ecf2d9894c7a6d20fd1da80b8ed3e37e7a6495d1b9111e4e97386d43a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027BreakpointBadge\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/components/status-bar.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf778afe7d70ccd4c60a3b57f11ef9e3f54ee39f826c9cafa491bd1b859d0adb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027createLog\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/runtime/simulator.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d3e5d09daf803fd148b8dc257a43d4064a4a8c1ff736193faba8d1cc00eef9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027getPositions\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/atoms-orch-graph.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"06052fe0439ad16f296172a2b03216d57aeef0581c1ed99ac3bdc0f095df8ea6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027createClientNodes\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/atoms-orch-graph.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0f7daa466e3051700156c1b9488126bf9bb0ef42424054a079540ad4b5ac1f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027buildUnitNodesAndGroups\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/atoms-orch-graph.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b96039703d62af4fbae6c1d4ccd012eac32abf02e5e2a06ce3c423479acc99a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027createEdges\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/atoms-orch-graph.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"1294f1a53f5692cee1aed692dbf1f875741b23e0cc42d3a81e7b6dce3301ca9b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027NodeType\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/atoms.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d4f376a2d8e3dce99ea19929ccce6b8366f484d293b4f944c86ddbba1f8843"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ImageStats\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/prompt-stats.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c166d0b3a70a3184b8639d1f856f44e0358d57298bdd62f92b2f70309fd0180"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027globalMatchCounter\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/render-text.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8f48ae3b8b2e488dbfed0aebab0644cba4063b6f63e22d5337e67d8b10ed0a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027globalMatchCounterResetKey\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/render-text.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdbd7a30b1a0735dba7765aca1d77e83e87dafd397418c4a3580b7879a2bb1c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027testMarkdownWithJSXBlock\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/components/TabularView.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad560c21fb95b9344f74857d419d4b10d2c70f0ec63630ab49c550138c3e0928"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027CopyButton\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/test-panel/components/TabularView.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e834f198e7bbcdcd102de637b4fe06fe6aeb3a1b23e7039401abefb05d539e8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027createSpan\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/test-item.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"114919a033600f5b25ad031a2e21df162324a3c50647d8b74ac572cb5ceb0e11"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027FeedCommentCard\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b17cd1ed8480249badd466f957195d3d59d75eeaa4d9cad5c285c22309d2568"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027bamlCode\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/_lib/config.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7f1447a08142108bbc956317ee3fa4f820999a8de8e3889002f56b74e9f537"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027bamlCodeJava\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/_lib/config.tsx"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"6446187a4bf34eff9b94fb07c596fd565abb65b74006a41aaceae8f4742b7e61"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027fakeBamlCode\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/BamlBlock2.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac28f1271886c18b266e5154dfdc0755a41371129f30ee8d3635766a57fca8d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027fakePythonCodeBlock\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/BamlBlock2.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5442f397e856d6993a12e0a07479e7333d8f86e85b2defbbfdaaafe351cbb911"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027fakeTypescriptCodeBlock\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/BamlBlock2.tsx"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"19bb20d3517d778b4fcdae9209da1e70209a56378985d7fa491145fe399d2d1d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027SidepanelProps\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/side-bar/index.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ee88472972676f845a9c1f4bf2665dcc63fc83a75c2946a50b7cb7dcefba45"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027CodeElement\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/code-blocks.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64141d869cad02d90ac6a72251a575705ecfa7bcc20231354dce5f9b738602d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027tokenAt\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar/preview/main.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9e74a6842b1ecfb30d61b3d3ee3e45770f690e3fc80b6c748c58c92f6cc708"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027payloadToTraceCallValue\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/run-store-projections.ts"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"3798fbe64219f498140c0c3b455e60ec54989d9ef391cefce26da4c7ec973ab5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027isLogPayload\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/run-store-projections.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d383d167f68e4cf2ea42d1516d783c1d38e935af6483b9e8fc0a8c317e4221b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027isCallValuePayload\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/run-store-projections.ts"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1d87566f6e660f224da2408970c47f2f8fed98bb7b83097e309b9d290bcf96"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027jotai-devtools\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/playground/src/stories/api-keys-dialog.stories.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1541925771b8c1dc5126f6b90b18bfdd91a79fea555ec1ebe247b58d597961b0"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027vercel\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f0a0c124d2b549b8951a41300347aef7ebee6ac70203a94e9c58c3e237bf0149"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027wrangler\u0027: Declared in baml_language/sdks/typescript/bridge_typescript_web/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"767bacc8a000a0383e750c7d114045d03fc7e1b5fafb5ea9013c80ead03a98cd"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027npm-run-all2\u0027: Declared in engine/language_client_typescript/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"75671304e9396e095de1b603e67042975a5e4b7ce1b6456d3c5334d6e945352f"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027tailwind-merge\u0027: Declared in integ-tests/react/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5e1e7a3728b4cd5f94095479cbdc860595d464b3244a58130b9c3ae08f051b8a"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027tailwindcss-animate\u0027: Declared in integ-tests/react/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"58d9373e721b5cc96aaca419eb6d82f48d35a6d09e419fa162c9f2fa0a0826bf"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027ts-node-dev\u0027: Declared in integ-tests/react/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dd9957d5dabb9449e7f8b65fad052263c0b9192dd4cb7324a2a4a177809d2c50"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027zsa\u0027: Declared in integ-tests/react/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"134b842245f423004c1a5b7fb2e42059e97e02e5174ce779b2a78fe48df53cfd"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027zsa-react\u0027: Declared in integ-tests/react/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a49cbdf01657ae6c67143eee47fdacfe7e1d4f554e0efc2172f12f86a6556846"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027aws-cdk\u0027: Declared in tools/pkg_boundaryml_com/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a11a805b8054b3f54823d93502ed2e9c5138fe6d7b869ba5ab51a03b7d95d239"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@microsoft/fetch-event-source\u0027: Declared in typescript/apps/fiddle-web-app/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"920bc99aa4379917b037dab0a448cdac6d4958067f144308a3e0b5b2929fe7cf"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027http-proxy\u0027: Declared in typescript/apps/fiddle-web-app/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"724cc9b074abb64806a0df6ecf22634f4d070bc6c2597a42da880afa2f4cd4f7"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@baml/playground\u0027: Declared in typescript/apps/vscode-ext/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b192e5ee870318701fba9c86563fd98fbe9d8bb5222c04a4a2ac17327e0da827"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027lucide-react\u0027: Declared in typescript/apps/vscode-ext/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"eab57b088c38acb9181b5d66ca8f5dffb4029e8388f410e7bd8d8c7df21947b0"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027next-themes\u0027: Declared in typescript/apps/vscode-ext/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4cf708e634a7f6c7ae645663428dac0f93ba271ac13eeb35844dbc877dd03ddf"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027react-refresh\u0027: Declared in typescript/apps/vscode-ext/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"20d0e0fb5987aacbcf463a97bd3640dbc346d2c21b548f8eb7b67cedf07fb57b"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027unique-names-generator\u0027: Declared in typescript/apps/vscode-ext/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"50b5c70960db521755346bc7ed219573310ae59d9bb36958a909b846df4373f1"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027uuid\u0027: Declared in typescript/apps/vscode-ext/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4dca5f550b6f60c4d3865ed21e0a1a98e049d326c29655ed6f70ad2f8652056a"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027vscode-tmgrammar-test\u0027: Declared in typescript/apps/vscode-ext/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ab6d0440ea8e354c19e12bf2aa4afee9c09fb695be103cfb096970868137fc4b"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@radix-ui/react-dropdown-menu\u0027: Declared in typescript/packages/playground-common/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4253a26c1070d1deb9a81e2ff1e3c7a7b254c6b53d16008cff16d6daedc56196"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@radix-ui/react-icons\u0027: Declared in typescript/packages/playground-common/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"990869c690cb8d9278c75a4bca4e652110f0d03b6c4d1a54dcba56848ce7b8d7"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@radix-ui/react-select\u0027: Declared in typescript/packages/playground-common/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d52d3ef137cc0b8c3db2428ff61c40c271aa9cc5cddef821d75eddf2c59149c9"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027class-variance-authority\u0027: Declared in typescript/packages/playground-common/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ac023dc559beab15c9656517c0ee70dd3c0de6de08c663464ef27db458a59f54"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027date-fns\u0027: Declared in typescript/packages/playground-common/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1ed19b4613edf7c6b5d7bd8cc3aa30898a12fabe23686c91fedb9dd4318c2769"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027lodash\u0027: Declared in typescript/packages/playground-common/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1f711faf2e2b1a87e0314b649818f0e12f7fc69463c081d864cb803401b0715d"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027react-svg-pan-zoom\u0027: Declared in typescript/packages/playground-common/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d24630982a0da7cbc0c5a823df1ca1553f502c70f465ee5305347476f51a5676"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027react-zoom-pan-pinch\u0027: Declared in typescript/packages/playground-common/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"04ea0d6f7bc6eab97f0ab876b61534e046b768dc2904cddf0f7081d30047c3d2"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@githubocto/tailwind-vscode\u0027: Declared in typescript/packages/ui/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ef27b4b80d661386b854e0e6053875e58ef1b46173c2f4341216eab6ec4ef1b3"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@hookform/resolvers\u0027: Declared in typescript/packages/ui/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dc626143aae3968fcb0054bf300805b330bc4cd46d63da178ebc29d66fa6d5cf"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@radix-ui/react-portal\u0027: Declared in typescript/packages/ui/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9423facc13ea7923e549be934fef62b13d88d2ef49c96ef8a94959fc6de7c442"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@radix-ui/react-toast\u0027: Declared in typescript/packages/ui/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3be680349ca2d341b4fd94214d040420fb55b8362750747e2510f3d6ce0413fc"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027classnames\u0027: Declared in typescript/packages/ui/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8a70ed91321ba4429ec0ac6c44c60ab58644335e2d954aa6a233568d66a09400"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027cobe\u0027: Declared in typescript/packages/ui/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5c0c298f42341a84f646d705da9f049cc5449885e1ae6c66bafbb7b6f1d0bdc8"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027color-bits\u0027: Declared in typescript/packages/ui/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"41c4830bd87fcafcdfbdef0bd17a7c7db21aa4a64cc494e48137b3b631de0e40"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027framer-motion\u0027: Declared in typescript/packages/ui/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6062a161637b4d1d5bea412b03c65c849b5acd3bed768a1affdce10be31d4431"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027markdown-to-jsx\u0027: Declared in typescript/packages/ui/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1ff4e2b8b0e97f517af5400cd5d30a094c78f916eb54b22b2a2aac2fac3a28a8"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027marked\u0027: Declared in typescript/packages/ui/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8c18a72845abf594656e25d5b1f0a4f9f9343012f96a1edf46a8ac1ba7bf616e"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027nanoid\u0027: Declared in typescript/packages/ui/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fb0f93bf9023a10447be6efde730244f43d02cca2c52ccb92b5951f6d3edf6e6"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027react-expanding-textarea\u0027: Declared in typescript/packages/ui/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"faa46ba511464d0655f5da4de90be4d0531c745dca9ec6c48d731dc0efe4586e"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027react-markdown\u0027: Declared in typescript/packages/ui/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0876d9818d18eb8ceb2f84315dd0f9328ea901bf35d425d16413ac0d4f58b023"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027react-spring\u0027: Declared in typescript/packages/ui/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4b0639d4fe463766a823781919c90421eed4abd86efeba647c03eae1cc813bda"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027tailwindcss-animate\u0027: Declared in typescript/packages/ui/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f0030c2eb940fe4b6ad353889a946561f6e1a180cd67a7d572d5049b53b9e612"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027zod\u0027: Declared in typescript/packages/ui/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"961627e1e040ff88b823ea282e1b0f737e31c7c4f2a811202c81b5c4ad355d9a"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@lexical/code\u0027: Declared in typescript2/app-beps/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b1b024d2462c79acb1019ed80608e23ec9ae219e087941195c1b35f7ecd06f61"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@lexical/list\u0027: Declared in typescript2/app-beps/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cdcf548b1c9066e69af12bc24df349cf270f17dc4f3aed77ac042f5198d93c04"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@lexical/markdown\u0027: Declared in typescript2/app-beps/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"33f5c9c5a4fa58a67ceedef79d713d1ef39c81db6378c6e27104db2f14f55cbc"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@lexical/react\u0027: Declared in typescript2/app-beps/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a90d31bb307ff5121ddf521ff8fe2a7de20ad63d5de61dfe920727c3990c8942"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@lexical/rich-text\u0027: Declared in typescript2/app-beps/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"78299dedac2c5326595b8a3e3c78c86ad6347266eb207478a4ca93a5c860f72e"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@lexical/selection\u0027: Declared in typescript2/app-beps/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"907728763a629a778a9d842308266250bac576fb19f1a6020516c9ed02082f5b"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@lexical/utils\u0027: Declared in typescript2/app-beps/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d812fba3104fda2a7f07801a7b48bb873a6bb126813f2562d11fa905853fd5bd"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@radix-ui/react-avatar\u0027: Declared in typescript2/app-beps/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cd1bcfce0782fac7b3ad768f33dca558604d9659843b1eec3c83b34b06c38d96"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@radix-ui/react-separator\u0027: Declared in typescript2/app-beps/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5ccd8db755b60462e0e573bd7c0102840ac9ad9550888986e33891ec835ffd33"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@radix-ui/react-toast\u0027: Declared in typescript2/app-beps/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3c0cfc749acca2bb7e06b0f9d25d071b6d1e21e89293dfad7a41d0e38d3a05dc"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027lexical\u0027: Declared in typescript2/app-beps/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"43d5bdc5f7cd68157cfc6c5fa9d18a7e0550063e26bf1e935961957d2f7d1f84"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027uuid\u0027: Declared in typescript2/app-beps/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c54c4dd8faa5d758234a1581b0ca77b1cae0d471a87edea76b29116ed78df292"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-environment-service-override\u0027: Declared in typescript2/app-promptfiddle/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2181e502c17bb9b190697a4231509bc4dceffbafb9682fe445b2c0c00d90edb3"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-explorer-service-override\u0027: Declared in typescript2/app-promptfiddle/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f4a523cc3480a2598a9f7f72d1cb98947ba48a4527b4de9814d3beb8bfb7011e"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-files-service-override\u0027: Declared in typescript2/app-promptfiddle/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dd1d0ef77025acee097f8c1b2820f4bacf0e9d4130c44e2a3d812ea6ea3adf3c"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-keybindings-service-override\u0027: Declared in typescript2/app-promptfiddle/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"86cc9d64b01f739dff748b41c5c9d60e78c98d3b84cea003fb1d987fd5b54e74"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-lifecycle-service-override\u0027: Declared in typescript2/app-promptfiddle/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6936a9734d500770728ef601fbd4f6e9ec61e76e7d4cb332d122e83f4afafc18"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-localization-service-override\u0027: Declared in typescript2/app-promptfiddle/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5ae67cd741cefb7110cb26d21c39393194e531dfc8a4218d3ad6a1508461d714"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-outline-service-override\u0027: Declared in typescript2/app-promptfiddle/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e98cd6f4140c712ef2bf0d3bdc3a01192686e2496081290a954c8220ad0bed3e"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-remote-agent-service-override\u0027: Declared in typescript2/app-promptfiddle/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"da6a25de0dda11d31d1cfb72e6aaa1dee997e9abc4295056971346d5a8c6a342"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-search-service-override\u0027: Declared in typescript2/app-promptfiddle/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4cafa916f0cf60784ac7f355395cfd21a916ba314c0f3780209fb20639cd0dcd"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-secret-storage-service-override\u0027: Declared in typescript2/app-promptfiddle/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f1a6d1f5bdb8992d63c5e7864f0f40fb4ee728164cbb9828a764f0e73a9cd9fa"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-storage-service-override\u0027: Declared in typescript2/app-promptfiddle/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"47e9189482c98a24f94e9b7ee70c280822cab2fc13ae20006251bdd8d282d3ad"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-view-banner-service-override\u0027: Declared in typescript2/app-promptfiddle/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0163fd6e07fd1838f4c3f4ec7d2b810b6e9833424f60316b2ef6dac00090dc50"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-view-status-bar-service-override\u0027: Declared in typescript2/app-promptfiddle/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ab0604f69d1d01aa0a8fb4715067a04b779140ade4eb63400e11596f0e84ceac"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-view-title-bar-service-override\u0027: Declared in typescript2/app-promptfiddle/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7402d5dc45d6d5115531051e92408bcb0c238134bad060071338ea2287ec8bda"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-views-service-override\u0027: Declared in typescript2/app-promptfiddle/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2439a8c72ba7adebce71b2e732b7f349a3501be60cc98803262b0b6a489713e9"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027vscode-languageserver-protocol\u0027: Declared in typescript2/app-promptfiddle/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5583cebfab068a2e35873e999d893f1a3fa6829cd7d5f782b01dc579b4274742"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-environment-service-override\u0027: Declared in typescript2/app-vscode-webview/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"33abfe60da8ff63121196697398b9eaa493c114dc2f55c2b4cc05bf9952dd274"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-explorer-service-override\u0027: Declared in typescript2/app-vscode-webview/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c1af2380c12276dd55d2ed176570464b68212982ccb92e1eb0502a4586c54e53"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-files-service-override\u0027: Declared in typescript2/app-vscode-webview/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"99873df116814d7d5c26f201e91383f177ae53e1a467a1f861057e1d9e2d320b"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-keybindings-service-override\u0027: Declared in typescript2/app-vscode-webview/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cf1b7f3c41b28c428c12c33142b8f080536079ad36c19f22159502a0932a1118"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-lifecycle-service-override\u0027: Declared in typescript2/app-vscode-webview/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fbffc351d22ee739ac60e2f047d25eb1f245ab7db7d783f3d9c6e75b55b11486"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-localization-service-override\u0027: Declared in typescript2/app-vscode-webview/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"280a3ad61d79dba9f462501adb0cfb4bfde00f621a8bd6361e657d8ef9e68781"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-outline-service-override\u0027: Declared in typescript2/app-vscode-webview/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ace4348164a2313c96576bc78494ee718bce6592ac6aee3ce8e7ae04c4aa7182"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-remote-agent-service-override\u0027: Declared in typescript2/app-vscode-webview/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7d5bcbe33c4cba126ee03b50b9acfb107724015eafcb952a5658f0bbac38dd72"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-search-service-override\u0027: Declared in typescript2/app-vscode-webview/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ba6340ed87a21715ebc71cc4aaf2e7e3a4eac2f0bf4442c58cda5daa91baae0a"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-secret-storage-service-override\u0027: Declared in typescript2/app-vscode-webview/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8da3a9122b3b81ab00dd58c027c680ce921d7bd48c146ebda3ea3afc7fc49f82"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-storage-service-override\u0027: Declared in typescript2/app-vscode-webview/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ebb3c8a9df361a3bc0e0240985a77f2de826cd7e4be05decdc0c0e775deae72c"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-view-banner-service-override\u0027: Declared in typescript2/app-vscode-webview/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"625a72ea2255510ab78937d369b5fd4ce1e00b2a010a7a79107fc5583ab0a4e9"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-view-status-bar-service-override\u0027: Declared in typescript2/app-vscode-webview/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7e32c80077f03febf12839f277e11817b977f19b206afffe2aa13d42eecff295"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-view-title-bar-service-override\u0027: Declared in typescript2/app-vscode-webview/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a40f7c8dafc3ed1da8a7bba7f12662ad0310a9b0b9354bd261e0d48bb3dc09dd"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-views-service-override\u0027: Declared in typescript2/app-vscode-webview/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"565ac87ed86173188cbbfcc7cb1d70fe6d68e10921c558861fecadc8112a3c38"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@testing-library/user-event\u0027: Declared in typescript2/app-vscode-webview/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"24f9a522d388fc05f64222dc6b4c2c22b471a92d1ae1002b95165d056c48201f"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@bufbuild/protobuf\u0027: Declared in typescript2/app-website/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"47b9ff5d7f4679382c3907ac7fbb3b0db1a302dcc5963464e6aacbd63e4844f8"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codemirror/lang-python\u0027: Declared in typescript2/app-website/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f986e9fb9894479c56b712aed4ef7744b55623300e9072db51cd0d53f074789"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codemirror/lang-rust\u0027: Declared in typescript2/app-website/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a9b214e331edcffd7aa4f31e41cc6c9cece1abd54e986cdd9ce6b7a605258463"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@radix-ui/react-icons\u0027: Declared in typescript2/app-website/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b9a6570965e150d58c95cac74b9d4719363f1fc15305dbd8e3d9537b29cc0086"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027select\u0027: Declared in typescript2/app-website/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3dedb276cc83e84a8a02b5a53aef5feb771e36f8f4df0a506a2923a20b3cac85"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-remote-agent-service-override\u0027: Declared in typescript2/pkg-editor/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b7ab18a9ea4789d73dbfbb09b1e4a9583dd5509ca9a2013006959fca6ab7015d"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@codingame/monaco-vscode-views-service-override\u0027: Declared in typescript2/pkg-editor/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"95ca734ee8a30fd96f2f8fbbf3513cd001f04d2e95e7151c66e7c1abfc68082d"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@radix-ui/react-collapsible\u0027: Declared in typescript2/pkg-playground/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8e7ae288309f4e53df27debd55fc40c8121186f3384db82b9066065fcf64dae5"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@radix-ui/react-dialog\u0027: Declared in typescript2/pkg-playground/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"adf058b2a08555486c5a8dece0545c0999f28443d68ebd33f771d92a175cb988"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@bufbuild/protobuf\u0027: Declared in typescript2/pkg-proto/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"89651ef4ccb333d4d71fecac27c800bc6176261c719259723120a3a937ac2493"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027ts-proto\u0027: Declared in typescript2/pkg-proto/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1c818cf3c7fafcc377bf8206d46f55d335af4c701da8df6ba81911dbe8d4fcc7"}},{"ruleId":"R8","level":"note","message":{"text":"Type-only dependency \u0027@smithy/types\u0027 in production deps: Every import is type-only \u2014 move it to devDependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/webview-to-vscode-rpc.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c60df6c5d1a25bdb214b0ceee0b0a6ed333e0dbd9c0b9c10f131069b56466c"}},{"ruleId":"R8","level":"note","message":{"text":"Type-only dependency \u0027@smithy/types\u0027 in production deps: Every import is type-only \u2014 move it to devDependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/webview-to-vscode-rpc.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d2e2f2f890cb47336e45bbb634a331c8bd931ea158a8228b30f82827532145"}},{"ruleId":"R8","level":"note","message":{"text":"Type-only dependency \u0027react-resizable-panels\u0027 in production deps: Every import is type-only \u2014 move it to devDependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/index.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1eddf2a24e9146ee7c64ab74148a8b3bfc11415c57fc5492eab289198076bc4"}},{"ruleId":"R8","level":"note","message":{"text":"Type-only dependency \u0027vscode\u0027 in production deps: Every import is type-only \u2014 move it to devDependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/worker-backend.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e51043d712e9413e58cb12ea80abd1c8dd4f83db5da1f9d3a2f4020b081efb"}},{"ruleId":"R8","level":"note","message":{"text":"Type-only dependency \u0027unified\u0027 in production deps: Every import is type-only \u2014 move it to devDependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/rehype-highlight-code.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4ca10d11ab39b9b72663d49a3e80a76224495935d65291323c75d1bd4275ee"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (3 files): typescript/apps/fiddle-web-app/app/[project_id]/_components/EmbedDialog.tsx \u2192 typescript/apps/fiddle-web-app/app/[project_id]/_components/ProjectView.tsx \u2192 typescript/apps/fiddle-web-app/app/[project_id]/_components/TopNavbar.tsx \u2192 typescript/apps/fiddle-web-app/app/[project_id]/_components/EmbedDialog.tsx"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/fiddle-web-app/app/[project_id]/_components/EmbedDialog.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b112c8e5246fa8a7ab67fc58644ccccad864251ddde8656c6434513edc62ded7"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): typescript/apps/vscode-ext/src/panels/WebviewPanelHost.ts \u2192 typescript/apps/vscode-ext/src/plugins/language-server-client/index.ts \u2192 typescript/apps/vscode-ext/src/panels/WebviewPanelHost.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/apps/vscode-ext/src/panels/WebviewPanelHost.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a39d4326e71a916f1520a938ba2e8baa37121ef2d011dff192b799432f6d4b0"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/atoms.ts \u2192 typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/unified-atoms.ts \u2192 typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/atoms.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/atoms.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc5a3b0a2fde53a4d53c9962a4f6e9c33502242b85f1125c558da00e58910d7"}},{"ruleId":"SC1","level":"warning","message":{"text":"NuGet dependencies are not locked: No packages.lock.json and no central package management \u2014 restores aren\u0027t reproducible or pinned (SSDF PW.4.4). Enable \u003CRestorePackagesWithLockFile\u003Etrue\u003C/RestorePackagesWithLockFile\u003E (commit the lockfile) or adopt Directory.Packages.props. Advisory \u2014 never scored."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0a97b4f69ccac509400ece7eedefb06d3ede0522cd4d8bcb5c068bea719545a6"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: engine/generators/data/dynamic_types/typescript/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/dynamic_types/typescript/package.json"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a34547984355e0b7b64006a77fc58c60aa6324ea77a4003c54a625bb6694c0b"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: typescript2/pkg-grammar-hljs/mirror/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar-hljs/mirror/package.json"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"0289c74800cdb61b175cd6f39ee21e53e925676c52bc52ecc2df04dbde7760dd"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: typescript2/pkg-grammar/mirror/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar/mirror/package.json"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb4d93428ecd43d13b87b761b2208944fa5af7d921f94f5031b23e6d5ba0be8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060HostValueRegistry.Shared.EntryCount == 0 \u0026\u0026 HostValueRegistry.Shared.InvocationCount == 0 \u0026\u0026 NativeCallbacks.PendingCount == 0\u0060 appears character-identically in 2 files \u2014 baml_language/sdk_tests/crates/csharp/host_callables/Program.cs, baml_language/sdk_tests/crates/csharp/primitive_edges/Program.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdk_tests/crates/csharp/host_callables/Program.cs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"e692df6d9ac68b0c3d167828dcdd4b532288a0fc875caa7421c12c5652a79623"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cancellation.Origin == BamlCancellationOrigin.Caller \u0026\u0026 cancellation.CancellationToken == caller.Token\u0060 appears character-identically in 2 files \u2014 baml_language/sdk_tests/crates/csharp/failures_and_cancellation/Program.cs, baml_language/sdk_tests/crates/csharp/host_callables/Program.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdk_tests/crates/csharp/failures_and_cancellation/Program.cs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"8632b3f5b8339e5da48df674c6b592459a9fa5369038affe3291c419d2ecc3c5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060math.IsNaN(parsed) || math.IsInf(parsed, 0)\u0060 appears character-identically in 2 files \u2014 baml_language/sdks/go/baml_go/runtime.go, baml_language/sdks/go/baml_go/value.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/go/baml_go/runtime.go"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de628887e9f269677bef486865a1cf1591f463bdfb9d5bcacb28d32028468fc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.contains(\u0022linux\u0022) || n.contains(\u0022nix\u0022) || n.contains(\u0022nux\u0022)\u0060 appears character-identically in 2 files \u2014 baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/NativeLibraryLoader.java, baml_language/sdks/java/gradle-plugin/src/main/java/com/boundaryml/baml/gradle/BamlPlugin.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/NativeLibraryLoader.java"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"358a08d72387fe48db336f3712b2210430c01be54c538451b7f527c84b3e84d4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.contains(\u0022mac\u0022) || n.contains(\u0022darwin\u0022) || n.contains(\u0022osx\u0022)\u0060 appears character-identically in 2 files \u2014 baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/NativeLibraryLoader.java, baml_language/sdks/java/gradle-plugin/src/main/java/com/boundaryml/baml/gradle/BamlPlugin.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/NativeLibraryLoader.java"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc513a4967d7389ad81ba3a1035391a5598af31af60a2f030def9a782b0bcac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!(\u0022property\u0022 in callee) || !(\u0022object\u0022 in callee) || !(\u0022computed\u0022 in callee)\u0060 appears character-identically in 2 files \u2014 typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-module-mocking.ts, typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/reflect-method.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-module-mocking.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c96345813dd1f746771d8bdaf1324ecf8a8de556bdab94ccfa5ab44245043c2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isFinite(date.getTime()) || date.toISOString().slice(0, 10) !== value\u0060 appears character-identically in 2 files \u2014 typescript2/app-product-metrics/src/external-data.ts, typescript2/app-product-metrics/src/jobs/aggregate-weekly-metric.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/external-data.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7582b11877b634db9db0a05d3b51d3fa278095d3d79b56251f46b4c75790506"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isSafeInteger(value) || value \u003C 0\u0060 appears character-identically in 2 files \u2014 typescript2/app-product-metrics/scripts/backfill-six-weeks.ts, typescript2/app-product-metrics/src/jobs/aggregate-weekly-metric.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/scripts/backfill-six-weeks.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e4d6498e1d9b7890b284ee2256cd34a2a20bbdaaafa2c18376ba9dce707495"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!body.content || typeof body.content !== \u0022string\u0022\u0060 appears character-identically in 2 files \u2014 typescript2/app-beps/src/app/api/agent/beps/[number]/comments/reply/route.ts, typescript2/app-beps/src/app/api/agent/beps/route.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/api/agent/beps/[number]/comments/reply/route.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a111fd7336b739d8ca0df2b8c65791a41eff8ab9d86b1fc9a21374d6981513b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!searchQuery || searchQuery.trim() === \u0027\u0027\u0060 appears character-identically in 2 files \u2014 typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/prompt-preview-curl.tsx, typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/render-text.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/prompt-preview-curl.tsx"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d12b7d4eb5028ce0683a42a7e183bb4762ee214a27525d84a9008321de8c65"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!stateStyle || typeof stateStyle === \u0027object\u0027 \u0026\u0026 !(\u0027active\u0027 in stateStyle)\u0060 appears character-identically in 3 files \u2014 typescript/packages/playground-common/src/graph-primitives/nodes/BaseNode/index.tsx, typescript/packages/playground-common/src/graph-primitives/nodes/DiamondNode/index.tsx, typescript/packages/playground-common/src/graph-primitives/nodes/LLMNode/index.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/graph-primitives/nodes/BaseNode/index.tsx"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1225679b07aa819a82d157a683af3a168ebf84b299f428369edca3ed9672e6ad"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!tokenResponse.ok || typeof tokenBody.access_token !== \u0027string\u0027\u0060 appears character-identically in 2 files \u2014 typescript2/app-product-metrics/scripts/fetch-zoom-six-weeks.ts, typescript2/app-product-metrics/src/clients/zoom.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/scripts/fetch-zoom-six-weeks.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b592ce2e8059374ac8a535ac1c31313783a4807d58131a04525da32a9c12933d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!value || typeof value !== \u0027object\u0027 || Array.isArray(value)\u0060 appears character-identically in 5 files \u2014 typescript2/app-product-metrics/src/clients/discord.ts, typescript2/app-product-metrics/src/clients/zoom.ts, typescript2/app-product-metrics/src/external-data.ts, typescript2/app-product-metrics/src/jobs/aggregate-weekly-metric.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/clients/discord.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f25400d5d29313405f6ffda13cd8727f138022d231a218c32acde99b1420ad4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(e.metaKey || e.ctrlKey) \u0026\u0026 e.key === \u0027s\u0027\u0060 appears character-identically in 2 files \u2014 typescript/packages/playground-common/src/shared/baml-project-panel/codemirror-panel/code-mirror-viewer.tsx, typescript2/app-website/lib/mdx/baml-block/baml-project-panel/codemirror-panel/code-mirror-viewer.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/codemirror-panel/code-mirror-viewer.tsx"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b393bee9a2475df63f43ee4ec71ec9a83fd80919d345dd4ee1738d7357c5773"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(p1.x === p2.x \u0026\u0026 p3.y === p4.y) || (p1.y === p2.y \u0026\u0026 p3.x === p4.x)\u0060 appears character-identically in 2 files \u2014 typescript/packages/playground-common/src/features/graph/layout/edge/edge.ts, typescript2/pkg-playground/src/graph/edges/BaseEdge.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/features/graph/layout/edge/edge.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"68901fa444ac9d926bf020bf4893bb85aafd9b16ebf01e3e2f35638230cced4b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.parseFloat( getComputedStyle(document.documentElement).scrollPaddingTop, ) || 0\u0060 appears character-identically in 2 files \u2014 typescript2/app-developer-docs/components/book-chapter.tsx, typescript2/app-developer-docs/components/docs-toc.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/components/book-chapter.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4da88ed82843654a428edc79263ef907f7fae3fc9801cf29233c5120bc5af4d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060annotation === null || annotation === undefined\u0060 appears character-identically in 4 files \u2014 typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-known-value-widening.ts, typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-object-parameters.ts, typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-unknown-parameters.ts, typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-unknown-returns.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-known-value-widening.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e91225312cf1c2a3577fc54ed8643d45fa16cbd7f7fe710697fa457d5a3bd0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060argument === null || argument === undefined\u0060 appears character-identically in 2 files \u2014 typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts, typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/type-alias-resolution.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2276cd7885a4accd2bc8f1c4d76ff6aefbee267dcc7dadaea20b825d847341f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060baml == null || typeof baml !== \u0027object\u0027\u0060 appears character-identically in 2 files \u2014 typescript2/pkg-playground/src/renderers/PromptAst.tsx, typescript2/pkg-playground/src/result-renderers.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/renderers/PromptAst.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f495d8e2f41ab42fd0c0a932c452374cce9a089391aa00d01ca33323310cc7c2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060block.page.page_kind === \u0027package\u0027 || block.page.page_kind === \u0027namespace\u0027\u0060 appears character-identically in 2 files \u2014 typescript2/app-developer-docs/lib/generated-content/document-projector.ts, typescript2/app-developer-docs/lib/generated-content/verify.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/lib/generated-content/document-projector.ts"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"663afff96d509eef8f38895d7e2bb31a7a5ec5c3f3c99574c64e1dd7eac15ee9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c._id !== sourceCommentId \u0026\u0026 !c.parentId \u0026\u0026 !c.resolved\u0060 appears character-identically in 2 files \u2014 typescript2/app-beps/src/components/decisions/decision-form.tsx, typescript2/app-beps/src/components/issues/issue-form.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/decisions/decision-form.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d68b0a92bc2cfdd2bd375d424cce2f7b6399a4af25b35736468cd53bf93be93"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060current !== null \u0026\u0026 current.type !== \u0022Program\u0022\u0060 appears character-identically in 5 files \u2014 typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-known-value-widening.ts, typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-runtime-typeof.ts, typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-unsafe-dictionary-type.ts, typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-widen-then-assert.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-known-value-widening.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"c826a4318fb8cd8ca200bc434e27ea35071a831fccc51b6b72e844f8993707ad"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060databaseContext === \u0027production\u0027 \u0026\u0026 !parsedArguments.flags.has(\u0027production\u0027)\u0060 appears character-identically in 4 files \u2014 typescript2/app-developer-docs/scripts/backfill-document-store.ts, typescript2/app-developer-docs/scripts/migrate-generated-content.ts, typescript2/app-developer-docs/scripts/populate-generated-content.ts, typescript2/app-developer-docs/scripts/promote-document-alias.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/scripts/backfill-document-store.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6c19da709fae4253e38fb1e5513adca56916ab4f2c8765226e4fa6caae8efe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.key === \u0022Enter\u0022 \u0026\u0026 (e.metaKey || e.ctrlKey)\u0060 appears character-identically in 3 files \u2014 typescript2/app-beps/src/components/comments/comment-feed-view.tsx, typescript2/app-beps/src/components/comments/comment-sidebar.tsx, typescript2/app-beps/src/components/comments/comment-thread.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"356f8995cc22122e05b4ab68a43235e3254780fcf48fd3268459c2beffd60861"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.key !== \u0027Enter\u0027 \u0026\u0026 event.key !== \u0027 \u0027\u0060 appears character-identically in 2 files \u2014 typescript2/app-stdlib-matrix/src/components/matrix-symbol.ts, typescript2/pkg-playground/src/telemetry/TelemetryView.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-stdlib-matrix/src/components/matrix-symbol.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e6c693e4b9c6b2d41abdc1c8f954efe5c208d2f89ede9535191d6bd0ea5dd9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.name !== config.eventName || event.location_type !== \u0027zoom\u0027\u0060 appears character-identically in 2 files \u2014 typescript2/app-product-metrics/src/clients/luma.ts, typescript2/app-product-metrics/src/jobs/fetch-luma-eap.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/clients/luma.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8767b85e14fac4e6e2042296e25a8d4720bd646f1cdce01730313e86b5cc5cf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expected.length !== given.length || !timingSafeEqual(expected, given)\u0060 appears character-identically in 2 files \u2014 typescript2/app-beps/src/lib/bcs-auth.ts, typescript2/app-beps/src/lib/beps-user.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/bcs-auth.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"db18ef6757e152a5b9a13f54e16e91df7acd1c2a10101c70c608ed9206e298f6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060extensionMap[lang as keyof typeof extensionMap] || []\u0060 appears character-identically in 2 files \u2014 typescript/packages/playground-common/src/shared/baml-project-panel/codemirror-panel/code-mirror-viewer.tsx, typescript2/app-website/lib/mdx/baml-block/baml-project-panel/codemirror-panel/code-mirror-viewer.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/codemirror-panel/code-mirror-viewer.tsx"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"b027cd2e38ee0e42a8b777c98b0a28693f075fa31849ca7e31d2b00e21eb414e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060getReactionCount(\u0022heart\u0022) \u003E 0 \u0026\u0026 getReactionCount(\u0022heart\u0022)\u0060 appears character-identically in 2 files \u2014 typescript2/app-beps/src/components/comments/comment-feed-view.tsx, typescript2/app-beps/src/components/comments/comment-thread.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"552878a92b887110bb830f8e686a428a8c2b74dda9fb3a7b97d22b0315910d52"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060getReactionCount(\u0022thumbsDown\u0022) \u003E 0 \u0026\u0026 getReactionCount(\u0022thumbsDown\u0022)\u0060 appears character-identically in 2 files \u2014 typescript2/app-beps/src/components/comments/comment-feed-view.tsx, typescript2/app-beps/src/components/comments/comment-thread.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3cd2ab2cf64760e9078f9ef548eb8bae075c96db25f59a89ab4e90bc31543c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060getReactionCount(\u0022thumbsUp\u0022) \u003E 0 \u0026\u0026 getReactionCount(\u0022thumbsUp\u0022)\u0060 appears character-identically in 2 files \u2014 typescript2/app-beps/src/components/comments/comment-feed-view.tsx, typescript2/app-beps/src/components/comments/comment-thread.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"9048203bac3ffade1bb8f573758ead47a720b3f11b43e360dc2ded71a18beb65"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasReacted(\u0022thumbsDown\u0022) \u0026\u0026 \u0022text-blue-500\u0022\u0060 appears character-identically in 2 files \u2014 typescript2/app-beps/src/components/comments/comment-feed-view.tsx, typescript2/app-beps/src/components/comments/comment-thread.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"7831d6f5c2a92c21cbe8a641d4a9e932869bc2acde26af05fdcba4bef0a77605"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasReacted(\u0022thumbsUp\u0022) \u0026\u0026 \u0022text-blue-500\u0022\u0060 appears character-identically in 2 files \u2014 typescript2/app-beps/src/components/comments/comment-feed-view.tsx, typescript2/app-beps/src/components/comments/comment-thread.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30a2d8c652f1c62e71f0c0ed9e673612604efb9d96e5e7812f426564545db6a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060input !== null \u0026\u0026 typeof input === \u0027object\u0027\u0060 appears character-identically in 2 files \u2014 typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts, typescript2/app-website/playground/baml-worker.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/baml-lsp-worker.ts"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4fca70030901b87d0fe915293bf0527e5e4c3eab8e5a6f31cdd62c359969827"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060magnitude.length === 0 || !/^[0-9a-fA-F]\u002B$/.test(magnitude)\u0060 appears character-identically in 2 files \u2014 baml_language/sdks/typescript/bridge_typescript/typescript_src/proto.ts, typescript2/pkg-proto/src/decode.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/typescript/bridge_typescript/typescript_src/proto.ts"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6ab83f97ee88eb4e3bfdd398f485d74d0114abb8e0686b073b38d0a0d471d8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060menu \u0026\u0026 !event.composedPath().includes(menu)\u0060 appears character-identically in 2 files \u2014 typescript2/app-developer-docs/components/docs-page-actions.tsx, typescript2/app-developer-docs/components/generated-version-switcher.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/components/docs-page-actions.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e9383ee51d97e0b7ad0bab7dc111849e83eb11a7facf1fa39ce992048a40c1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.callee.type === \u0022Super\u0022 || node.callee.type === \u0022V8IntrinsicExpression\u0022\u0060 appears character-identically in 3 files \u2014 typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-module-mocking.ts, typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-reflect-apply.ts, typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-reflect-get.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-module-mocking.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72bffcd2e6ff01b51dfcc59b704d7750de5217730121628464c8f8b4f0e7b5b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.calleeNames \u0026\u0026 node.calleeNames.length \u003E 0\u0060 appears character-identically in 2 files \u2014 typescript2/pkg-playground/src/ExecutionPanel.tsx, typescript2/pkg-playground/src/default-function-selection.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ExecutionPanel.tsx"},"region":{"startLine":2342}}}],"partialFingerprints":{"codehealthFindingId/v1":"e125b036e3ab699e4cc3462b3dfb8da999a09a6ebb3765fe13a03083c653236e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060orientation === \u0027horizontal\u0027 \u0026\u0026 \u0027h-2.5 flex-col border-t border-t-transparent\u0027\u0060 appears character-identically in 2 files \u2014 typescript/packages/ui/src/components/scroll-area.tsx, typescript2/app-website/components/ui/scroll-area.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/scroll-area.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7185048605b9a85b7043aaffee5415e697cc976443a04e850c9d2ee35ee7974"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060orientation === \u0027vertical\u0027 \u0026\u0026 \u0027h-full w-2.5 border-l border-l-transparent\u0027\u0060 appears character-identically in 2 files \u2014 typescript/packages/ui/src/components/scroll-area.tsx, typescript2/app-website/components/ui/scroll-area.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/ui/src/components/scroll-area.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"30cfefb65b2f473967d53473ba93692bd731b121dfc06f577cb00c30bef08c5e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060overlaps(realRepo, realOut) || overlaps(realOut, realRepo)\u0060 appears character-identically in 3 files \u2014 typescript2/pkg-grammar-hljs/scripts/assemble-mirror.mjs, typescript2/pkg-grammar-treesitter/scripts/assemble-mirror.mjs, typescript2/pkg-grammar/scripts/assemble-mirror.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar-hljs/scripts/assemble-mirror.mjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d9d5d10ed306d181d60d0a6beee492ab00a1bb89523a6826414418fcf2a64c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060page.page_kind === \u0027package\u0027 || page.page_kind === \u0027namespace\u0027\u0060 appears character-identically in 2 files \u2014 typescript2/app-developer-docs/components/generated-reference.tsx, typescript2/app-developer-docs/lib/generated-content/document-projector.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/components/generated-reference.tsx"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0177a0b8ccc680613cc43d6b2103c8550e1f394b709b0cfefd24c9ebd1e6db"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060page.parentSlug \u0026\u0026 page.parentSlug !== page.slug \u0026\u0026 bySlug.has(page.parentSlug)\u0060 appears character-identically in 2 files \u2014 typescript2/app-beps/src/lib/export-all-utils.ts, typescript2/app-beps/src/lib/export-utils.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/export-all-utils.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6fb7a22be230ca721e6b970ff3826990481f5bddcf948cc57ba17d5337f58f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsedArguments.flags.has(\u0027production\u0027) \u0026\u0026 databaseContext !== \u0027production\u0027\u0060 appears character-identically in 4 files \u2014 typescript2/app-developer-docs/scripts/backfill-document-store.ts, typescript2/app-developer-docs/scripts/migrate-generated-content.ts, typescript2/app-developer-docs/scripts/populate-generated-content.ts, typescript2/app-developer-docs/scripts/promote-document-alias.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/scripts/backfill-document-store.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a537cba04f9a1929f683865cdcb950b8008bf4d4f6908cca8d722b5ae60b74"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060position === \u0022popper\u0022 \u0026\u0026 \u0022data-[side=bottom]:translate-y-1 data-[side=left]:-translate-x-1 data-[side=right]:translate-x-1 data-[side=top]:-\u2026\u0060 appears character-identically in 2 files \u2014 typescript2/app-beps/src/components/ui/select.tsx, typescript2/app-feedback/src/components/ui/select.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/select.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98c91520a70382df238628799b4689f79cede04bf24222faf7dc8275fa61e1b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060position === \u0022popper\u0022 \u0026\u0026 \u0022h-[var(--radix-select-trigger-height)] w-full min-w-[var(--radix-select-trigger-width)]\u0022\u0060 appears character-identically in 2 files \u2014 typescript2/app-beps/src/components/ui/select.tsx, typescript2/app-feedback/src/components/ui/select.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/select.tsx"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f891422e0710e0693fa3da6c734fc4ae046243b46c9e7d7a53276861e4ca3022"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060replyEditorRef.current?.getMarkdown() || replyContent\u0060 appears character-identically in 2 files \u2014 typescript2/app-beps/src/components/comments/comment-feed-view.tsx, typescript2/app-beps/src/components/comments/comment-thread.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"facab9b24dbfe0b1d7e3e425a8443cbf26827ce5b034e45e96a47b1f28d7e624"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060resolved.type === \u0022TSUnionType\u0022 \u0026\u0026 resolved.types.some(matches)\u0060 appears character-identically in 2 files \u2014 typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-object-parameters.ts, typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-unknown-type-aliases.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-object-parameters.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f958df5a9492159e5fedde921b6e6f042d41bdf1adc63f39c0f8a693e303a07"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.columns.length !== 1 || result.columns[0] !== \u0027distinct_users\u0027 || result.results.length !== 1\u0060 appears character-identically in 2 files \u2014 typescript2/app-product-metrics/scripts/backfill-six-weeks.ts, typescript2/app-product-metrics/src/jobs/aggregate-weekly-metric.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/scripts/backfill-six-weeks.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"129748d1cb397fcd0c4182f07c22768a4e8926a1993cdc4fda610b7e09bffbea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.description !== undefined \u0026\u0026 typeof result.description !== \u0027string\u0027\u0060 appears character-identically in 2 files \u2014 engine/generators/data/mixed_complex_types/typescript/index.ts, engine/generators/data/optional_nullable/typescript/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/mixed_complex_types/typescript/index.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa8b0f4937c51617f17c883bc2b5367b1e266ee5f9eb21b42783343cbb37612"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060selection.mode === \u0027function\u0027 || selection.mode === \u0027workflow\u0027\u0060 appears character-identically in 2 files \u2014 typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/preview-toolbar.tsx, typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/side-bar/index.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/preview-toolbar.tsx"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef30c4627e65e9a097972a57dbd095744ab475f0ba5cae2d85431c4fa5f2c3b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060start.date.getUTCDay() !== 1 || end.date.getUTCDay() !== 1\u0060 appears character-identically in 2 files \u2014 typescript2/app-product-metrics/src/external-data.ts, typescript2/app-product-metrics/src/jobs/aggregate-weekly-metric.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/external-data.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"97844b1f1795e077557a2b583cacbc59dd32ab055348b10027f4052438a9e9b1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060t.functionName === params.functionName \u0026\u0026 t.testName === params.testName\u0060 appears character-identically in 2 files \u2014 typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/atoms.ts, typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/atoms.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/atoms.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"554de50e3f6d756a29329f3d44fc4c2e26f36961d7e2e10de05b0eb02d63a226"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060textLines.length \u003E 0 \u0026\u0026 !textLines[0].trim()\u0060 appears character-identically in 2 files \u2014 typescript2/app-beps/src/components/comments/comment-feed-view.tsx, typescript2/app-beps/src/components/comments/comment-sidebar.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed56c202019b3cb3620a89d7b7c512db92616483b5fbf5d2439cb7fcdc66ad4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060textLines.length \u003E 0 \u0026\u0026 !textLines[textLines.length - 1].trim()\u0060 appears character-identically in 2 files \u2014 typescript2/app-beps/src/components/comments/comment-feed-view.tsx, typescript2/app-beps/src/components/comments/comment-sidebar.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/comments/comment-feed-view.tsx"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"556d0e8689dfe1aa94fad8acf2362546d8add669d1521969857e6c58b0e06a67"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.files.has(path) || this.dirs.has(path)\u0060 appears character-identically in 2 files \u2014 typescript2/app-promptfiddle/src/playground/vfs.ts, typescript2/app-website/playground/vfs.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/vfs.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae716fc91def7112b0dcc61a7b2c36af5bb0641b2a6f3e13f8d06b093b862301"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.suppressCallbacks || !this.onChange\u0060 appears character-identically in 2 files \u2014 typescript2/app-promptfiddle/src/playground/vfs.ts, typescript2/app-website/playground/vfs.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-promptfiddle/src/playground/vfs.ts"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"39620e74db5f439e5f5be5167cf62ef343c4638c8b095c14aabab0cd77979a36"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof child === \u0027object\u0027 \u0026\u0026 child !== null \u0026\u0026 typeof child.id === \u0027number\u0027 \u0026\u0026 typeof child.name === \u0027string\u0027 \u0026\u0026 Array.isArray(child.childre\u2026\u0060 appears character-identically in 2 files \u2014 engine/generators/data/edge_cases/typescript/index.ts, engine/generators/data/nested_structures/typescript/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/edge_cases/typescript/index.ts"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"9335e480f04b8e9843ab148cce5ec252b96e5c0e9271ac2fed562b162288ff2c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof claims.githubId !== \u0022string\u0022 || typeof claims.login !== \u0022string\u0022\u0060 appears character-identically in 2 files \u2014 typescript2/app-beps/src/lib/bcs-auth.ts, typescript2/app-beps/src/lib/beps-user.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/lib/bcs-auth.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"68dfdb4cef11d2edc2a44a00219cc4c5e21e0a04277834fa3c817e518424afc1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof item === \u0027number\u0027 \u0026\u0026 Number.isInteger(item)\u0060 appears character-identically in 2 files \u2014 engine/generators/data/array_types/typescript/index.ts, engine/generators/data/map_types/typescript/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/array_types/typescript/index.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"750e5a2e4dc08fefc1ce175e2cd92fa3936095e3c9fa8ade22be48e19290524e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof item === \u0027string\u0027 || item === null\u0060 appears character-identically in 2 files \u2014 engine/generators/data/array_types/typescript/index.ts, engine/generators/data/union_types_extended/typescript/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/array_types/typescript/index.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"18328e4683e200640ed4a3eeb3457bcdf0929351fe99c0ea8da3c05f1ed2f32c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof result !== \u0027object\u0027 || result === null\u0060 appears character-identically in 3 files \u2014 engine/generators/data/edge_cases/typescript/index.ts, engine/generators/data/mixed_complex_types/typescript/index.ts, engine/generators/data/nested_structures/typescript/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/edge_cases/typescript/index.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea05746d0524950e44f4dce1813ad6c983eb34a265c5e890b717d9cedd1fd9da"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof result.id !== \u0027number\u0027 || !Number.isInteger(result.id)\u0060 appears character-identically in 3 files \u2014 engine/generators/data/literal_types/typescript/index.ts, engine/generators/data/mixed_complex_types/typescript/index.ts, engine/generators/data/optional_nullable/typescript/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/literal_types/typescript/index.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c437891585be2807a76cb4451fcec91d0e92ebddaf2e6be94e0340ea83c2c2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof result.id !== \u0027number\u0027 || typeof result.name !== \u0027string\u0027\u0060 appears character-identically in 2 files \u2014 engine/generators/data/edge_cases/typescript/index.ts, engine/generators/data/nested_structures/typescript/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/edge_cases/typescript/index.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fcf260b864c216333f7591982757d44f8449a89fa08e4c806f78cae0e3ebc61"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof result.metadata !== \u0027object\u0027 || result.metadata === null\u0060 appears character-identically in 2 files \u2014 engine/generators/data/mixed_complex_types/typescript/index.ts, engine/generators/data/nested_structures/typescript/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/mixed_complex_types/typescript/index.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a847c9c2179cbff87741916520367ee39faf0f7d4809d7bfb49ee73f83fe167"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof result.metadata.attributes !== \u0027object\u0027 || result.metadata.attributes === null\u0060 appears character-identically in 2 files \u2014 engine/generators/data/mixed_complex_types/typescript/index.ts, engine/generators/data/nested_structures/typescript/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/mixed_complex_types/typescript/index.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7613f0f88a2aa9f302fcd800cf0413093099ecb3ad727a1df07ca23a51ea7f2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof result.response !== \u0027object\u0027 || result.response === null\u0060 appears character-identically in 2 files \u2014 engine/generators/data/mixed_complex_types/typescript/index.ts, engine/generators/data/union_types_extended/typescript/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/mixed_complex_types/typescript/index.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fb0deaa4a906627cc44da3b9198930daeb8ac4116d93d8a75994f4d8c31c15"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof result.user !== \u0027object\u0027 || result.user === null\u0060 appears character-identically in 2 files \u2014 engine/generators/data/mixed_complex_types/typescript/index.ts, engine/generators/data/nested_structures/typescript/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/mixed_complex_types/typescript/index.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6dd0e19fe4d7f1ba4b7472d3413cb0d433907c8551ac2b021db725b1f92ce43"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof result.user.profile !== \u0027object\u0027 || result.user.profile === null\u0060 appears character-identically in 2 files \u2014 engine/generators/data/mixed_complex_types/typescript/index.ts, engine/generators/data/nested_structures/typescript/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/mixed_complex_types/typescript/index.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6574143ec7336f2d43826d8cd78b326c6c752334cb6241d66363ad77e7a7510c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof result.user.settings !== \u0027object\u0027 || result.user.settings === null\u0060 appears character-identically in 2 files \u2014 engine/generators/data/mixed_complex_types/typescript/index.ts, engine/generators/data/nested_structures/typescript/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/mixed_complex_types/typescript/index.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"6658645554167f107b7990fd31140207642a7ec95b0665799b8d353174f11eb3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof v === \u0027number\u0027 \u0026\u0026 Number.isInteger(v)\u0060 appears character-identically in 2 files \u2014 engine/generators/data/map_types/typescript/index.ts, engine/generators/data/primitive_types/typescript/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/map_types/typescript/index.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d91038539a8e3b1fbc1e53ef216e103e8e230e0e14a929e9a36ffa70c7f863"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027string\u0027 || !/^\\d{4}-\\d{2}-\\d{2}$/.test(value)\u0060 appears character-identically in 2 files \u2014 typescript2/app-product-metrics/src/external-data.ts, typescript2/app-product-metrics/src/jobs/aggregate-weekly-metric.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-product-metrics/src/external-data.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb4977da3cdf17e8b898fc7e980871a54f50e8bdd1f75dfb563182773d184e2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022object\u0022 \u0026\u0026 value !== null \u0026\u0026 \u0022type\u0022 in value \u0026\u0026 typeof value.type === \u0022string\u0022\u0060 appears character-identically in 2 files \u2014 typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/lexical-type-parameters.ts, typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/type-alias-resolution.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/lexical-type-parameters.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6694740e2e93ce0963356faefa4fbba5e58b5bfe07ed0e9a9305992793b514d0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027number\u0027 \u0026\u0026 Number.isInteger(value)\u0060 appears character-identically in 2 files \u2014 engine/generators/data/map_types/typescript/index.ts, typescript2/pkg-playground/src/args-form-model.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/map_types/typescript/index.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"95aec10a0db7b1b91669e67fa0723402533ae8ae2a60c591eb6e3a9ba91ec248"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027number\u0027 || typeof value === \u0027bigint\u0027\u0060 appears character-identically in 2 files \u2014 typescript2/pkg-playground/src/ArgsForm.tsx, typescript2/pkg-playground/src/args-form-model.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/ArgsForm.tsx"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c9e2178181515ea2b8957ca401e6a2873ac762cdd2b821bcf349f333f648c3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027object\u0027 \u0026\u0026 value !== null \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 2 files \u2014 typescript2/app-type-quiz/src/saves.ts, typescript2/pkg-playground/src/args-form-model.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-type-quiz/src/saves.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4668f909ba3a68fad6302107910433856cad1a646df2c63b9a56aad91aa875"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof x === \u0027number\u0027 \u0026\u0026 Number.isInteger(x)\u0060 appears character-identically in 2 files \u2014 engine/generators/data/edge_cases/typescript/index.ts, engine/generators/data/primitive_types/typescript/index.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/edge_cases/typescript/index.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b15c1f2492f1804e07257c434371d51bff20bb00c917a0b66df161506ebc492"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060unwrapped.type === \u0022TSStringKeyword\u0022 || unwrapped.type === \u0022TSNumberKeyword\u0022 || unwrapped.type === \u0022TSSymbolKeyword\u0022\u0060 appears character-identically in 2 files \u2014 typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-widen-then-assert.ts, typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/dictionary-types.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-widen-then-assert.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1587cfc1c43157d746f34f6c478fab798730b182959c32f4c071983ba934ad55"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060user.role === \u0022bdfl\u0022 || user.role === \u0022admin\u0022\u0060 appears character-identically in 2 files \u2014 typescript2/app-beps/src/app/profile/page.tsx, typescript2/app-beps/src/app/users/page.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/app/profile/page.tsx"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b56cedad62fa6c2ee27ac801b81907c98eb968b66ccf6497be4d18ca1c1f29a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value == null || typeof value !== \u0027object\u0027\u0060 appears character-identically in 7 files \u2014 typescript2/pkg-playground/src/CapturedValueCard.tsx, typescript2/pkg-playground/src/ValueRenderer.tsx, typescript2/pkg-playground/src/renderers/HttpRequestCurl.tsx, typescript2/pkg-playground/src/renderers/PromptAst.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/CapturedValueCard.tsx"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c8f093ed041da45eed1767275c7f5f6c94c80c1c65ec51d743cf7fc29d472a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === \u0022light\u0022 || value === \u0022dark\u0022 || value === \u0022system\u0022\u0060 appears character-identically in 2 files \u2014 typescript2/app-beps/src/components/ui/theme-toggle.tsx, typescript2/app-feedback/src/components/ui/theme-toggle.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/theme-toggle.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eeb565859b3b4fa3c7841da335d191a2a507b720c3bfd01537fb358bc623356"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060values.version \u0026\u0026 !/^\\d\u002B\\.\\d\u002B\\.\\d\u002B$/.test(values.version)\u0060 appears character-identically in 2 files \u2014 typescript2/pkg-grammar-hljs/scripts/assemble-mirror.mjs, typescript2/pkg-grammar/scripts/assemble-mirror.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar-hljs/scripts/assemble-mirror.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f057b72d5b15feba101120d1bc4e055d69d03ff12926f4f7f6dd556f0132451b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060variable === null || variable.defs.length === 0\u0060 appears character-identically in 2 files \u2014 typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-module-mocking.ts, typescript2/app-developer-docs/tools/oxlint/anti-slop/shared/reflect-method.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-module-mocking.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"7242c80d013f7ebb7fdf7561b0dceddd9cf1f4b63e0a7e904371dae7aa0c078e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060variable === null || visitedVariables.has(variable)\u0060 appears character-identically in 2 files \u2014 typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-known-value-widening.ts, typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-widen-then-assert.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/tools/oxlint/anti-slop/rules/no-known-value-widening.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f626d779c9b5968e259831da344d3569180a9280b6325872929e9357216e887"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060metadata is null || metadata.Length == 0\u0060 appears character-identically in 2 files \u2014 baml_language/sdks/csharp/bridge_csharp/src/Proto/PrimitiveProtocol.cs, baml_language/sdks/csharp/bridge_csharp/src/Values/BamlValue.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Proto/PrimitiveProtocol.cs"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"549dc53c4486bd7d267d6528b9d1692999a40c744bf25c4855f606b23d465371"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060field.serialization_alias or field.alias or name\u0060 appears character-identically in 3 files \u2014 baml_language/sdks/python/src/baml_bridge/_instrumentation.py, baml_language/sdks/python/src/baml_bridge/_invocation.py, baml_language/sdks/python/src/baml_bridge/proto.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/src/baml_bridge/_instrumentation.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d84a3e495fb161a2c2eed0ed862ebddb1e824c98b07265a2142ccf58baf9a7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasattr(result, \u0027description\u0027) and result.description is not None\u0060 appears character-identically in 2 files \u2014 engine/generators/data/mixed_complex_types/python/main.py, engine/generators/data/optional_nullable/python/main.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/mixed_complex_types/python/main.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b877b70485b0e8d671c3c295aaead48b9135c0d653d39558c5569105ff5fab86"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(k, str) and isinstance(v, (int, float))\u0060 appears character-identically in 2 files \u2014 engine/generators/data/map_types/python/main.py, engine/generators/data/mixed_complex_types/python/main.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/map_types/python/main.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a88e1f7f14d2bd90fa254119ef8005c6a1659cb70253628fff70e90790380c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(k, str) and isinstance(v, str)\u0060 appears character-identically in 3 files \u2014 engine/generators/data/map_types/python/main.py, engine/generators/data/mixed_complex_types/python/main.py, engine/generators/data/optional_nullable/python/main.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/data/map_types/python/main.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3b665bd6059f77e2a16618b5ffadeaccc459c842f978298e567c7fd14d0c4d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060musl_bin.exists() and os.access(musl_bin, os.X_OK)\u0060 appears character-identically in 2 files \u2014 baml_language/forks/aws-config-systest/run-e2e.py, baml_language/forks/google-cloud-auth-systest/run-e2e.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/forks/aws-config-systest/run-e2e.py"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"58eadecc99a6b9c5de630f2a1fb6776f40deadebf073ee559f0d7509e87d0281"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not binary.is_file() or not os.access(binary, os.X_OK)\u0060 appears character-identically in 2 files \u2014 baml_language/tools/btel_query_smoke.py, baml_language/tools/btel_record_smoke.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/tools/btel_query_smoke.py"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"6007e8dd8122cbefd1ced8a6ff9d2555a342f3f05ea454f157bfe69bf559c09c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!args.is_empty() || !associated_bindings.is_empty()\u0060 appears character-identically in 2 files \u2014 baml_language/crates/baml_compiler2_mir/src/lower.rs, baml_language/crates/baml_type/src/lib.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_mir/src/lower.rs"},"region":{"startLine":13505}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28c222177667c3f21db57db0998cd1e3fdbb8fe27b02f7692788f5ea0b84a5b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!generic_args.is_empty() || !associated_type_bindings.is_empty()\u0060 appears character-identically in 3 files \u2014 baml_language/crates/baml_compiler2_ast/src/ast.rs, baml_language/crates/baml_compiler2_hir/src/body_type_refs.rs, baml_language/crates/baml_compiler2_hir/src/type_ref.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_ast/src/ast.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d5e86a41bb516b6f8e0e0ead288cece5e6511ccd2a1b0330aca0c14bdcbdf2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!properties.contains_key(\u0022max_completion_tokens\u0022) \u0026\u0026 !properties.contains_key(\u0022max_tokens\u0022)\u0060 appears character-identically in 2 files \u2014 engine/baml-lib/llm-client/src/clients/openai.rs, engine/baml-runtime/src/internal/llm_client/primitive/openai/properties/azure.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/llm-client/src/clients/openai.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8a1c338b0302b97644541c3d4c600cbd3cef977eaf22ead25c506a9b565829"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(sp == clause[0].1) || (sq == clause[1].1) || (sr == clause[2].1)\u0060 appears character-identically in 2 files \u2014 baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs, baml_language/crates/baml_type/src/unify.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":1962}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bce03cec56310b0bba712fac347bdf4cf1a571e7f3c43f90f392d549a2c789e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060anything_but_whitespace || !next_next_c.is_whitespace()\u0060 appears character-identically in 2 files \u2014 baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs, engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67918420e738086895e992bddbebf1dd6b858d2f4a63a2504b14476b62a3e1c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060captured_inputs.is_some() || captured_type_args.is_some()\u0060 appears character-identically in 2 files \u2014 baml_language/crates/bex_vm/src/telemetry.rs, baml_language/crates/bex_vm/src/telemetry/manual.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/telemetry.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba5cd9bb67b59420b460a2b9b8948d633f125a180f1995caee3c70bb928ccee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ch == \u0027_\u0027 || ch.is_alphanumeric() \u0026\u0026 (index \u003E 0 || ch.is_alphabetic())\u0060 appears character-identically in 2 files \u2014 baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/names.rs, baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/routing.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/names.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"65099663827c9da5f993ab0fcdb5b8e93f22a98618d78d9ebde2b2e67def7009"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060contains_bound_typevar(k, generic_params) || contains_bound_typevar(v, generic_params)\u0060 appears character-identically in 2 files \u2014 baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs, baml_language/crates/baml_type/src/unify.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e6f90ea2c580f6694f0e6a73ffb74505bb87544e2a1686fce85c5401816944"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060current_value.trim().eq_ignore_ascii_case(\u0022true\u0022) || current_value.trim().eq_ignore_ascii_case(\u0022false\u0022)\u0060 appears character-identically in 2 files \u2014 baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs, engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"902d274b3a587c857015bdaafac3881a9ef191f9f659397d76060e188149853f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060descriptor.is_ascii() \u0026\u0026 !descriptor.contains([\u0027\u0022\u0027, \u0027\\\\\u0027, \u0027\\n\u0027])\u0060 appears character-identically in 2 files \u2014 baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/emit/typemap_file.rs, baml_language/sdks/typescript/sdkgen_typescript_shared/src/emit/typemap_file.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/python/rust/sdkgen_python_pydantic2/src/emit/typemap_file.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"328d3a71cfb89142956b2bbfd67ef8cbe6e73da0e5593889f106802b3fb6d71b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060filter.project_generation \u0026\u0026 run.request.project_generation != project_generation\u0060 appears character-identically in 2 files \u2014 baml_language/crates/bex_events/src/history/mod.rs, baml_language/crates/bex_events/src/run.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_events/src/history/mod.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efaf6c97655c16686b0c1116f509a7632c03337e2d018f8bbbf71480a5afcd2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003E 0 \u0026\u0026 !rows[i][0].text.is_empty() \u0026\u0026 rows[i - 1][0].text != rows[i][0].text\u0060 appears character-identically in 2 files \u2014 baml_language/crates/bex_vm/src/debug.rs, engine/baml-vm/src/debug.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/debug.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9b1f55b84226b45f1d223e874d83f0cd0f7d8fbbd42267119c4780beb017ec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_literal_subtype(member, candidate) || needs_conservative_membership(member, candidate)\u0060 appears character-identically in 2 files \u2014 baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs, baml_language/crates/baml_type/src/unify.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2d43431fb2a2797e602f66ff6965c198a9da4d29965df03f25f6b6dac3b264"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_numeric || is_bool || is_null || is_identifier\u0060 appears character-identically in 2 files \u2014 baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs, engine/baml-lib/jsonish/src/jsonish/parser/fixing_parser/json_parse_state.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/fixing_parser/json_parse_state.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d328cbbd45a59e539a04233e29e3ca1c49b3221b004213d28f35514521a7f9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lv.enm == rv.enm \u0026\u0026 lv.index == rv.index\u0060 appears character-identically in 2 files \u2014 baml_language/crates/bex_vm/src/package_baml/array.rs, baml_language/crates/bex_vm/src/vm.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/array.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c552480a3d36ce73b9c6f0188c8ccf407a6acedadae8f7b697b5e7fc0332f73"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060matches!(a, Ty::RustType) || matches!(b, Ty::RustType)\u0060 appears character-identically in 2 files \u2014 baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs, baml_language/crates/baml_type/src/unify.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"3376a45f4a20232b3ca250f771ccc4b8bb2ca34bda7730c89c254f85f2f0f303"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060matches!(scope.kind, ScopeKind::Class) \u0026\u0026 ancestor_id != scope_id\u0060 appears character-identically in 2 files \u2014 baml_language/crates/baml_compiler2_hir/src/resolve.rs, baml_language/crates/baml_compiler2_hir/src/semantic_index.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir/src/resolve.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed608e7cdd610f0d856cd079333f775a0559a6151af85dea1f8c1642bf394fe6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060matches!(x, Ty::Error) || matches!(y, Ty::Error)\u0060 appears character-identically in 2 files \u2014 baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs, baml_language/crates/baml_type/src/unify.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc73722f36281ec093cd715f7864bc2079b37b412053444e3be8851994f4a52d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060non_null.len() == 1 \u0026\u0026 non_null.len() \u003C variants.len()\u0060 appears character-identically in 2 files \u2014 baml_language/crates/baml_builtins2_codegen/src/extract.rs, baml_language/crates/sys_ops/src/output_format.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_builtins2_codegen/src/extract.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44b827d3b00e0e8f861291b6a282c404478c7d254e9ea9a2fcb254678ca8a1e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060occurs(param, k, in_union) || occurs(param, v, in_union)\u0060 appears character-identically in 2 files \u2014 baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs, baml_language/crates/baml_type/src/unify.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2644aa3623d4d0ffd2c4f45b1458d763549ce7a82878fd9db72b7bcd3a45cb1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060occurs_in(n, k, vars, bindings) || occurs_in(n, v, vars, bindings)\u0060 appears character-identically in 2 files \u2014 baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs, baml_language/crates/baml_type/src/unify.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/coherence.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6e8d2f621af683d3eff0f29598874e3bd4e99d3146ca7b36f8a3ba7305e980"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p.cur.at(TokenKind::RBrace) || p.cur.at_end()\u0060 appears character-identically in 2 files \u2014 baml_language/crates/baml_parser/src/items.rs, baml_language/crates/baml_parser/src/stmts.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_parser/src/items.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed31263a2afa915777792ed6a199fbe37338558a40e1252dd1559e5811de361"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060package.kind \u0026\u0026 !language_packages.insert(language)\u0060 appears character-identically in 2 files \u2014 baml_language/crates/baml_linker/src/lib.rs, baml_language/crates/bex_vm_types/src/types.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_linker/src/lib.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff001d1b906ded6d9cf362c32f180c0d43700af8181a612f7a38469c5b30930"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060param.index() == 0 \u0026\u0026 param.as_str() == \u0022Self\u0022\u0060 appears character-identically in 2 files \u2014 baml_language/crates/baml_compiler2_hir_ty/src/callable.rs, baml_language/crates/baml_compiler2_hir_ty/src/method_resolution.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/callable.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10d3fc00c0756202074ddeca4c340bb94ee0207ce070c25bcb0d7ad4b194066"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parts[0] != \u0022baml_client\u0022 \u0026\u0026 parts[0] != \u0022baml\u0022\u0060 appears character-identically in 3 files \u2014 engine/generators/languages/go/src/package.rs, engine/generators/languages/rust/src/package.rs, engine/generators/languages/typescript/src/package.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/go/src/package.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07c48eb17bbd3bcd7db025a7ab12d3669b6a5c267755f6a1a6c0a3fbd56a653"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060range.contains(offset) || range.end() == offset\u0060 appears character-identically in 2 files \u2014 baml_language/crates/baml_ide/src/cursor_context.rs, baml_language/crates/baml_ide/src/info.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_ide/src/cursor_context.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2f49a77123d7a7cd86f6f204aa25f29eab4f4617f590e091a99b38fcfbe142"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060registry.generation == lease.generation \u0026\u0026 registry.collection_epoch == lease.collection_epoch\u0060 appears character-identically in 2 files \u2014 baml_language/crates/baml_lsp_server/src/engine.rs, baml_language/crates/bridge_wasm/src/playground.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_lsp_server/src/engine.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e1f56c15d2768778601c2b92607d77cd3a4b51a38cc3f654d2ed4577ba0a11"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060render_settings.stream \u0026\u0026 self.supports_streaming()\u0060 appears character-identically in 2 files \u2014 engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs, engine/baml-runtime/src/internal/llm_client/traits/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-runtime/src/internal/llm_client/primitive/aws/aws_client.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fcc2e39c3ff452b3e756e26a060c79de138786eeba04203781714b39a6d48b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060request.is_null() || length \u003E isize::MAX as usize\u0060 appears character-identically in 3 files \u2014 baml_language/sdks/java/bridge_java/src/lib.rs, baml_language/sdks/python/rust/bridge_python/src/host_value.rs, baml_language/sdks/typescript/bridge_typescript/src/host_value.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/bridge_java/src/lib.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62c894353e2ad3492bcc2d4ab3320892562069e493d1d61dc067155a2843292"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060resolved.has_error() || resolved.has_infer()\u0060 appears character-identically in 3 files \u2014 baml_language/crates/baml_compiler2_hir_ty/src/infer.rs, baml_language/crates/baml_compiler2_hir_ty/src/infer/flow.rs, baml_language/crates/baml_compiler2_hir_ty/src/infer/truthy.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/infer.rs"},"region":{"startLine":11867}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3518025895b4b737b55a70845b5619230c0bad62e4b01b5ab25a18feb67bdc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.ends_with(\u0027\\n\u0027) \u0026\u0026 !s.ends_with(\u0027\\n\u0027)\u0060 appears character-identically in 2 files \u2014 baml_language/crates/bex_sap/src/jsonish/parser/dedent.rs, engine/bstd/src/dedent.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/dedent.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5e79c9d1bc03a169311cad0b2710fbcebeef7ebdb78fc645f57c37e38a1002"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.drop_type.is_some() \u0026\u0026 self.drop_type.unwrap() == type_alias\u0060 appears character-identically in 2 files \u2014 engine/generators/languages/go/src/ir_to_go/type_aliases.rs, engine/generators/languages/rust/src/ir_to_rust/type_aliases.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/generators/languages/go/src/ir_to_go/type_aliases.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1f630e169b01845ff69c00a05924c87cfe8849ee36ac8209334cfa09b59825"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.telemetry.is_some() \u0026\u0026 !self.hooks_suppressed()\u0060 appears character-identically in 2 files \u2014 baml_language/crates/bex_vm/src/vm.rs, baml_language/crates/bex_vm/src/vm/compiled_rt/trace.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/vm.rs"},"region":{"startLine":10111}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1194bca8c8bbc78be29802f131d3dd8e9d34706a4a88ce58ec9af39323481e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target.contains(\u0027/\u0027) || target.contains(\u0027\\\\\u0027) || target.ends_with(\u0022.baml\u0022)\u0060 appears character-identically in 2 files \u2014 baml_language/crates/baml_cli/src/pack_command.rs, baml_language/crates/baml_cli/src/run_command.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/pack_command.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b1945e836d53ca13d083b7130353b230fc338e2d75864df979dcf01489c47d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tokio::runtime::Handle::try_current().is_ok() \u0026\u0026 !crate::host_value::in_blocking_dispatch()\u0060 appears character-identically in 2 files \u2014 baml_language/sdks/rust/bridge_rust/src/dynamic.rs, baml_language/sdks/rust/bridge_rust/src/runtime.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/rust/bridge_rust/src/dynamic.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa44eb74ae1c436ffd605500d65db66650148ca14e5bedc0606b84eb03e8103"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060whitespace_idx \u003C line.len() \u0026\u0026 whitespace_idx \u003C prefix.len()\u0060 appears character-identically in 2 files \u2014 baml_language/crates/bex_sap/src/jsonish/parser/dedent.rs, engine/bstd/src/dedent.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_sap/src/jsonish/parser/dedent.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dc8d3005755c9705bb215298f2261d64f828907e506948420ff52c8db6f114"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060type is null || type.TyCase == BamlTy.TyOneofCase.None\u0060 appears character-identically in 3 files \u2014 baml_language/sdks/csharp/bridge_csharp/src/Proto/PrimitiveProtocol.cs, baml_language/sdks/csharp/bridge_csharp/src/Values/BamlType.cs, baml_language/sdks/csharp/bridge_csharp/src/Values/BamlValue.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Proto/PrimitiveProtocol.cs"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fbd72b613feaf98c837b2966516bda785fff31d606b12778946329c4c6777e"}},{"ruleId":"X5","level":"note","message":{"text":"Nullable reference types not enabled everywhere: 17/18 NRT-eligible project(s) enable \u003CNullable\u003Eenable\u003C/Nullable\u003E (projects targeting a pre-C#-8 framework are excluded \u2014 NRTs aren\u0027t available there). NRTs catch a whole class of null-deref bugs at compile time."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"80b24de9378624a0ce4846d60457395befcaec8e109ea81d289a370c9f7bfd5d"}},{"ruleId":"X5","level":"note","message":{"text":"Null-forgiving operator (\u0060!\u0060) suppressions override nullable warnings: ~48.6 \u0060!\u0060 suppressions per 1k syntax nodes \u2014 11528 suppression(s) across the 237289 syntax node(s) in code where nullable warnings are ENABLED, which is the only code a \u0060!\u0060 can suppress anything in (a \u0060!\u0060 under \u0060#nullable disable\u0060 is inert and is not counted, and its file\u0027s nodes are not in the denominator). Each one tells the compiler to trust you about null, suppressing the very safety NRTs provide. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4ae9a4afaefbfeb512a0b9a87d1bd44cd285ab1e804e4b89c8cf80f255687dfd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on unknown code: \u0060NamedHandleType\u0060 maps every unrecognised code to \u0060BamlHandleType.AdtTaggedHeapHandle\u0060, one of the real values, with no log or throw \u2014 a malformed or new code silently reads as a known one. Throw on the unknown code, or log it. If that member is the correct answer for any other code, say so in a comment on the member and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/csharp/bridge_csharp/src/Generated/V1/BamlGeneratedCodec.cs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e09cbc8b0c56175ed7b98dd1cb6bc88856879b31faa2d25cbb5439e1aaae77"}},{"ruleId":"X7","level":"note","message":{"text":"Pending state with no failure state: The view draws \u0060Running...\u0060 under \u0060isLoading\u0060, but \u0060isLoading\u0060 is settled by a load that can fail and the component draws no failure state, so a failed load is shown as \u0022not yet\u0022 for ever, or as the loaded state over its initial value. Give the component a failure state and draw it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/code-sandbox/SandboxPanel.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53c6c71985005f183184dec8bbc08575732c4d5c52750ba33407d02c904f4be"}},{"ruleId":"X7","level":"note","message":{"text":"Pending state with no failure state: The view draws \u0060Terminal output. Waiting for execution...\u0060 under \u0060output . length === 0\u0060, but \u0060output\u0060 is settled by a load that can fail and the component draws no failure state, so a failed load is shown as \u0022not yet\u0022 for ever, or as the loaded state over its initial value. Give the component a failure state and draw it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/code-sandbox/SandboxPanel.tsx"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"983dc624ad2adc603a2fa0161ab85b4afce6739720cb12e1cc1ac3e99efec505"}},{"ruleId":"X7","level":"note","message":{"text":"Pending state with no failure state: The view draws \u0060Exporting...\u0060 under \u0060isExporting\u0060, but \u0060isExporting\u0060 is settled by a load that can fail and the component draws no failure state, so a failed load is shown as \u0022not yet\u0022 for ever, or as the loaded state over its initial value. Give the component a failure state and draw it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/bep/bep-export-dialog.tsx"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"004f989c606db508daee978790e7bc39a089b959b09e9b0e7c807d15f0cb5454"}},{"ruleId":"X7","level":"note","message":{"text":"Pending state with no failure state: The view draws \u0060\u003Cdiv class=\u0022absolute top-4 right-4 z-50\u0022\u003E\u0060 under \u0060isLayoutLoading\u0060, but \u0060isLayoutLoading\u0060 is settled by a load that can fail and the component draws no failure state, so a failed load is shown as \u0022not yet\u0022 for ever, or as the loaded state over its initial value. Give the component a failure state and draw it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/graph-view.tsx"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ecf1da0e6da4661c0f7e619da55ce56fbf538ffa630069cbf3c171e659a404"}},{"ruleId":"X7","level":"note","message":{"text":"Pending state with no failure state: The view draws \u0060Loading tokenizer...\u0060 under \u0060showTokens \u0026\u0026 isLoading\u0060, but \u0060isLoading\u0060 is settled by a load that can fail and the component draws no failure state, so a failed load is shown as \u0022not yet\u0022 for ever, or as the loaded state over its initial value. Give the component a failure state and draw it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/shared/baml-project-panel/playground-panel/prompt-preview/render-text.tsx"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf0af89a037e51f817980c38d11ec1f873fa68797f518deb697d95decf268d9"}},{"ruleId":"X7","level":"note","message":{"text":"Pending state with no failure state: The view draws \u0060Loading BAML SDK... Initializing runtime\u0060 under \u0060! isInitialized\u0060, but \u0060isInitialized\u0060 is settled by a load that can fail and the component draws no failure state, so a failed load is shown as \u0022not yet\u0022 for ever, or as the loaded state over its initial value. Give the component a failure state and draw it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/sdk/provider.tsx"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b029aaebb626993a366c2d873648dc7fc84b8e15756adcb3e8b3756a7c3484"}},{"ruleId":"X7","level":"note","message":{"text":"Pending state with no failure state: The view draws \u0060\u003CLoader2 class=\u0022w-4 h-4 animate-spin\u0022/\u003E\u0060 under \u0060isSaving\u0060, but \u0060isSaving\u0060 is settled by a load that can fail and the component draws no failure state, so a failed load is shown as \u0022not yet\u0022 for ever, or as the loaded state over its initial value. Give the component a failure state and draw it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript/packages/playground-common/src/components/api-keys-dialog/save-actions-footer.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8bbf128710cf9ac07f84255378e9133993c760a1b0bc35fda3d731c9325d5f6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060genericUnionArmIndex\u0060 returns \u0060-1\u0060 when \u0060NumberFormatException\u0060 is thrown, with no log or throw \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the Javadoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/baml_bridge/src/main/java/baml_bridge/internal/ProtoWriter.java"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a6707ae0a2e49904331e8a0e398f2c2dc2fbe7696497fa241b1a298c1bb11e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060resolveVersion\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment in the catch or in the Javadoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/java/gradle-plugin/src/main/java/com/boundaryml/baml/gradle/BamlPlugin.java"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"681e49ab31c9a333db9685d89c2967fefcc972cac83d81d476a5d1dac7cba1ac"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_scripts\u0060 turns every \u0060Err\u0060 into \u0060HashMap::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_cli/src/run_command.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2f795aa295ab05e19abee530b0ef7855ae67f8e463da66b91350046f40535a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060llm_output_findings\u0060 turns every \u0060Err\u0060 into \u0060LlmOutputFindings::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/llm_output.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7943286a9f53a3af1d32ac843fcff0d9b6cce617917950f21b35dc4c80d4a7f8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060impls_for_receiver\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/method_resolution.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f46a6b32a4d2ae9710539fe91f1d99e94bf610cc32f6186902e32ec8d565ca"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060skipped\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":2154}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9276c9b8e6b620a3d351ce81d55b424e63c1b1e471efb05d64b83d6a0c8a74"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060fields\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":2259}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba9c39f320e8e4f499027712323582aabc492865f28ee4985c32ca0625d9bb6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060_to_markdown_records\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/csv.rs"},"region":{"startLine":2742}}}],"partialFingerprints":{"codehealthFindingId/v1":"de30c01aabe42d6a41d98b129766e0b732c157217b43b6e127c59a7c54f91eaf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060classes\u0060 turns every \u0060Err\u0060 into \u0060IndexMap::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/reflect.rs"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f30331a6d364f25c3874966bcfbd514855978adc0f02a6e09a987410184984"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060enums\u0060 turns every \u0060Err\u0060 into \u0060IndexMap::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/reflect.rs"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d35c0f4c27f4f074dd056c74cab0372c434e025cd86a71b32b91cc52463c8f0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060interfaces\u0060 turns every \u0060Err\u0060 into \u0060IndexMap::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/reflect.rs"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16cd897141924393880e46327fd9f811420681155c53ec92008d3a92df4681d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060functions\u0060 turns every \u0060Err\u0060 into \u0060IndexMap::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/reflect.rs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5e7b3b0adab417923cf60c6c149b71095fbe9e34394bf7e9e7e8036496c76c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060globals\u0060 turns every \u0060Err\u0060 into \u0060IndexMap::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/reflect.rs"},"region":{"startLine":1518}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a28ef3e2d4c85e781bc0a332fde0bcf6078406914b92cb9f70253e054aed299"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060diagnostics\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/reflect.rs"},"region":{"startLine":1584}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58a914f7d7509e40b9fed8c02ba87e81f8b652ffa759ead76410b218ec9c332"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060diagnostics\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_reflect/reflect.rs"},"region":{"startLine":1933}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7882230a0c52238f79b3a19deaf56d8a971f1625e2fdcd61a068b604e4d676"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060turn_usage\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/model_usage.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5c00955fd2a9d4b790d0dc8f7fffd78689af92f0d8a164bbbf8fc4a0e0ce21"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060impossible_members\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/json/decode.rs"},"region":{"startLine":1962}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3090b0e37b5a5f14c42f9aa62c4a64c7ac8ae68502198d4f73ef644712dc0dc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060used_keys\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bex_vm/src/package_baml/json/union.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c269b315029470fcc5c4d3fe5c3da744bf4761ddb2ff2b86347c32201ff5ccf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060entries\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/bridge_wasm/src/wasm_vfs.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"c067201c86908f49e256eceedcd9d3546f1e6626439c8b851bbf676b9fcfab5d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060unix_secs\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/forks/aws-sigv4/src/lib.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"caba0731a6877c6db9d248779234703a73b2a284deb377573664e15cba268152"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060describe\u0060 turns every \u0060Err\u0060 into \u0060\u0022value\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/sdks/typescript/bridge_typescript/src/encode.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"482f75097cfe5727a546a62918196ca09b851d1812ce5402ab947de7d7296a9a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060find_class_fields_needing_null_filler\u0060 turns every \u0060Err\u0060 into \u0060Ok(HashSet::new())\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/baml-lib/baml-core/src/ir/ir_helpers/mod.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"10285a7caab125b5bd2473f999ca4524cfe3faddbea172ce12edb76d0b5da198"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060list_functions\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/baml_project/mod.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd422cb80046c64c53a5e1574b52b9721e97bb8c32da5b56bd9e7dae8c866568"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060list_generators\u0060 turns every \u0060Err\u0060 into \u0060Ok(vec![])\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/language_server/src/baml_project/mod.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d671e69c3f2de04ceccaf5b54969d98360b6f79355041c4755c45a9f340c8d8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060undeclared_variables\u0060 turns every \u0060Err\u0060 into \u0060HashSet::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/vendored/minijinja/src/expression.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d8cafc1a8ee3ab36afbbc5d92935cce0d9e66abb9ce5c46157eaf9f681f043"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060undeclared_variables\u0060 turns every \u0060Err\u0060 into \u0060HashSet::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/vendored/minijinja/src/template.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d3005b1dab041f1a5d2b391c9d0b7558b9107c58b8e6d0ae14b8c8f7b224f1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060version\u0060 turns every \u0060Err\u0060 into \u0060\u0022unknown\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"languages/rust/baml/src/lib.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"51cd3ac6db4cc3600c5d9c6f9e3e5bae8cc465b264c44aad945be8353ec419bb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getStoredTheme\u0060 swallows every exception into \u0060return \u0022system\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-beps/src/components/ui/theme-toggle.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"533e21b77b916c4da18778872ce4f183d20f0042807fc40d9f2d841819581a85"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readOpenState\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-developer-docs/components/docs-sidebar.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ba9f2bbbabfd8f8612b3db9e90bd2b965aa59382935e7fb9aad8c5f9a31f67"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getStoredTheme\u0060 swallows every exception into \u0060return \u0022system\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-feedback/src/components/ui/theme-toggle.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1835effc8793a7287d232d8759a99c500cfe81f2c4b55b5162d5afd7e2b08ee"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060RenderPart\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/lib/mdx/baml-block/baml-project-panel/playground-panel/prompt-preview/render-part.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fadaa1fd47f3d275c8201d8ba0e9a2ce0cbdc75cc6a517256c81463713c9128"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060fetchPlaylistVideos\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/app-website/app/(home)/podcast/youtube-views.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c10410bef27cc538eaaa6fbde38cc2e584c5d44bb8e88a58b19d844b9d6e26"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readState\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-grammar/preview/main.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d73f58076232aaf7a8682754361f09105e3365982fc898f8d8eef02253f625f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readStoredEnvVars\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/session-store.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae779e8586e9b972325ebf69359959765eb5868014566c0c1a2b4276efbab81"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060storedDirection\u0060 swallows every exception into \u0060return \u0027vertical\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"typescript2/pkg-playground/src/graph/GraphView.tsx"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa9437432c712a8d4130ec6d8fc1e7645d88c5a96f791ffdaead68a20eb50f5"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060email.contains(\[e-mail redacted]\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060email.contains(\[e-mail redacted]\u0022)\u0060 also satisfies \u0060email.contains(\u0022example\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"languages/rust/baml/tests/type_builder.rs"},"region":{"startLine":1858}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6fa32683f1c0ec5b8f29f42a0b5a961a13c61b62dd4397533ca403dc7b2a83"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060strings.Contains(errorMsg, \u0022connection\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060strings.Contains(errorMsg, \u0022connection\u0022)\u0060 also satisfies \u0060strings.Contains(errorMsg, \u0022connect\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integ-tests/go/test_error_handling_test.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"696a192c6819b9607e13ec8917adbab544e0f40844980787b12d062708286017"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060s.contains(\u0022user.Pair\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060s.contains(\u0022user.Pair\u0022)\u0060 also satisfies \u0060s.contains(\u0022Pair\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"baml_language/crates/baml_compiler2_hir_ty/src/exhaustiveness.rs"},"region":{"startLine":2999}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f5fe621aecf95b60f234c03110232445e7317d050453651d3d399182e111be"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-117","guid":"1cfadbc2-a979-485e-b768-c70fc922201e","name":"Improper Output Neutralization for Logs","shortDescription":{"text":"Improper Output Neutralization for Logs"},"helpUri":"https://cwe.mitre.org/data/definitions/117.html"},{"id":"CWE-125","guid":"98717707-96bf-ca5b-9568-8d1d257574c1","name":"CWE-125","shortDescription":{"text":"CWE-125"},"helpUri":"https://cwe.mitre.org/data/definitions/125.html"},{"id":"CWE-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.html"},{"id":"CWE-1352","guid":"5257f322-5cfc-6b52-bedd-0b9a526b4c7d","name":"CWE-1352","shortDescription":{"text":"CWE-1352"},"helpUri":"https://cwe.mitre.org/data/definitions/1352.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-191","guid":"31b5d115-a84b-875f-a016-48689827db3c","name":"CWE-191","shortDescription":{"text":"CWE-191"},"helpUri":"https://cwe.mitre.org/data/definitions/191.html"},{"id":"CWE-200","guid":"b0ce3b1d-7a29-fe50-8aab-9aba899d2988","name":"Exposure of Sensitive Information to an Unauthorized Actor","shortDescription":{"text":"Exposure of Sensitive Information to an Unauthorized Actor"},"helpUri":"https://cwe.mitre.org/data/definitions/200.html"},{"id":"CWE-209","guid":"da28ecd2-f5c1-7852-ac41-a93b2d668c73","name":"Generation of Error Message Containing Sensitive Information","shortDescription":{"text":"Generation of Error Message Containing Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/209.html"},{"id":"CWE-242","guid":"5c147e5c-be37-b051-9928-764ef5a8f3d3","name":"CWE-242","shortDescription":{"text":"CWE-242"},"helpUri":"https://cwe.mitre.org/data/definitions/242.html"},{"id":"CWE-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"Uncaught Exception","shortDescription":{"text":"Uncaught Exception"},"helpUri":"https://cwe.mitre.org/data/definitions/248.html"},{"id":"CWE-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.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-312","guid":"96724ece-b0b2-a45c-83f9-0869fa3f6bea","name":"Cleartext Storage of Sensitive Information","shortDescription":{"text":"Cleartext Storage of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/312.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-345","guid":"d80d4b65-bbbe-b65d-958e-7ac466af18f9","name":"Insufficient Verification of Data Authenticity","shortDescription":{"text":"Insufficient Verification of Data Authenticity"},"helpUri":"https://cwe.mitre.org/data/definitions/345.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-359","guid":"b7dfe5b0-0351-645b-a311-b936102c2929","name":"Exposure of Private Personal Information to an Unauthorized Actor","shortDescription":{"text":"Exposure of Private Personal Information to an Unauthorized Actor"},"helpUri":"https://cwe.mitre.org/data/definitions/359.html"},{"id":"CWE-400","guid":"ca529a89-676d-8857-aac1-84359c77bb6c","name":"CWE-400","shortDescription":{"text":"CWE-400"},"helpUri":"https://cwe.mitre.org/data/definitions/400.html"},{"id":"CWE-407","guid":"7ba287ec-112f-185f-a4b4-2ae19d8d25a2","name":"CWE-407","shortDescription":{"text":"CWE-407"},"helpUri":"https://cwe.mitre.org/data/definitions/407.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-502","guid":"f7d3b296-aac0-5c5a-b706-e07faba26c36","name":"Deserialization of Untrusted Data","shortDescription":{"text":"Deserialization of Untrusted Data"},"helpUri":"https://cwe.mitre.org/data/definitions/502.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-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-611","guid":"1afbae66-ea29-2d59-aaa2-134e3ae2e85a","name":"Improper Restriction of XML External Entity Reference","shortDescription":{"text":"Improper Restriction of XML External Entity Reference"},"helpUri":"https://cwe.mitre.org/data/definitions/611.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-862","guid":"2d96ecd7-f7f1-7f55-9f3a-43bb5bafdf33","name":"Missing Authorization","shortDescription":{"text":"Missing Authorization"},"helpUri":"https://cwe.mitre.org/data/definitions/862.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-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.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"},{"id":"CWE-95","guid":"400bba4e-483c-5c50-a695-114fa9168003","name":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/95.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"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-1","guid":"a40d9a4c-89f5-4b5d-b2dc-32dc9cbfe814","name":"Insufficient Flow Control Mechanisms","shortDescription":{"text":"Insufficient Flow Control Mechanisms"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-01-Insufficient-Flow-Control-Mechanisms"},{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-7","guid":"4c4af28d-49e3-2d51-b597-e1396c49658b","name":"Insecure System Configuration","shortDescription":{"text":"Insecure System Configuration"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-07-Insecure-System-Configuration"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"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":1048,"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."]}]}